Data bubbles: Quality preserving performance boosting for hierarchical clustering

SIGMOD Record (ACM Special Interest Group on Management of Data)

Volumn 30, Issue 2, 2001, Pages 79-90

  Breunig, Markus M ^a   Kriegel, Hans Peter ^a   Kröger, Peer ^a   Sander, Jörg ^b  

^a UNIVERSITY OF MUNICH   (Germany)

^b UNIVERSITY OF BRITISH COLUMBIA   (Canada)

Author keywords

Clustering; Data compression; Database mining; Sampling

Indexed keywords

EID: 0040748327     PISSN: 01635808     EISSN: None     Source Type: Journal    
DOI: 10.1145/376284.375672     Document Type: Article

References (10)

1. Ankerst M., Breunig M. M., Kriegel H.-P., Sander J.: "OPTICS: Ordering Points To Identify the Clustering Structure", Proc. ACM SIGMOD Int. Conf. on Management of Data, Philadelphia, PA, 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. Breunig M., Kriegel H.-P., Sander J.: "Fast Hierarchical Clustering Based on Compressed Data and OPTICS", Proc. 4th European Conf. on Principles and Practice of Knowledge Discovery in Databases, LNCS Vol. 1910, Springer Verlag, Berlin, 2000, pp. 232-242.
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. Jain A. K. and Dubes R. C.: "Algorithms for Clustering Data", Prentice-Hall, Inc., 1988.
7. Kaufman L., Rousseeuw P. J.: "Finding Groups in Data: An Introduction to Cluster Analysis", John Wiley & Sons, 1990.
8. MacQueen J.: "Some Methods for Classification and Analysis of Multivariate Observations", Proc. 5th Berkeley Symp. Math. Statist. Prob., 1967, Vol. 1, pp. 281-297.
9. Sibson R.: "SLINK: an optimally efficient algorithm for the single-link cluster method", the Computer Journal Vol. 16, No. 1, 1973, pp. 30-34.
10. 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, Montreal, Canada, ACM Press, New York, 1996, pp. 103-114.