Speedup clustering with hierarchical ranking

Proceedings - IEEE International Conference on Data Mining, ICDM

Volumn , Issue , 2006, Pages 1205-1210

  Zhou, Jianjun ^a   Sander, Joerg ^a  

^a UNIVERSITY OF ALBERTA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

DATA OBJECTS; REAL-LIFE DATA;

DATA MINING; DATA STRUCTURES;

CLUSTERING ALGORITHMS;

EID: 78149285136     PISSN: 15504786     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDM.2006.151     Document Type: Conference Paper

References (15)

1. M. Ankerst, M. M. Breunig, H.-P. Kriegel, and J. Sander. OPTICS: Ordering Points To Identify the Clustering Structure. SIGMOD'99, pp. 49-60.
2. V. Athitsos, M. Hadjieleftheriou, G. Kollios, and S. Sclaroff. Query-sensitive embeddings. SIGMOD'05, pages 706-717.
3. M. Breunig, H.-P. Kriegel, P. Kröger, and J. Sander. Data Bubbles: Quality Preserving Performance Boosting for Hierarchical Clustering. SIGMOD'01, pp. 79-90.
4. C. Elkan. Using the Triangle Inequality to Accelerate k-Means. ICML'03, pp. 147-153.
5. E. Chavez, G. Navarro, R. A. Baeza-Yates, and J. L.Marroquin. Searching in metric spaces. ACM Comput. Surv., 33(3):273-321, 2001.
6. M. Ester, H.-P. Kriegel, J. Sander, and X. Xu. A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise. KDD'96, pp. 226-231.
7. G. R. Hjaltason and H. Samet. Index-driven similarity search in metric spaces. TODS, 28(4):517-580, 2003.
8. J. Han and M. Kamber. Data Mining: Concepts and Techniques. Morgan Kaufmann Publishers, 2001.
9. B. Larsen and C. Aone. Fast and Effective Text Mining Using Linear-time Document Clustering. KDD'99, 16-22.
10. P. Ciaccia, M. Patella, and P. Zezula. M-tree: An Efficient Access Method for Similarity Search in Metric Spaces. VLDB'97, pp. 426-435.
11. S. Russell, P. Norvig. Artificial Intelligence: A Modern Approach, Prentice Hall Series in Artificial Intelligence. Englewood Cliffs, New Jersey, 1995.
12. G.D. Stormo. DNA binding sites: representation and discovery. Bioinformatics. 2000 Jan;16(1):16-23
13. E. Vidal. An algorithm for finding nearest neighbours in (approximately) constant average time. Pattern Recogn. Lett., 4(3):145-157, 1986.
14. T. Zhang, R. Ramakrishnan, Linvy M.: BIRCH: An Efficient Data Clustering Method for Very Large Databases. SIGMOD'96, pp. 103-114.
15. J. Zhou and J. Sander. Data bubbles for non-vector data: Speeding-up hierarchical clustering in arbitrary metric spaces. VLDB'03, pp 452-463.