# Density‐based clustering

@article{Kriegel2011DensitybasedC, title={Density‐based clustering}, author={Hans-Peter Kriegel and Peer Kr{\"o}ger and J{\"o}rg Sander and Arthur Zimek}, journal={Wiley Interdisciplinary Reviews: Data Mining and Knowledge Discovery}, year={2011}, volume={1} }

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. © 2011 John Wiley & Sons, Inc. WIREs Data Mining Knowl Discov 2011 1 231–240 DOI: 10… Expand

#### Topics from this paper

#### 263 Citations

Efficient Density-Based Subspace Clustering in High Dimensions

- Mathematics, Computer Science
- CHDD
- 2012

This short survey discusses challenges in this area, and presents models and algorithms for efficient and scalable density-based subspace clustering. Expand

Density‐based clustering

- Computer Science
- Wiley Interdiscip. Rev. Data Min. Knowl. Discov.
- 2020

This review article discusses the statistical notion of density‐based clusters, classic algorithms for deriving a flat partitioning ofdensity‐ based clusters, methods for hierarchical density‐ based clustering, and methods for semi‐supervised clustering. Expand

Density-Based Clustering Based on Hierarchical Density Estimates

- Mathematics, Computer Science
- PAKDD
- 2013

This work proposes a theoretically and practically improved density-based, hierarchical clustering method, providing a clustering hierarchy from which a simplified tree of significant clusters can be constructed, and proposes a novel cluster stability measure. Expand

Determination of the appropriate parameters for K-means clustering using selection of region clusters based on density DBSCAN (SRCD-DBSCAN)

- Computer Science
- Expert Syst. J. Knowl. Eng.
- 2017

The results of the selection of region clusters based on density DBSCAN method are more accurate than those obtained by traditional methods, including DBS CAN and K-means and related methods such as Partitioning-based DBScan (PDBSCAN) and PDBSCAN by applying the Ant Clustering Algorithm DBSCan (PACA-DBSCAN). Expand

Cluster Analysis of Data with Reduced Dimensionality: An Empirical Study

- Computer Science
- 2016

Several clustering algorithms are used to process low-dimensional projections of complex data sets and compared with each other to assess their suitability to process reduced data sets. Expand

Variable Density Based Genetic Clustering

- Mathematics, Computer Science
- 2012 14th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing
- 2012

A parameter-free novel genetic clustering algorithm with an original method for encoding clustering solutions relying on density based clustering parameters, which allows for always valid crossover results, with great offspring variations even when using simple crossover operators. Expand

KR-DBSCAN: A density-based clustering algorithm based on reverse nearest neighbor and influence space

- Computer Science
- 2021

A density-based clustering algorithm, KR-DBSCAN, which is based on the reverse nearest neighbor and influence space, and when the core objects are within their influence spaces, they are added to the cluster by breadth-first traversal, and the computational load is substantially reduced. Expand

Permutation-test-based clustering method for detection of dynamic patterns in Spatio-temporal datasets

- Computer Science
- Comput. Environ. Urban Syst.
- 2019

A novel density-based spatio-temporal clustering method based on permutation tests that can not only identify inherent cluster patterns in spatio/temporal datasets, but also greatly alleviates the difficulty in selecting appropriate clustering parameters. Expand

Neighborhood density information in clustering

- Computer Science
- 2021

The novelty of the proposed DBC method can be summed up as follows: a hybrid first-second order optimization algorithm for identifying high-density data points; an adaptive scan radius for identifying reachable points. Expand

A Review on Consensus Clustering Methods

- Computer Science
- 2014

This chapter provides a review of unsupervised consensus learning techniques based on their underlying theoretical principles, present the exact, approximation, and heuristic approaches, the relation of consensus clustering with other well-studied problems, and discuss relevant applications. Expand

#### References

SHOWING 1-10 OF 59 REFERENCES

Density-Connected Subspace Clustering for High-Dimensional Data

- Mathematics, Computer Science
- SDM
- 2004

SUBCLU (density-connected Subspace Clustering), an effective and efficient approach to the subspace clustering problem, based on a formal clustering notion using the concept of density-connectivity underlying the algorithm DBSCAN [EKSX96]. Expand

Clustering high dimensional data

- Computer Science
- Wiley Interdiscip. Rev. Data Min. Knowl. Discov.
- 2012

An overview of the effects of high‐dimensional spaces, and their implications for different clustering paradigms is provided, with pointers to the literature, and open research issues remain. Expand

Direct Clustering of a Data Matrix

- Mathematics
- 1972

Abstract Clustering algorithms are now in widespread use for sorting heterogeneous data into homogeneous blocks. If the data consist of a number of variables taking values over a number of cases,… Expand

Finding Clusters of Different Sizes, Shapes, and Densities in Noisy, High Dimensional Data

- Mathematics, Computer Science
- SDM
- 2003

A novel clustering technique that addresses problems with varying densities and high dimensionality, while the use of core points handles problems with shape and size, and a number of optimizations that allow the algorithm to handle large data sets are discussed. Expand

Clustering of the self-organizing map using a clustering validity index based on inter-cluster and intra-cluster density

- Mathematics, Computer Science
- Pattern Recognit.
- 2004

Through some preprocessing techniques for filtering out noises and outliers, a new two-level SOM-based clustering algorithm using a clustering validity index based on inter-clusters and intra-cluster density is proposed. Expand

Density-Based Clustering in Spatial Databases: The Algorithm GDBSCAN and Its Applications

- Mathematics, Computer Science
- Data Mining and Knowledge Discovery
- 2004

The generalized algorithm DBSCAN can cluster point objects as well as spatially extended objects according to both, their spatial and their nonspatial attributes, and four applications using 2D points (astronomy, 3D points,biology, 5D points and 2D polygons) are presented, demonstrating the applicability of GDBSCAN to real-world problems. Expand

A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise

- Computer Science
- KDD
- 1996

DBSCAN, a new clustering algorithm relying on a density-based notion of clusters which is designed to discover clusters of arbitrary shape, is presented which requires only one input parameter and supports the user in determining an appropriate value for it. Expand

Subspace clustering

- Computer Science
- Wiley Interdiscip. Rev. Data Min. Knowl. Discov.
- 2012

The problems motivating subspace clustering are sketched, different definitions and usages of subspaces for clusteringare described, and exemplary algorithmic solutions are discussed. Expand

Semi-supervised Density-Based Clustering

- Computer Science
- 2009 Ninth IEEE International Conference on Data Mining
- 2009

This work describes how labeled objects can be used to help the algorithm detecting suitable density parameters for the algorithm to extract density-based clusters in specific parts of the feature space. Expand

EDSC: efficient density-based subspace clustering

- Computer Science
- CIKM '08
- 2008

This paper proposes lossless efficient detection of density-based subspace clusters by a complete multistep filter-and-refine algorithm and proves that pruning is lossless in both filter steps, guaranteeing completeness of the result. Expand