Density‐based clustering
Hans‐Peter Kriegel, Peer Kröger, Jörg Sander et al. · Wiley Interdisciplinary Reviews Data Mining and Knowledge Discovery · 2011
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. © 2011 John Wiley & Sons, Inc. WIREs Data Mining Knowl Discov 2011 1 231–240 DOI: 10.1002/widm.30 This article is categorized under: Technologies > Structure Discovery and Clustering
Cited by 837 works. doi:10.1002/widm.30
Authors
References
- Maximum Likelihood from Incomplete Data Via the EM Algorithm
- THE USE OF MULTIPLE MEASUREMENTS IN TAXONOMIC PROBLEMS
- Scikit-learn: Machine Learning in Python
- Construction of Phylogenetic Trees
- Some methods for classification and analysis of multivariate observations
- On Estimation of a Probability Density Function and Mode
- A density-based algorithm for discovering clusters in large spatial Databases with Noise
- The WEKA data mining software
- Remarks on Some Nonparametric Estimates of a Density Function
- Clustering Algorithms.