Sciweavers

434 search results - page 27 / 87
» Dimensionality Reduction of Clustered Data Sets
Sort
View
ICDM
2003
IEEE
184views Data Mining» more  ICDM 2003»
14 years 1 months ago
Analyzing High-Dimensional Data by Subspace Validity
We are proposing a novel method that makes it possible to analyze high dimensional data with arbitrary shaped projected clusters and high noise levels. At the core of our method l...
Amihood Amir, Reuven Kashi, Nathan S. Netanyahu, D...
ICML
2004
IEEE
14 years 9 months ago
K-means clustering via principal component analysis
Principal component analysis (PCA) is a widely used statistical technique for unsupervised dimension reduction. K-means clustering is a commonly used data clustering for unsupervi...
Chris H. Q. Ding, Xiaofeng He
KDD
2002
ACM
166views Data Mining» more  KDD 2002»
14 years 9 months ago
Frequent term-based text clustering
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...
Florian Beil, Martin Ester, Xiaowei Xu
PAKDD
2009
ACM
186views Data Mining» more  PAKDD 2009»
14 years 3 months ago
Pairwise Constrained Clustering for Sparse and High Dimensional Feature Spaces
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...
Su Yan, Hai Wang, Dongwon Lee, C. Lee Giles
PAMI
1998
88views more  PAMI 1998»
13 years 8 months ago
Large-Scale Parallel Data Clustering
—Algorithmic enhancements are described that enable large computational reduction in mean square-error data clustering. These improvements are incorporated into a parallel data-c...
Dan Judd, Philip K. McKinley, Anil K. Jain