5880 search results - page 240 / 1176 » Data Clustering: A Review |
191
click to vote
NIPS
2004
15 years 8 months ago
2004
We propose a new method for clustering based on finding maximum margin hyperplanes through data. By reformulating the problem in terms of the implied equivalence relation matrix, ...
177
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Spectral clustering is one of the most widely used techniques for extracting the underlying global structure of a data set. Compressed sensing and matrix completion have emerged a...
197
click to vote
IPM
2007
15 years 6 months ago
2007
Understanding users’ navigation on the Web is important towards improving the quality of information and the speed of accessing large-scale Web data sources. Clustering of users...
160
click to vote
PAMI
2002
15 years 6 months ago
2002
In this article, we evaluate the performance of three clustering algorithms, hard K-Means, single linkage, and a simulated annealing (SA) based technique, in conjunction with four ...
176
click to vote
PVLDB
2008
15 years 5 months ago
2008
Data clustering is a difficult problem due to the complex and heterogeneous natures of multidimensional data. To improve clustering accuracy, we propose a scheme to capture the lo...