Density‐based clustering

R. Campello,Peer Kröger,Jörg Sander,Arthur Zimek

Published 2019 in WIREs Data Mining Knowl. Discov.

ABSTRACT

Clustering refers to the task of identifying groups or clusters in a data set. In density‐based clustering, a cluster is a set of data objects spread in the data space over a contiguous region of high density of objects. Density‐based clusters are separated from each other by contiguous regions of low density of objects. Data objects located in low‐density regions are typically considered noise or outliers. In this review article we discuss the statistical notion of density‐based clusters, classic algorithms for deriving a flat partitioning of density‐based clusters, methods for hierarchical density‐based clustering, and methods for semi‐supervised clustering. We conclude with some open challenges related to density‐based clustering.

PUBLICATION RECORD

  • Publication year

    2019

  • Venue

    WIREs Data Mining Knowl. Discov.

  • Publication date

    2019-10-29

  • Fields of study

    Mathematics, Computer Science

  • Identifiers
  • External record

    Open on Semantic Scholar

  • Source metadata

    Semantic Scholar

CITATION MAP

EXTRACTION MAP

CLAIMS

  • No claims are published for this paper.

CONCEPTS

  • No concepts are published for this paper.

REFERENCES

Showing 1-92 of 92 references · Page 1 of 1

CITED BY

Showing 1-100 of 559 citing papers · Page 1 of 6