Sciweavers

847 search results - page 7 / 170
» Approximation algorithms for projective clustering
Sort
View
ICDM
2009
IEEE
110views Data Mining» more  ICDM 2009»
14 years 2 months ago
Projective Clustering Ensembles
Recent advances in data clustering concern clustering ensembles and projective clustering methods, each addressing different issues in clustering problems. In this paper, we consi...
Francesco Gullo, Carlotta Domeniconi, Andrea Tagar...
SODA
2001
ACM
150views Algorithms» more  SODA 2001»
13 years 8 months ago
A faster implementation of the Goemans-Williamson clustering algorithm
We give an implementation of the Goemans-Williamson clustering procedure which is at the core of several approximation algorithms including those for Generalized Steiner Trees, Pr...
Richard Cole, Ramesh Hariharan, Moshe Lewenstein, ...
ICASSP
2010
IEEE
13 years 7 months ago
Learning from high-dimensional noisy data via projections onto multi-dimensional ellipsoids
In this paper, we examine the problem of learning from noisecontaminated data in high-dimensional space. A new learning approach based on projections onto multi-dimensional ellips...
Liuling Gong, Dan Schonfeld
ALT
2009
Springer
14 years 4 months ago
Approximation Algorithms for Tensor Clustering
Abstract. We present the first (to our knowledge) approximation algorithm for tensor clustering—a powerful generalization to basic 1D clustering. Tensors are increasingly common...
Stefanie Jegelka, Suvrit Sra, Arindam Banerjee
ESA
2011
Springer
251views Algorithms» more  ESA 2011»
12 years 7 months ago
Improved Approximation Algorithms for Bipartite Correlation Clustering
In this work we study the problem of Bipartite Correlation Clustering (BCC), a natural bipartite counterpart of the well studied Correlation Clustering (CC) problem. Given a bipart...
Nir Ailon, Noa Avigdor-Elgrabli, Edo Liberty, Anke...