Skip to main content
SpringerLink
Log in

Density-Based Clustering

  • Living reference work entry
  • First Online:
Encyclopedia of Machine Learning and Data Mining

Abstract

The chapter gives a concise explanation of the basic principles of density-based clustering and points out important ”milestone papers” in this area.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Recommended Reading

  • Ankerst M, Breunig MM, Kriegel H-P, Sander J (1999) OPTICS: ordering points to identify the clustering structure. In: Delis A, Faloutsos C, Ghandeharizadeh S (eds) Proceedings of the 1999 ACM SIGMOD international conference on management of data, Philadelphia

    Google Scholar 

  • Campello RJGB, Moulavi D, Sander J (2013) Density-based clustering based on hierarchical density estimates. In: Proceedings of the 17th Pacific-Asia conference on knowledge discovery in databases, PAKDD 2013. Lecture notes in computer science, vol 7819, p 160

    Google Scholar 

  • Ester M, Kriegel H-P, Sander J, Xu X (1996) A density-based algorithm for discovering clusters in large spatial databases with noise. In: Simoudis E, Han J, Fayyad UM (eds) Proceedings of the 2nd international conference on knowledge discovery and data mining, Portland

    Google Scholar 

  • Hartigan JA (1975) Clustering algorithms. Wiley, New York

    MATH  Google Scholar 

  • Hinneburg A, Keim DA (1998) An efficient approach to clustering in large multimedia databases with noise. In: Agrawal R, Stolorz P (eds) Proceedings of the 4th international conference on knowledge discovery and data mining, New York City

    Google Scholar 

  • Sander J, Ester M, Kriegel H-P, Xu X (1998) Density-Based clustering in spatial databases: the algorithm GDBSCAN and its applications. Data Min Knowl Discov 2(2):169–194

    Article  Google Scholar 

  • Stuetzle W (2003) Estimating the cluster tree of a density by analyzing the minimal spanning tree of a sample. J Classif 20(1):025–047

    Article  MathSciNet  MATH  Google Scholar 

  • Wishart D (1969) Mode analysis: a generalization of nearest neighbor which reduces chaining effects. In: Numerical Taxonomy, ed. A. J. Cole, London: Academic Press, 282–311

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Alberta, Edmonton, AB, Canada

    Joerg Sander

Authors
  1. Joerg Sander
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Joerg Sander .

Editor information

Editors and Affiliations

  1. Engineering (CSE), University of New South Wales School of Computer Science &, Sydney, New South Wales, Australia

    Claude Sammut

  2. Software Engineering, Monash University School of Computer Science &, Melbourne, Victoria, Australia

    Geoffrey I. Webb

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer Science+Business Media New York

About this entry

Cite this entry

Sander, J. (2016). Density-Based Clustering. In: Sammut, C., Webb, G. (eds) Encyclopedia of Machine Learning and Data Mining. Springer, Boston, MA. https://doi.org/10.1007/978-1-4899-7502-7_70-1

Download citation

  • DOI: https://doi.org/10.1007/978-1-4899-7502-7_70-1

  • Received:

  • Accepted:

  • Published:

  • Publisher Name: Springer, Boston, MA

  • Online ISBN: 978-1-4899-7502-7

  • eBook Packages: Springer Reference Computer SciencesReference Module Computer Science and Engineering

Publish with us

Policies and ethics

Search

Navigation