Fast hierarchical clustering based on compressed data and OPTICS

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1910, Issue , 2000, Pages 232-242

  Breunig, Markus M ^a   Kriegel, Hans Peter ^a   Sander, Jörg ^a  

^a UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CLUSTER ANALYSIS; DATA MINING; GRAPHIC METHODS;

APPROPRIATE DISTANCES; CLUSTERING RESULTS; COMPRESSION TECHNIQUES; GRAPHICAL REPRESENTATIONS; HIER-ARCHICAL CLUSTERING; HIERARCHICAL CLUSTERING ALGORITHMS; HIERARCHICAL CLUSTERING METHODS; SUFFICIENT STATISTICS;

K-MEANS CLUSTERING;

EID: 84958045836     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45372-5_23     Document Type: Conference Paper

References (11)

1. Ankerst M., Breunig M. M., Kriegel H.-P., Sander J.: "OPTICS: Ordering Points To Identify the Clustering Structure", Proc. ACM SIGMOD’99 Int. Conf. on Management of Data, Philadelphia, 1999, pp. 49-60.
2. Bradley P. S., Fayyad U., Reina C.: "Scaling Clustering Algorithms to Large Databases", Proc. 4th Int. Conf. on Knowledge Discovery and Data Mining, New York, NY, AAAI Press, 1998, pp. 9-15.
3. Berchthold S., Keim D., Kriegel H.-P.: "The X-Tree: An Index Structure for High-Dimensional Data", 22nd Conf. on Very Large Data Bases, Bombay, India, 1996, pp. 28-39.
4. DuMouchel W., Volinsky C., Johnson T., Cortez C., Pregibon D.: "Sqashing Flat Files Flatter", Proc. 5th Int. Conf. on Knowledge Discovery and Data Mining, San Diego, CA, AAAI Press, 1999, pp. 6-15.
5. Ester M., Kriegel H.-P., Sander J., Xu X.: "A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise", Proc. 2nd Int. Conf. on Knowledge Discovery and Data Mining, Portland, OR, AAAI Press, 1996, pp. 226-231.
6. Ester M., Kriegel H.-P., Xu X.: "Knowledge Discovery in Large Spatial Databases: Focusing Techniques for Efficient Class Identification", Proc. 4th Int. Symp. on Large Spatial Databases (SSD’95), Portland, ME, 1995, LNCS 591, Springer, 1995, pp. 67-82.
7. Fayyad U., Piatetsky-Shapiro G., Smyth P.: "Knowledge Discovery and Data Mining: Towards a Unifying Framework". Proc. 2nd Int. Conf. on Knowledge Discovery and Data Mining, Portland, OR, 1996, pp. 82-88.
8. Kaufman L., Rousseeuw P. J.: "Finding Groups in Data: An Introduction to Cluster Analysis", John Wiley & Sons, 1990.
9. MacQueen, J.: "Some Methods for Classification and Analysis of Multivariate Observations", Proc. 5th Berkeley Symp. on Math. Statist. and Prob., Vol. 1, 1965, pp. 281-297.
10. Sibson R.: "SLINK: An Optimally Efficient Algorithm for the Single-Link Cluster Method", The Computer Journal, Vol. 16, No. 1, 1973, pp. 30-34.
11. Zhang T., Ramakrishnan R., Linvy M.: "BIRCH: An Efficient Data Clustering Method for Very Large Databases", Proc. ACM SIGMOD Int. Conf. on Management of Data, ACM Press, New York, 1996, pp. 103-114.