Sciweavers

16 search results - page 1 / 4
» Finding Clusters in subspaces of very large, multi-dimension...
Sort
View
ICDE
2010
IEEE
222views Database» more  ICDE 2010»
13 years 5 months ago
Finding Clusters in subspaces of very large, multi-dimensional datasets
Abstract— We propose the Multi-resolution Correlation Cluster detection (MrCC), a novel, scalable method to detect correlation clusters able to analyze dimensional data in the ra...
Robson Leonardo Ferreira Cordeiro, Agma J. M. Trai...
IEEEVAST
2010
13 years 1 months ago
Finding and visualizing relevant subspaces for clustering high-dimensional astronomical data using connected morphological opera
Data sets in astronomy are growing to enormous sizes. Modern astronomical surveys provide not only image data but also catalogues of millions of objects (stars, galaxies), each ob...
Bilkis J. Ferdosi, Hugo Buddelmeijer, Scott Trager...
KDD
2000
ACM
222views Data Mining» more  KDD 2000»
13 years 10 months ago
Interactive exploration of very large relational datasets through 3D dynamic projections
The grand tour, one of the most popular methods for multidimensional data exploration, is based on orthogonally projecting multidimensional data to a sequence of lower dimensional...
Li Yang
SIGMOD
1996
ACM
151views Database» more  SIGMOD 1996»
13 years 11 months ago
BIRCH: An Efficient Data Clustering Method for Very Large Databases
Finding useful patterns in large datasets has attracted considerable interest recently, and one of the most widely st,udied problems in this area is the identification of clusters...
Tian Zhang, Raghu Ramakrishnan, Miron Livny
SIGMOD
2000
ACM
165views Database» more  SIGMOD 2000»
13 years 11 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