1385 search results - page 52 / 277 » Clustering by Random Projections |
CORR
2007
Springer
14 years 11 months ago
2007
Springer
We present an exactly solvable random-subcube model inspired by the structure of hard constraint satisfaction and optimization problems. Our model reproduces the structure of the s...
ICANN
2009
Springer
15 years 4 months ago
2009
Springer
This paper proposes a clustering method SOMAK, which is composed by Self-Organizing Maps (SOM) followed by the Ant K-means (AK) algorithm. The aim of this method is not to find an...
101
click to vote
SIGIR
2002
ACM
14 years 11 months ago
2002
ACM
In this paper, we propose a document clustering method that strives to achieve: (1) a high accuracy of document clustering, and (2) the capability of estimating the number of clus...
SSPR
1998
Springer
15 years 4 months ago
1998
Springer
: We present a practical approach to nonparametric cluster analysis of large data sets. The number of clusters and the cluster centres are automatically derived by mode seeking wit...
CCGRID
2009
IEEE
15 years 6 months ago
2009
IEEE
Volunteer Computing (VC) projects harness the power of computers owned by volunteers across the Internet to perform hundreds of thousands of independent jobs. In VC projects, the ...