436 search results - page 27 / 88 » Automatic Subspace Clustering of High Dimensional Data for D... |
PKDD
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. Most real-world datasets are, to a certain degree, skewed. When considered that they are also large, they become the pinnacle challenge in data analysis. More importantly...
ICDM
2003
IEEE
14 years 29 days ago
2003
IEEE
We explore in this paper the efficient clustering of item data. Different from those of the traditional data, the features of item data are known to be of high dimensionality and...
ICDM
2006
IEEE
14 years 1 months ago
2006
IEEE
High dimensionality remains a significant challenge for document clustering. Recent approaches used frequent itemsets and closed frequent itemsets to reduce dimensionality, and to...
IJCV
2008
13 years 7 months ago
2008
For software and more illustrations: http://www.psi.utoronto.ca/anitha/fastTCA.htm Dimensionality reduction techniques such as principal component analysis and factor analysis are...
KDD
2002
ACM
14 years 8 months 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...