A local-density based spatial clustering algorithm with noise

Information Systems

Volumn 32, Issue 7, 2007, Pages 978-986

  Duan, Lian ^a   Xu, Lida ^b,d   Guo, Feng ^c   Lee, Jun ^a   Yan, Baopin ^a  

^a INSTITUTE OF GEOLOGY AND GEOPHYSICS   (China)

^b INSTITUTE OF COMPUTING TECHNOLOGY   (China)

^c ZHEJIANG UNIVERSITY   (China)

^d OLD DOMINION UNIVERSITY   (United States)

Author keywords

Data mining; Local outlier factor; Local reachability density; Local density based clustering

Indexed keywords

ACOUSTIC NOISE; COMPETITIVE INTELLIGENCE; DATA MINING; DATABASE SYSTEMS; PARAMETER ESTIMATION; VIRTUAL REALITY;

DENSITY-BASED CLUSTERING; LOCAL OUTLIER FACTORS; LOCAL REACHABILITY DENSITY; LOCAL-DENSITY-BASED CLUSTERING;

CLUSTERING ALGORITHMS;

EID: 34347333289     PISSN: 03064379     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.is.2006.10.006     Document Type: Article

References (13)

1. Breunig M.M., Kriegel H.-P., Ng R.T., and Sander J. LOF. identifying density-based local outliers. In: Chen W., Naughton J.F., and Bernstein P.A. (Eds). Proceedings of ACM SIGMOD International Conference on Management of Data. Dalles, TX (2000), ACM, New York 93-104
2. Jain A.K., and Dubes R.C. Algorithms for Clustering Data (1988), Prentice-Hall, Englewood Cliffs, NJ
3. Ester M., Kriegel H.-P., Sander J., and Xu X. A density-based algorithm for discovering clusters in large spatial databases with noise. In: Simoudis E., Han J., and Fayyad U.M. (Eds). Proceedings of the Second International Conference on Knowledge Discovery and Data Mining. Port Land, OR (1996), AAAI, Menlo Park, CA 226-231
4. Ankerst M., Breunig M.M., Kriegel H.-P., and Sander J. OPTICS. ordering points to identify the clustering structure. In: Delis A., Faloutsos C., and Ghandeharizadeh S. (Eds). Proceedings of ACM SIGMOD International Conference on Management of Data. Philadelphia, PA (1999), ACM, New York 49-60
5. Sheikholeslami G., Chatterjee S., and Zhang A. WaveCluster. a multi-resolution clustering approach for very large spatial databases. In: Gupta A., Shmueli O., and Widom J. (Eds). Proceedings of 24th International Conference on Very Large Data Bases. New York, NY (1988), Morgan Kaufmann, Los Altos, CA 428-439
6. Li H., Xu L., Wang J., and Mo Z. Feature space theory in data mining: transformations between extensions and intensions in knowledge representation. Expert Syst. 20 2 (2003) 60-71
7. Li H., and Xu L. Feature space theory-a mathematical foundation for data mining. Knowledge-Based Syst. 14 (2001) 253-257
8. Hinneburg A., and Keim D.A. An efficient approach to clustering in large multimedia databases with noise. In: Agrawal R., Stolorz P.E., and Piatetsky-Shapiro G. (Eds). Proceedings of Fourth International Conference on Knowledge Discovery and Data Mining. New York, NY (1998), AAAI, Menlo Park, CA 58-65
9. Agrawal R., Gehrke J., Gunopulos D., and Raghavan P. Automatic subspace clustering of high dimensional data for data mining applications. In: Haas L.M., and Tiwary A. (Eds). Proceedings of ACM SIGMOD International Conference on Management of Data. Seattle, WA (1998), ACM, New York 94-105
10. S. Ma, T.J. Wang, S.W. Tang, A New Fast Clustering Algorithm Based on Reference and Density, Lectures Notes in Computer Science, vol. 2762, Springer, Berlin, 2003, pp. 214-225.
11. Ma W.M., Eden C., and Tommy W.S. A new shifting grid clusting algorithm. Pattern Recognition 37 3 (2004) 503-514
12. Berchtold S., Keim D.A., and Kriegel H.-P. The X-tree. an index structure for high-dimensional data. In: Vijayaraman T.M., Buchmann A.P., Mohan C., and Sarda N.L. (Eds). Proceedings of 22nd Conference on Very Large Data Bases. Bombay, India (1996), Morgan Kaufmann, Los Altos, CA 28-39
13. Weber R., Schek H.-J., and Blott S. A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces. In: Gupta A., Shmueli O., and Widom J. (Eds). Proceedings of 24th International Conference on Very Large Data Bases. New York, NY (1998), Morgan Kaufmann, Los Altos, CA 194-205