DENCLUE 2.0: Fast Clustering Based on Kernel Density Estimation

The Denclue algorithm employs a cluster model based on kernel density estimation. A cluster is defined by a local maximum of the estimated density function. Data points are assigned to clusters by hill climbing, i.e. points going to the same local maximum are put into

• Type: Conference
• Year: 2007
• Where: IDA
• Authors: Alexander Hinneburg, Hans-Henning Gabriel
• Keywords: Cluster Model, IDA 2007, Kernel Density Estimation, Local Maximum