Sciweavers

512 search results - page 28 / 103
» k-Means Projective Clustering
Sort
View
VLDB
1999
ACM
224views Database» more  VLDB 1999»
14 years 7 days ago
Optimal Grid-Clustering: Towards Breaking the Curse of Dimensionality in High-Dimensional Clustering
Many applications require the clustering of large amounts of high-dimensional data. Most clustering algorithms, however, do not work e ectively and e ciently in highdimensional sp...
Alexander Hinneburg, Daniel A. Keim
KDD
2006
ACM
145views Data Mining» more  KDD 2006»
14 years 8 months ago
Deriving quantitative models for correlation clusters
Correlation clustering aims at grouping the data set into correlation clusters such that the objects in the same cluster exhibit a certain density and are all associated to a comm...
Arthur Zimek, Christian Böhm, Elke Achtert, H...
CIKM
2006
Springer
13 years 11 months ago
Adaptive non-linear clustering in data streams
Data stream clustering has emerged as a challenging and interesting problem over the past few years. Due to the evolving nature, and one-pass restriction imposed by the data strea...
Ankur Jain, Zhihua Zhang, Edward Y. Chang
DGO
2006
148views Education» more  DGO 2006»
13 years 9 months ago
Automatically labeling hierarchical clusters
Government agencies must often quickly organize and analyze large amounts of textual information, for example comments received as part of notice and comment rulemaking. Hierarchi...
Pucktada Treeratpituk, Jamie Callan
CVPR
2007
IEEE
14 years 10 months ago
Adaptive Distance Metric Learning for Clustering
A good distance metric is crucial for unsupervised learning from high-dimensional data. To learn a metric without any constraint or class label information, most unsupervised metr...
Jieping Ye, Zheng Zhao, Huan Liu