Sciweavers

625 search results - page 31 / 125
» Projective Clustering Ensembles
Sort
View
ICML
2006
IEEE
14 years 10 months ago
An investigation of computational and informational limits in Gaussian mixture clustering
We investigate under what conditions clustering by learning a mixture of spherical Gaussians is (a) computationally tractable; and (b) statistically possible. We show that using p...
Nathan Srebro, Gregory Shakhnarovich, Sam T. Rowei...
DEXAW
2007
IEEE
135views Database» more  DEXAW 2007»
14 years 4 months ago
Unsupervised Learning of Manifolds via Linear Approximations
In this paper, we examine the application of manifold learning to the clustering problem. The method used is Locality Preserving Projections (LPP), which is chosen because of its ...
Hassan A. Kingravi, M. Emre Celebi, Pragya P. Raja...
SIGMOD
2009
ACM
177views Database» more  SIGMOD 2009»
14 years 10 months ago
Exploiting context analysis for combining multiple entity resolution systems
Entity Resolution (ER) is an important real world problem that has attracted significant research interest over the past few years. It deals with determining which object descript...
Zhaoqi Chen, Dmitri V. Kalashnikov, Sharad Mehrotr...
COMPLIFE
2005
Springer
14 years 3 months ago
Robust Perron Cluster Analysis for Various Applications in Computational Life Science
In the present paper we explain the basic ideas of Robust Perron Cluster Analysis (PCCA+) and exemplify the different application areas of this new and powerful method. Recently, ...
Marcus Weber, Susanna Kube
WWW
2010
ACM
14 years 4 months ago
Web-scale k-means clustering
We present two modifications to the popular k-means clustering algorithm to address the extreme requirements for latency, scalability, and sparsity encountered in user-facing web...
D. Sculley