Sciweavers

1013 search results - page 57 / 203
» Comparisons Between Data Clustering Algorithms
Sort
View
PAMI
2007
202views more  PAMI 2007»
13 years 7 months ago
Weighted Graph Cuts without Eigenvectors A Multilevel Approach
—A variety of clustering algorithms have recently been proposed to handle data that is not linearly separable; spectral clustering and kernel k-means are two of the main methods....
Inderjit S. Dhillon, Yuqiang Guan, Brian Kulis
SDM
2008
SIAM
139views Data Mining» more  SDM 2008»
13 years 9 months ago
Simultaneous Unsupervised Learning of Disparate Clusterings
Most clustering algorithms produce a single clustering for a given data set even when the data can be clustered naturally in multiple ways. In this paper, we address the difficult...
Prateek Jain, Raghu Meka, Inderjit S. Dhillon
VLDB
1999
ACM
188views Database» more  VLDB 1999»
14 years 2 hour ago
Comparing Hierarchical Data in External Memory
We present an external-memory algorithm for computing a minimum-cost edit script between two rooted, ordered, labeled trees. The I/O, RAM, and CPU costs of our algorithm are, resp...
Sudarshan S. Chawathe
IJCNN
2007
IEEE
14 years 2 months ago
Spectral Clustering of Synchronous Spike Trains
— In this paper a clustering algorithm that learns the groups of synchronized spike trains directly from data is proposed. Clustering of spike trains based on the presence of syn...
António R. C. Paiva, Sudhir Rao, Il Park, J...
PDP
2003
IEEE
14 years 1 months ago
Scheduling strategies for mixed data and task parallelism on heterogeneous clusters and grids
We consider the execution of a complex application on a heterogeneous "grid" computing platform. The complex application consists of a suite of identical, independent pr...
Olivier Beaumont, Arnaud Legrand, Yves Robert