Streaming-data algorithms for high-quality clustering

Proceedings - International Conference on Data Engineering

Volumn , Issue , 2002, Pages 685-694

  O'Callaghan, Liadan ^a   Mishra, Nina ^a   Meyerson, Adam ^a   Guha, Sudipto ^a   Motwani, Rajeev ^a  

^a Stanford University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DATA STORAGE EQUIPMENT; HEURISTIC METHODS; OPTIMIZATION; QUERY LANGUAGES; SAMPLING;

CLUSTERING; STREAMING-DATA ALGORITHMS;

DATA REDUCTION;

EID: 0036203413     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (27)

1. Automatic subspace clustering of high dimensional data for data mining applications
2. Optics: Ordering points to identify the clustering structure
3. Refining initial points for K-Means clustering
4. Scaling clustering algorithms to large databases
5. Improved combinatorial algorithms for the facility location and k-median problems
6. True scalability for clustering algorithms
7. Clustering data streams
8. CURE: An efficient clustering algorithm for large databases
9. An efficient approach to clustering large multimedia databases with noise
10. Optimal grid-clustering: Towards breaking the curse of dimensionality in high-dimensional clustering
11. Primal-dual approximation algorithms for metric facility location and k-median problems
12. A statistical method for profiling network traffic
13. Offline network intrusion detection: Looking for footprints
14. Efficient and effective clustering methods for spatial data mining
15. K-means type algorithms: A generalized convergence theorem and characterization of local optimality
16. Wavecluster: A multi-resolution clustering approach for very large spatial databases
17. BIRCH: An efficient data clustering method for very large databases