Redefining clustering for high-dimensional applications

IEEE Transactions on Knowledge and Data Engineering

Volumn 14, Issue 2, 2002, Pages 210-225

  Aggarwal, Charu C ^a,b   Yu, Philip S ^a,b  

^a IEEE   (United States)

^b IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

Clustering; Data mining; Dimensionality curse; High dimensions

Indexed keywords

CLUSTERING ALGORITHMS;

ALGORITHMS; CORRELATION METHODS; DATA MINING; DATA STRUCTURES; VECTORS;

DATABASE SYSTEMS;

EID: 0036509717     PISSN: 10414347     EISSN: None     Source Type: Journal    
DOI: 10.1109/69.991713     Document Type: Article

References (39)

1. Automatic subspace clustering of high dimensional data for data mining applications
2. OPTICS: Ordering points to identify the clustering structure
3. When is nearest neighbor meaningful?
4. Fuzzy models and algorithms for pattern recognition and image processing
5. Entropy-based subspace clustering for mining numerical data
6. Fast algorithms for projected clustering
7. Finding generalized projected clusters in high dimensional spaces
8. Local dimensionality reduction: A new approach to indexing high dimensional spaces
9. Incremental clustering for mining in a data warehousing environment
10. A density based algorithm for discovering clusters in large spatial databases with noise
11. Robust clustering of large data sets with categorical attributes
12. Robust clustering of large geo referenced datasets
13. FastMap: A fast algorithm for indexing, data-mining and visualization of traditional and multimedia datasets
14. CACTUS- Clustering categorical data using summaries
15. Clustering large data sets in arbitrary metric spaces
16. Clustering categorical data: An approach based on dynamical systems
17. Similarity search in high dimensions via hashing
18. CURE: An efficient clustering algorithm for large databases
19. ROCK: A robust clustering algorithm for categorical attributes
20. Fuzzy clustering with a fuzzy covariance matrix
21. Optimal grid-clustering: Towards breaking the curse of dimensionality in high-dimensional clustering
22. Extensions of the k-Means algorithm for clustering large data sets with categorical values
23. Approximate nearest neighbors: Towards removing the curse of dimensionality
24. Snakes and sandwiches: Optimal clustering strategies for a data warehouse
25. Two algorithms for nearest-neighbor search in high dimensional space
26. Feature subset selection using the wrapper method: Overfitting and dynamic search space topology
27. Efficient and effective clustering methods for spatial data mining
28. Dimensionality reduction for similarity searching in dynamic databases
29. Grid clustering: An efficient hierarchical clustering method for very large datasets
30. Clustering and singular value decomposition for approximate indexing in high dimensional spaces
31. A distribution-based clustering algorithm for mining in large spatial databases
32. A comparative study of clustering methods
33. Clustering categorical data
34. BIRCH: An efficient data clustering method for very large databases
35. A fast algorithm for density-based clustering in large database