Sciweavers

113 search results - page 5 / 23
» Locally adaptive metrics for clustering high dimensional dat...
Sort
View
APWEB
2006
Springer
13 years 11 months ago
Generalized Projected Clustering in High-Dimensional Data Streams
Clustering is to identify densely populated subgroups in data, while correlation analysis is to find the dependency between the attributes of the data set. In this paper, we combin...
Ting Wang
TKDE
2011
332views more  TKDE 2011»
13 years 2 months ago
Adaptive Cluster Distance Bounding for High-Dimensional Indexing
—We consider approaches for similarity search in correlated, high-dimensional data-sets, which are derived within a clustering framework. We note that indexing by “vector appro...
Sharadh Ramaswamy, Kenneth Rose
SDM
2004
SIAM
162views Data Mining» more  SDM 2004»
13 years 8 months ago
Subspace Clustering of High Dimensional Data
Clustering suffers from the curse of dimensionality, and similarity functions that use all input features with equal relevance may not be effective. We introduce an algorithm that...
Carlotta Domeniconi, Dimitris Papadopoulos, Dimitr...
PR
2006
164views more  PR 2006»
13 years 7 months ago
Locally linear metric adaptation with application to semi-supervised clustering and image retrieval
Many computer vision and pattern recognition algorithms are very sensitive to the choice of an appropriate distance metric. Some recent research sought to address a variant of the...
Hong Chang, Dit-Yan Yeung
WIRN
2005
Springer
14 years 25 days ago
Ensembles Based on Random Projections to Improve the Accuracy of Clustering Algorithms
We present an algorithmic scheme for unsupervised cluster ensembles, based on randomized projections between metric spaces, by which a substantial dimensionality reduction is obtai...
Alberto Bertoni, Giorgio Valentini