C2P: Clustering based on closest pairs

VLDB 2001 - Proceedings of 27th International Conference on Very Large Data Bases

Volumn , Issue , 2001, Pages 331-340

  Nanopoulos, Alexandros ^a   Theodoridis, Yannis ^b   Manolopoulos, Yannis ^a,c  

^a ARISTOTLE UNIVERSITY OF THESSALONIKI   (Greece)

^b University of Patras and Computer Technology Institute   (Greece)

^c UNIVERSITY OF CYPRUS   (Cyprus)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS;

GRAPH-THEORETIC; HIER-ARCHICAL CLUSTERING; LARGE DATABASE; NEW CLUSTERING ALGORITHMS; QUALITY OF CLUSTERING; SCALABLE CLUSTERING; SPATIAL ACCESS METHODS; SPATIAL DATABASE;

CLUSTERING ALGORITHMS;

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

References (36)

1. M. Ankerst, M. Breunig, H-P. Kriegel, J. Sander: "OPTICS: Ordering Points To Identifythe Clustering Structure". Proc. ACM Int. Conf. on Management of Data (SIGMOD' 99), 1999, pp. 49-60.
2. J. Augustson, J. Minker: "An Analysis of some Graph Theoretical Clustering Techniques". Journal of the ACM, Vol.17, 4, 571-588, 1970.
3. C. Aggarwal, P. Yu: "Finding Generalized Projected Clusters In High Dimensional Spaces". Proc. ACM Int. Conf. on Management of Data (SIGMOD'00), 2000, pp. 70-81.
4. C. Böhm, B. Braunmüller, M. Breunig, H.- P. Kriegel: "High Performance Clustering Based on the SimilarityJoin ". Proc. Int. Conf. on Information and Knowledge Management (CIKM'00), 2000.
5. M. Breunig, H.-P. Kriegel, P. Kroger, J. Sander: "Data Bubbles: QualityP reserving Performance Boosting for Hierarchical Clustering". Proc. ACM Int. Conf. on Management of Data (SIGMOD'01), 2001.
6. M. Breunig, H.-P. Kriegel, J. Sander: "Fast Hierarchical Clustering Based on Compressed Data and OPTICS". Proc. European Conf. on Principles and Practice of Knowledge Discovery in Databases (PKDD'00), 2000.
7. A. Corral, Y. Manolopoulos, Y. Theodoridis, M. Vassilakopoulos: "Closest Pair Queries in Spatial Databases". Proc. ACM Int. Conf. on Management of Data (SIGMOD'00), 2000, pp. 189-200.
8. A. Corral, Y. Manolopoulos, Y. Theodoridis, M. Vassilakopoulos: "Algorithms for Processing Closest Pair Queries in Spatial Databases". Tech. Report (available at wwwde. csd.auth.gr/publications.html), 2001.
9. D. Eppstein: "Fast Hierarchical Clustering and Other Applications of Dynamic Closest Pairs". Proc. Symposium on Discrete Algorithms (SODA'98), 1998.
10. M. Ester, H.-P. Kriegel, J. Sander, X. Xu: "A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise". Proc. Int. Conf. on Knowledge Discovery and Data Mining (KDD'96), 1996.
11. M. Ester, H.-P. Kriegel, X. Xu: "Knowledge Discoveryin Large Spatial Databases: Focusing Techniques for Efficient Class Identification", Proc. Int. Symp. on Large Spatial Databases (SSD'95), 1995, pp. 67-82.
12. D. Fisher: "Knowledge Acquisition via Incremental Conceptual Clustering". Machine Learning, Vol.2, 139-172, 1987.
13. S. Guha, R. Rastogi, K. Shim: "CURE: An Efficient Clustering Algorithm for Large Databases". Proc. ACM Int. Conf. on Management of Data (SIGMOD'98), 1998, pp. 73- 84.
14. A. Hinneburg, D. Keim: "Optimal Grid- Clustering: Towards Breaking the Curse of Dimensionalityin High-Dimensional Clustering". Proc. Int. Conf. on Very Large Databases (VLDB'99), 1999, pp. 506-517.
15. G. Hjaltason, H. Samet: "Incremental Distance Join Algorithms for Spatial Databases". Proc. ACM Int. Conf. on Management of Data (SIGMOD'98), 1998, pp. 237-248.
16. N. Jose-Hkajavi, K. Salem: "Two-phase Clustering of Large Datasets". Technical Report CS-98-27, Department of Computer Science, Universityof Waterloo, 1998.
17. A. Jain, M. Murty, P. Flynn: "Data Clustering: A Review". ACM Computing Surveys, Vol.31, No.3, 264-323, 1999.
18. I. Kamel, C. Faloutos: "On Packing R-trees". Proc. Int. Conf. on Information and Knowledge Managemenet (CIKM'93), 1993, pp. 490- 499.
19. G. Kollios, D. Gunopoulos, N. Koudas, S. Berchtold: "An Efficient Approximation Scheme for Data Mining Tasks". Proc. IEEE Int. Conf. on Data Engineering (ICDE'01), 2001, pp. 453-462.
20. G. Karypis, E. Han, V. Kumar: "Chameleon: Hierarchical Clustering Using Dynamic Modeling". IEEE Computer, Vol.32, No.8, 68-75, 1999.
21. M. Murty, G. Krishna: "A Computationally Efficient Technique for Data Clustering". Pattern Recognition, Vol. 12, 153-158, 1980.
22. R. Michalski, R. Stepp, E. Diday: "A Recent Advance in Data Analysis: Clustering Objects into Classes Characterized byC onjuctive Concepts". Progress in Pattern Recognition, Vol. 1, North-Holland Publishing, 1983.
23. R. Ng, J. Han: "Efficient and Effective Clustering Methods for Spatial Data Mining". Proc. Int, Conf. on Very Large Databases (VLDB'94), 1994, pp. 144-155.
24. A. Nanopoulos, Y. Theodoridis, Y. Manolopoulos: "C2P: Clustering based on Closest Pairs". Tech. Report (available at wwwde. csd.auth.gr/publications.html), 2001.
25. C. Palmer, C. Faloutsos: "DensityBiased Sampling: An Impoved Method for Data Mining and Clustering", Proc. ACM Int. Conf. on Management of Data (SIGMOD'00), 2000, pp. 82-92.
26. F. Preparata, M. Shamos: "Computational Geometry: an Introduction". Springer-Verlag, 1985.
27. V. Raghavan, C. Yu: "A Comparison of the StabilityCh aracteristics of some Graph Theoretic Clustring Methods". IEEE Trans. on Pattern Analysis Machine Intelligence, Vol.3, 393-402, 1981.
28. H. Samet: "The Design and Analysis of Spatial Data Structures". Addison Wesley, 1990.
29. R. Sedgewick: "Algorithms". Addison Wesley, 1983.
30. G. Sheikholeslami, S. Chatterjee, A. Zhang: "WaveCluster: A Wavelet Based Clustering Approach for Spatial Data in VeryL arge Databases". VLDB Journal, Vol. 8(3-4), 289-304, 1999.
31. R. Sedgewick, P. Flajolet: "An Introduction to the Analysis of Algorithms, Addison Wesley, 1996.
32. J. Vitter: "Random Sampling with a Reservoir". ACM Trans. on Mathematical Software, 11(1), 37-57, 1985.
33. W. Wang, J. Yang, R. Muntz: "STING: A Statistical Information Grid Approach to Spatial Data Mining". Proc. Int. Conf. on Very Large Databases (VLDB'97), 1997, pp. 186- 195.
34. X. Xu, M. Ester, H.-P. Kriegel, J. Sander: "A Nonparametric Clustering Algorithm for Knowledge Discoveryi n Large Spatial Databases". Proc. Int. Conf. on Data Engineering (ICDE'98), 1998.
35. C. Zahn: "Graph-theoretical Methods for Detecting and Describing Gestalt Clusters". IEEE Trans. Computers C-20, 1971, pp. 68-86.
36. T. Zhang, R. Ramakrishnan, M.Linvy: "BIRCH: An Efficient Data Clustering Method for VeryL arge Databases". Proc. ACM Int. Conf. on Management of Data (SIGMOD'96), 1996, pp. 103-114.