An adaptive density-based clustering algorithm for spatial database with noise

Proceedings - Fourth IEEE International Conference on Data Mining, ICDM 2004

Volumn , Issue , 2004, Pages 467-470

  Ma, Daoying ^a   Zhang, Aidong ^a  

^a State University of New York   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ADAPTIVE DENSITY-BASED CLUSTERING ALGORITHMS (ADBC); CLUSTERING SPATIAL DATA; REAL DATA SETS; SIMULATED DATA SETS;

ADAPTIVE SYSTEMS; ALGORITHMS; COMPUTER SIMULATION; DATA REDUCTION; GRAVITATION; MATHEMATICAL MODELS; MATHEMATICAL TRANSFORMATIONS; SET THEORY; SPURIOUS SIGNAL NOISE;

DATABASE SYSTEMS;

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

References (13)

1. M. Ankerst, M. Breuning, H.-P. Kriegel, and J. Sander. Optics: Ordering points to identify the clustering structure. Proc. 1999 ACM-SIGMOD Int. Conf. Management of Data (SIGMOD'99), pages 49-60, 1999.
2. Y. Bar-Shalom and W. D. Blair. Multitarget-Multisensor Tracking: Applications and Advances Volume III. Artech House, Norwood, MA, 2000.
3. N. Beckmann, H.-P. Kriegel, R. Schneider, and B. Seeger. The r*-tree: An efficient and robust access method for points and rectangles. Proc. 1990 ACM-SIGMOD Int. Conf. Management of Data (SIGMOD'90), pages 322-331, 1990.
4. B.Hofmann-Wellenhof, H.Lichtenegger, and J.Collins. Global Positioning System: Theory and Practice. Springer-Verlag Wien, New York, 1994.
5. S. Blackman and R. Popoli. Design and Analysis of Modern Tracking Sysytem. Artech House, Norwood, MA, 1999.
6. M. Ester, H.-P. Kriegel, J. Sander, and X. Xu. A density-based algorithm for discovering clusters in large spatial databases. Proc. 1996 Int. Conf. Knowledge Discovery and Data Mining(KDD'96), pages 226-231, 1996.
7. S. Guha, R. Rastogi, and K. Shim. Cure: An efficient clustering algorithm for large databases. Proc. 1998 ACM-SIGMOD Int. Conf. Management of Data (SIGMOD'98), pages 73-84, 1998.
8. A. Hinneburg and D. A. Keim. An efficient approach to clustering in large multimedia database with noise. Proc. 1998 Int. Conf. Knowledge Discovery and Data Mining(KDD'98), pages 58-65, 1998.
9. G. Karypis, E.-H. Han, and V. Kumar. Chameleon: A hierarchical clustering algorithm using dynamic modeling. Computer, 32:68-75, 1999.
10. L. Kaufman and P. J. Rousseeuw. Finding Groups in Data: An introduction to Cluster Analysis. John Wiley and Son, New York, 1990.
11. J. McQueen. Some methods for classification and analysis of multivariat observations. Proc. of the Fifth Berkeley Symposium on Mathematical Statistics and Probability, 1:281-297, 1967.
12. R. Ng and J. Han. Clarans: A method for clustering objects for spatial data mining. IEEE Trans. on Knowledge and Data Engineering, vol. 14, no. 5, 2002.
13. T. Zhang, R. Ramakrishnan, and M. Livny. Birch: An efficient data clustering method for very large databases. Proc. 1996 ACM-SIGMOD Int. Conf. Management of Data (SIGMOD'96), pages 103-114, 1996.