512 search results - page 20 / 103 » k-Means Projective Clustering |
ICML
2009
IEEE
14 years 8 months ago
2009
IEEE
Clustering data in high dimensions is believed to be a hard problem in general. A number of efficient clustering algorithms developed in recent years address this problem by proje...
ISCI
1998
13 years 7 months ago
1998
The ParaStation communication fabric provides a high-speed communicationnetwork with user-levelaccess to enable e cientparallel computing on workstation clusters. The architecture...
ICML
2004
IEEE
14 years 8 months ago
2004
IEEE
Many clustering algorithms fail when dealing with high dimensional data. Principal component analysis (PCA) is a popular dimensionality reduction algorithm. However, it assumes a ...
APVIS
2008
13 years 9 months ago
2008
With the success of open source software projects, such as Apache and Mozilla, comes the opportunity to study the development process. In this paper, we present StarGate: a novel ...
PAKDD
2009
ACM
14 years 5 months ago
2009
ACM
Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-...