Sciweavers

1105 search results - page 68 / 221
» Approximate Spectral Clustering.
Sort
View
APPROX
2008
Springer
101views Algorithms» more  APPROX 2008»
14 years 1 days ago
Streaming Algorithms for k-Center Clustering with Outliers and with Anonymity
Clustering is a common problem in the analysis of large data sets. Streaming algorithms, which make a single pass over the data set using small working memory and produce a cluster...
Richard Matthew McCutchen, Samir Khuller
PODS
2008
ACM
153views Database» more  PODS 2008»
14 years 10 months ago
Approximation algorithms for co-clustering
Co-clustering is the simultaneous partitioning of the rows and columns of a matrix such that the blocks induced by the row/column partitions are good clusters. Motivated by severa...
Aris Anagnostopoulos, Anirban Dasgupta, Ravi Kumar
SDM
2009
SIAM
220views Data Mining» more  SDM 2009»
14 years 7 months ago
Bayesian Cluster Ensembles.
Cluster ensembles provide a framework for combining multiple base clusterings of a dataset to generate a stable and robust consensus clustering. There are important variants of th...
Hongjun Wang, Hanhuai Shan, Arindam Banerjee
DAWAK
2007
Springer
14 years 4 months ago
MOSAIC: A Proximity Graph Approach for Agglomerative Clustering
Representative-based clustering algorithms are quite popular due to their relative high speed and because of their sound theoretical foundation. On the other hand, the clusters the...
Jiyeon Choo, Rachsuda Jiamthapthaksin, Chun-Sheng ...
CGF
2004
127views more  CGF 2004»
13 years 10 months ago
Approximated Centroidal Voronoi Diagrams for Uniform Polygonal Mesh Coarsening
We present a novel clustering algorithm for polygonal meshes which approximates a Centroidal Voronoi Diagram construction. The clustering provides an efficient way to construct un...
Sébastien Valette, Jean-Marc Chassery