A study on the hierarchical data clustering algorithm based on gravity theory

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

Volumn 2168, Issue , 2001, Pages 350-361

  Oyang, Yen Jen ^a   Chen, Chien Yu ^a   Yang, Tsui Wei ^a  

^a NATIONAL TAIWAN UNIVERSITY   (Taiwan)

Author keywords

Agglomerative hierarchical clustering; Data clustering; Gravity force

Indexed keywords

CLUSTER ANALYSIS; DATA MINING; GRAVITATION; VECTOR SPACES;

AGGLOMERATIVE HIERARCHICAL CLUSTERING; CLUSTERING QUALITY; DATA CLUSTERING; GRAVITY FORCES; HIERARCHICAL CLUSTERING ALGORITHMS; HIERARCHICAL DATA CLUSTERING; SPACE COMPLEXITY; SPHERICAL CLUSTERS;

CLUSTERING ALGORITHMS;

EID: 84882111558     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44794-6_29     Document Type: Conference Paper

References (19)

1. Choudry, S. and N. Murty, A divisive scheme for constructing minimal spanning trees in coordinate space, Pattern Recognition Letters, volume 11 (1990), number 6, pp. 385-389
2. D. Eppstein, Fast hierarchical clustering and other applications of dynamic closest pairs, The ACM Journal of Experimental Algorithmics, 5(1):1-23, Jun 2000
3. M. Ester, H.-P. Kriegel, J. Sander, X. Xu, A density-based algorithm for discovering clusters in large spatial databases with noise, Proceedings of 2nd International Conference on Knowledge Discovery and Data Mining (KDD-96), Aug. 1996.
4. B. Everitt, Cluster analysis, Halsted Press, 1980.
5. S. Guha, R. Rastogi, and K. Shim. Cure: An efficient clustering algorithm for large databases. In Proc. 1998 ACM-SIGMOD Int. Conf. Management of Data(SIGMOD’98), pages 73-84, Seattle, WA, June 1998.
6. S. Guha, R. Rastogi, and S. Kyuseok. ROCK: A robust clustering algorithm for categorical attributes. In Proceedings of ICDE'99, pp. 512-521, 1999.
7. J. Han, M. Kamber, Data Mining: Concepts and Techniques, Morgan Kaufmann Publishers, 2000
8. A. Hinneburg, and D. A. Keim, An Efficient Approach to Clustering in Large Multimedia Databases with Noise, Proceedings of the 4th International Conference on Knowledge Discovery and Data Mining, (KDD98), pp. 58-65, 1998.
9. A. K. Jain, R. C. Dubes, Algorithms for clustering data, Prentice Hall, 1988.
10. A. K. Jain, M. N. Murty, P. J. Flynn, Data Clustering: A Review, ACM Computing Surveys, Vol. 31, No. 3, pp. 264-323, Sep. 1999.
11. G. Karypis, E.-H. Han, and V. Kumar. CHAMELEON: A hierarchical clustering algorithm using dynamic modeling. COMPUTER, 32:68-75, 1999
12. D. Krznaric and C. Levcopoulos, Fast Algorithms for Complete Linkage Clustering, Discrete & Computational Geometry, 19:131-145, 1998.
13. Kurita, T., An efficient agglomerative clustering algorithm using a heap, Pattern Recognition, volume 24 (1991), number 3 pp. 205-209
14. R. T. Ng, J. Han, Efficient and Effective Clustering Methods for Spatial Data Mining, VLDB'94, Proceedings of 20th International Conference on Very Large Data Bases, pp. 144-155, Sep. 1994.
15. M. Stonebraker, J. Frew, K. Gardels and J. Meredith, The Sequoia 2000 Storage Benchmark, Proceedings of SIGMOD, pp. 2–11, 1993.
16. W. E. Wright, Gravitational Clustering, Pattern Recognition, 1977, Vol. 9, pp. 151-166.
17. X. Xu, M. Ester, H.-P. Kriegel, J. Sander, A distribution-based clustering algorithm for mining in large spatial databases, In Proceedings of 14th International Conference on Data Engineering (ICDE’98), 1998.
18. Zamir, O. and O. Etzioni (1998). Web document clustering: A feasibility demonstration. In Proceedings of the 21th International ACM SIGIR Conference, pp. 46--54.
19. T. Zhang, R. Ramakrishnan, M. Livny, BIRCH: An Efficient Data Clustering Method for Very Large Databases, Proceedings of the 1996 ACM SIGMOD International Conference on Management of Data, pp. 103-114, Jun. 1996.