Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.5555/3001460.3001507guideproceedingsArticle/Chapter ViewAbstractPublication PagesConference Proceedingsacm-pubtype
Article

A density-based algorithm for discovering clusters in large spatial databases with noise

Published: 02 August 1996 Publication History
  • Get Citation Alerts
  • Abstract

    Clustering algorithms are attractive for the task of class identification in spatial databases. However, the application to large spatial databases rises the following requirements for clustering algorithms: minimal requirements of domain knowledge to determine the input parameters, discovery of clusters with arbitrary shape and good efficiency on large databases. The well-known clustering algorithms offer no solution to the combination of these requirements. In this paper, we present the new clustering algorithm DBSCAN relying on a density-based notion of clusters which is designed to discover clusters of arbitrary shape. DBSCAN requires only one input parameter and supports the user in determining an appropriate value for it. We performed an experimental evaluation of the effectiveness and efficiency of DBSCAN using synthetic data and real data of the SEQUOIA 2000 benchmark. The results of our experiments demonstrate that (1) DBSCAN is significantly more effective in discovering clusters of arbitrary shape than the well-known algorithm CLAR-ANS, and that (2) DBSCAN outperforms CLARANS by a factor of more than 100 in terms of efficiency.

    References

    [1]
    Beckmann N., Kriegel H.-P., Schneider R, and Seeger B. 1990. The R*-tree: An Efficient and Robust Access Method for Points and Rectangles, Proc. ACM SIGMOD Int. Conf. on Management of Data, Atlantic City, NJ, 1990, pp. 322-331.
    [2]
    Brinkhoff T., Kriegel H.-R, Schneider R., and Seeger B. 1994 Efficient Multi-Step Processing of Spatial Joins, Proc. ACM SIGMOD Int. Conf. on Management of Data, Minneapolis, MN, 1994, pp. 197-208.
    [3]
    Ester M., Kriegel H.-P., and Xu X. 1995. A Database Interface for Clustering in Large Spatial Databases, Proc. 1st Int. Conf. on Knowledge Discovery and Data Mining, Montreal, Canada, 1995, AAAI Press, 1995.
    [4]
    García J.A., Fdez-Valdivia J., Cortijo F. J., and Molina R. 1994. A Dynamic Approach for Clustering Data. Signal Processing, Vol. 44, No. 2, 1994, pp. 181-196.
    [5]
    Gueting R.H. 1994. An Introduction to Spatial Database Systems. The VLDB Journal 3(4):357-399.
    [6]
    Jain Anil K. 1988. Algorithms for Clustering Data. Prentice Hall.
    [7]
    Kaufman L., and Rousseeuw P.J. 1990. Finding Groups in Data: an Introduction to Cluster Analysis. John Wiley & Sons.
    [8]
    Matheus C.J.; Chan P.K.; and Piatetsky-Shapiro G. 1993. Systems for Knowledge Discovery in Databases, IEEE Transactions on Knowledge and Data Engineering 5(6):903-913.
    [9]
    Ng R.T., and Han J. 1994. Efficient and Effective Clustering Methods for Spatial Data Mining, Proc. 20th Int. Conf. on Very Large Data Bases, 144-155. Santiago, Chile.
    [10]
    Stonebraker M., Frew J., Gardels K., and Meredith J. 1993. The SEQUOIA 2000 Storage Benchmark, Proc. ACM SIGMOD Int. Conf. on Management of Data, Washington, DC, 1993, pp. 2-11.

    Cited By

    View all
    • (2024)Outlier Summarization via Human Interpretable RulesProceedings of the VLDB Endowment10.14778/3654621.365462717:7(1591-1604)Online publication date: 1-Mar-2024
    • (2024)Survey of Machine Learning for Software-assisted Hardware Design Verification: Past, Present, and ProspectACM Transactions on Design Automation of Electronic Systems10.1145/366130829:4(1-42)Online publication date: 24-Apr-2024
    • (2024)A Systematic Literature Review of Novelty Detection in Data Streams: Challenges and OpportunitiesACM Computing Surveys10.1145/365728656:10(1-37)Online publication date: 12-Apr-2024
    • Show More Cited By

    Index Terms

    1. A density-based algorithm for discovering clusters in large spatial databases with noise
            Index terms have been assigned to the content through auto-classification.

            Recommendations

            Comments

            Information & Contributors

            Information

            Published In

            cover image Guide Proceedings
            KDD'96: Proceedings of the Second International Conference on Knowledge Discovery and Data Mining
            August 1996
            387 pages

            Sponsors

            • AAAI: American Association for Artificial Intelligence

            Publisher

            AAAI Press

            Publication History

            Published: 02 August 1996

            Author Tags

            1. arbitrary shape of clusters
            2. clustering algorithms
            3. efficiency on large spatial databases
            4. handling nlj4-275oise

            Qualifiers

            • Article

            Contributors

            Other Metrics

            Bibliometrics & Citations

            Bibliometrics

            Article Metrics

            • Downloads (Last 12 months)0
            • Downloads (Last 6 weeks)0

            Other Metrics

            Citations

            Cited By

            View all
            • (2024)Outlier Summarization via Human Interpretable RulesProceedings of the VLDB Endowment10.14778/3654621.365462717:7(1591-1604)Online publication date: 1-Mar-2024
            • (2024)Survey of Machine Learning for Software-assisted Hardware Design Verification: Past, Present, and ProspectACM Transactions on Design Automation of Electronic Systems10.1145/366130829:4(1-42)Online publication date: 24-Apr-2024
            • (2024)A Systematic Literature Review of Novelty Detection in Data Streams: Challenges and OpportunitiesACM Computing Surveys10.1145/365728656:10(1-37)Online publication date: 12-Apr-2024
            • (2024)Language-Model Based Informed Partition of Databases to Speed Up Pattern MiningProceedings of the ACM on Management of Data10.1145/36549872:3(1-27)Online publication date: 30-May-2024
            • (2024)Social Network Analysis: A Survey on Process, Tools, and ApplicationACM Computing Surveys10.1145/364847056:8(1-39)Online publication date: 10-Apr-2024
            • (2024)NeRFHub: A Context-Aware NeRF Serving Framework for Mobile Immersive ApplicationsProceedings of the 22nd Annual International Conference on Mobile Systems, Applications and Services10.1145/3643832.3661879(85-98)Online publication date: 3-Jun-2024
            • (2024)Exploring Part Features for Unsupervised Visible-Infrared Person Re-IdentificationProceedings of the 1st ICMR Workshop on Multimedia Object Re-Identification10.1145/3643490.3661809(1-5)Online publication date: 10-Jun-2024
            • (2024)FLIGANProceedings of the 7th International Workshop on Edge Systems, Analytics and Networking10.1145/3642968.3654813(1-6)Online publication date: 22-Apr-2024
            • (2024)Affinity Diagramming with a RobotACM Transactions on Human-Robot Interaction10.1145/364151413:1(1-41)Online publication date: 31-Jan-2024
            • (2024)Efficient Algorithm for K-Multiple-MeansProceedings of the ACM on Management of Data10.1145/36392732:1(1-26)Online publication date: 26-Mar-2024
            • Show More Cited By

            View Options

            View options

            Media

            Figures

            Other

            Tables

            Share

            Share

            Share this Publication link

            Share on social media