Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

13

SODA
2000
ACM

favoriteEmaildiscussreport

125views Algorithms» more SODA 2000»

Approximation algorithms for projective clustering

13 years 5 months ago

Approximation algorithms for projective clustering

Download biogeometry.duke.edu

We consider the following two instances of the projective clustering problem: Given a set

Pankaj K. Agarwal, Cecilia Magdalena Procopiuc

Real-time Traffic

Algorithms | Ç´ ÐÓ | Projective Clustering Problem | SODA 2000 | ÐÓ Òµ |

claim paper

Related Content

» Ensembles Based on Random Projections to Improve the Accuracy of Clustering Algorithms

» Approximate Spectral Clustering

» Advancing data clustering via projective clustering ensembles

» A 2Approximation Algorithm for Scheduling Independent Tasks onto a Uniform Parallel Machin...

» Fast approximate spectral clustering

» Kmeans clustering of proportional data using L1 distance

» Improving Quality of Search Results Clustering with Approximate Matrix Factorisations

» Comparison of Clustering Algorithms in the Context of Software Evolution

» Clustering high dimensional data using subspace and projected clustering algorithms

Post Info
More Details (n/a)

Added	01 Nov 2010
Updated	01 Nov 2010
Type	Conference
Year	2000
Where	SODA
Authors	Pankaj K. Agarwal, Cecilia Magdalena Procopiuc

Comments (0)