DESCRY: A density based clustering algorithm for very large data sets

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

Volumn 3177, Issue , 2004, Pages 203-210

  Angiulli, Fabrizio ^a   Pizzuti, Clara ^a   Ruffolo, Massimo ^a  

^a UNIVERSITY OF CALABRIA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 35048816637     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-28651-6_30     Document Type: Article

References (9)

1. R.C. Dubes A.K. Jain. Algorithms for Clustering Data. Prentice Hall, 1988.
2. S. Guha, R. Rastogi, and K. Shim. Cure: An efficient clustering algorithm for large databases. In Proceedings of the ACM SIGMOD Int. Conf. on Management of Data, pages 73-84, New York, May 1998.
3. J. Han and M. Kamber. Data Mining- Concepts and Techniques. Morgan Kaufman, 2001.
4. A. K. Jain, M. N. Murty, and P. J. Flynn. Data clustering: a review. ACM Computing Surveys, 31(3):264-323, 1999.
5. G. Karypis, S. Han, and V. Kumar. Chameleon: Hierarchical clustering using dynamic modeling. IEEE Computer, pages 65-75, 1999.
6. L. Kaufman and P.J. Rousseew. Finding Groups in Data: an Introduction to Cluster Analysis. John Wiley & Sons, 1990.
7. H. Samet. The quadtree and related hierarchical data structures. ACM Computing Surveys, 16(2):187-260, 1984.
8. J. Vitter. Random sampling with a reservoir. ACM Transaction on Mathematical Software, 11(1):37-57, 1985.
9. T. Zhang, R. Ramakrishnan, and M. Livny. Birch: An efficient data clustering method for very large databases. In Proceedings of the ACM SIGMOD Int. Conf. on Managment of Data, pages 103-114, June 1996.