5595 search results - page 68 / 1119 » Approximation Algorithms for Clustering Problems |
157
Voted
NIPS
2008
15 years 6 months ago
2008
By attempting to simultaneously partition both the rows (examples) and columns (features) of a data matrix, Co-clustering algorithms often demonstrate surprisingly impressive perf...
202
Voted
COMPGEOM
2011
ACM
14 years 8 months ago
2011
ACM
We present a clustering scheme that combines a mode-seeking phase with a cluster merging phase in the corresponding density map. While mode detection is done by a standard graph-b...
132
Voted
STOC
2006
ACM
16 years 5 months ago
2006
ACM
Many approximation algorithms have been presented in the last decades for hard search problems. The focus of this paper is on cryptographic applications, where it is desired to de...
132
Voted
DEXAW
2007
IEEE
15 years 11 months ago
2007
IEEE
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 ...
126
Voted
ICPR
2008
IEEE
16 years 5 months ago
2008
IEEE
We present a new L1-distance-based k-means clustering algorithm to address the challenge of clustering high-dimensional proportional vectors. The new algorithm explicitly incorpor...