Sciweavers

766 search results - page 1 / 154
» Clustering high dimensional data using subspace and projecte...
Sort
View
CORR
2010
Springer
219views Education» more  CORR 2010»
13 years 4 months ago
Clustering high dimensional data using subspace and projected clustering algorithms
: Problem statement: Clustering has a number of techniques that have been developed in statistics, pattern recognition, data mining, and other fields. Subspace clustering enumerate...
Rahmat Widia Sembiring, Jasni Mohamad Zain, Abdull...
SIGMOD
2000
ACM
165views Database» more  SIGMOD 2000»
13 years 9 months ago
Finding Generalized Projected Clusters In High Dimensional Spaces
High dimensional data has always been a challenge for clustering algorithms because of the inherent sparsity of the points. Recent research results indicate that in high dimension...
Charu C. Aggarwal, Philip S. Yu
WIRN
2005
Springer
13 years 10 months 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
SDM
2004
SIAM
253views Data Mining» more  SDM 2004»
13 years 6 months ago
Density-Connected Subspace Clustering for High-Dimensional Data
Several application domains such as molecular biology and geography produce a tremendous amount of data which can no longer be managed without the help of efficient and effective ...
Peer Kröger, Hans-Peter Kriegel, Karin Kailin...
DASFAA
2007
IEEE
199views Database» more  DASFAA 2007»
13 years 11 months ago
Detection and Visualization of Subspace Cluster Hierarchies
Subspace clustering (also called projected clustering) addresses the problem that different sets of attributes may be relevant for different clusters in high dimensional feature sp...
Elke Achtert, Christian Böhm, Hans-Peter Krie...