Sciweavers

Share
165 search results - page 1 / 33
» HD-Eye - Visual Clustering of High dimensional Data
Sort
View
VLDB
1999
ACM
224views Database» more  VLDB 1999»
9 years 1 months 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
CORR
2010
Springer
219views Education» more  CORR 2010»
8 years 9 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
1998
ACM
233views Database» more  SIGMOD 1998»
9 years 1 months ago
Automatic Subspace Clustering of High Dimensional Data for Data Mining Applications
Data mining applications place special requirements on clustering algorithms including: the ability to nd clusters embedded in subspaces of high dimensional data, scalability, end...
Rakesh Agrawal, Johannes Gehrke, Dimitrios Gunopul...
DMIN
2008
152views Data Mining» more  DMIN 2008»
8 years 10 months ago
PCS: An Efficient Clustering Method for High-Dimensional Data
Clustering algorithms play an important role in data analysis and information retrieval. How to obtain a clustering for a large set of highdimensional data suitable for database ap...
Wei Li 0011, Cindy Chen, Jie Wang
ICML
2003
IEEE
9 years 10 months ago
Random Projection for High Dimensional Data Clustering: A Cluster Ensemble Approach
We investigate how random projection can best be used for clustering high dimensional data. Random projection has been shown to have promising theoretical properties. In practice,...
Xiaoli Zhang Fern, Carla E. Brodley
books