298 search results - page 3 / 60 » Subspace Clustering of High Dimensional Data |
ICDM
2009
IEEE
13 years 2 months ago
2009
IEEE
Text classification poses some specific challenges. One such challenge is its high dimensionality where each document (data point) contains only a small subset of them. In this pap...
SDM
2012
SIAM
11 years 7 months ago
2012
SIAM
Clustering of high dimensional data streams is an important problem in many application domains, a prominent example being network monitoring. Several approaches have been lately ...
SDM
2009
SIAM
14 years 1 months ago
2009
SIAM
In high dimensional data, the general performance of traditional clustering algorithms decreases. This is partly because the similarity criterion used by these algorithms becomes ...
ICDM
2002
IEEE
13 years 9 months ago
2002
IEEE
It is well-known that for high dimensional data clustering, standard algorithms such as EM and the K-means are often trapped in local minimum. Many initialization methods were pro...
PAKDD
2009
ACM
13 years 11 months ago
2009
ACM
Abstract. Clustering high dimensional data with sparse features is challenging because pairwise distances between data items are not informative in high dimensional space. To addre...