Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

14

IDA
2007
Springer

favoriteEmaildiscussreport

991views Information Technology» more IDA 2007»

DENCLUE 2.0: Fast Clustering Based on Kernel Density Estimation

13 years 10 months ago

DENCLUE 2.0: Fast Clustering Based on Kernel Density Estimation

Download users.informatik.uni-halle.de

The Denclue algorithm employs a cluster model based on kernel density estimation. A cluster is deﬁned 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

Alexander Hinneburg, Hans-Henning Gabriel

Real-time Traffic

Cluster Model | IDA 2007 | Kernel Density Estimation | Local Maximum |

claim paper

Related Content

» Applying Neighborhood Consistency for Fast Clustering and Kernel Density Estimation

» Fast Estimation of Nonparametric Kernel Density Through PDDP and its Application in Textur...

» Accelerating MachineLearning Algorithms on FPGAs using PatternBased Decomposition

Post Info
More Details (n/a)

Added	08 Jun 2010
Updated	08 Jun 2010
Type	Conference
Year	2007
Where	IDA
Authors	Alexander Hinneburg, Hans-Henning Gabriel

Comments (0)