SWIFT—Scalable clustering for automated identification of rare cell populations in large, high‐dimensional flow cytometry datasets, part 2: biological evaluation

TR Mosmann, I Naim, J Rebhahn, S Datta… - Cytometry Part …, 2014 - Wiley Online Library
A multistage clustering and data processing method, SWIFT (detailed in a companion
manuscript), has been developed to detect rare subpopulations in large, high‐dimensional …

Greenit service level agreements

G Von Laszewski, L Wang - Grids and Service-Oriented Architectures for …, 2010 - Springer
In this paper we are introducing a framework towards the inclusion of Green IT metrics as
part of service level agreements for future Grids and Clouds. As part of this effort we need to …

[图书][B] Scalable data clustering using GPUs

AD Pangborn - 2010 - search.proquest.com
Flow cytometry is a mainstay technology used by biologists and immunologists for counting,
sorting, and analyzing cells suspended in a fluid. Like many modern scientific applications …

Accelerating medoids-based clustering with the Intel Many Integrated Core architecture

T Rechkalov, M Zymbler - 2015 9th International Conference on …, 2015 - ieeexplore.ieee.org
The Partition Around Medoids (PAM) is a variation of well known k-Means clustering
algorithm where center of each cluster should be chosen as an object of clustered set of …

Partition Around Medoids Clustering on the Intel Xeon Phi Many-Core Coprocessor

TV Rechkalov - CEUR Workshop Proceedings. Vol. 1513: Proceedings …, 2015 - elar.urfu.ru
The paper touches upon the problem of implementation Partition Around Medoids (PAM)
clustering algorithm for the Intel Many Integrated Core architecture. PAM is a form of well …

[PDF][PDF] Параллельный алгоритм кластеризации для многоядерного сопроцессора Intel Xeon Phi

ТВ Речкалов - Суперкомпьютерные дни в России, 2015 - 2015.russianscdays.org
В работе описана параллельная версия алгоритма кластеризации Partitioning Around
Medoids для сопроцессора Intel Xeon Phi. Распараллеливание выполнено на основе …

GPU Hızlandırmalı Veri Demetleme Algoritmalarının İncelenmesi

NM Çetin, M Hacıömeroğlu - AJIT-e: Academic Journal of …, 2013 - dergipark.org.tr
Veri demetleme algoritmaları, arama; spam, saldırı tespiti; hücre, gen, doküman analizi;
moleküler dinamik simülasyonlarının biçimlerinin analizi gibi uygulamalar için oldukça …

Parallel unsupervised Synthetic Aperture Radar image change detection on a graphics processing unit

H Zhu, Y Cao, Z Zhou, M Gong… - The International journal …, 2013 - journals.sagepub.com
Change detection is now routinely applied in many application domains, such as damage
assessment, environmental monitoring and agricultural surveys. As the number of remote …

A parallel implementation of the Gustafson-Kessel clustering algorithm with CUDA

JB Seo, DW Kim - IEICE TRANSACTIONS on Information and …, 2012 - search.ieice.org
Despite the benefits of the Gustafson-Kessel (GK) clustering algorithm, it becomes
computationally inefficient when applied to high-dimensional data. In this letter, a parallel …

A parallel data clustering algorithm for Intel MIC accelerators

TV Rechkalov, ML Tsymbler - Numerical methods and programming, 2019 - mathnet.ru
The PAM (Partitioning Around Medoids) is a partitioning clustering algorithm where each
cluster is represented by an object from the input dataset (called a medoid). The medoid …