298 search results - page 33 / 60 » Subspace Clustering of High Dimensional Data |
109
Voted
MSS
2003
IEEE
15 years 5 months ago
2003
IEEE
When data resides on tertiary storage, clustering is the key to achieving high retrieval performance. However, a straightforward approach to clustering massive amounts of data on ...
102
Voted
KDD
2002
ACM
16 years 26 days ago
2002
ACM
Text clustering methods can be used to structure large sets of text or hypertext documents. The well-known methods of text clustering, however, do not really address the special p...
110
Voted
ICDM
2007
IEEE
15 years 6 months ago
2007
IEEE
Support vector clustering transforms the data into a high dimensional feature space, where a decision function is computed. In the original space, the function outlines the bounda...
94
Voted
ICML
2005
IEEE
16 years 1 months ago
2005
IEEE
Recently, several manifold learning algorithms have been proposed, such as ISOMAP (Tenenbaum et al., 2000), Locally Linear Embedding (Roweis & Saul, 2000), Laplacian Eigenmap ...
99
Voted
SIGMOD
2000
ACM
15 years 4 months ago
2000
ACM
Clustering is one of the most important tasks performed in Data Mining applications. This paper presents an e cient SQL implementation of the EM algorithm to perform clustering in...