Name
Abstract | ||
|---|---|---|
Density-based clustering has the advantages for (i) allowing arbitrary shape of cluster and (ii) not requiring the number of clusters as input. However, when clusters touch each other, both the cluster centers and cluster boundaries (as the peaks and valleys of the density distribution) become fuzzy and difficult to determine. We introduce the notion of cluster intensity function (CIF) which captures the important characteristics of clusters. When clusters are well-separated, CIFs are similar to density functions. But when clusters become closed to each other, CIFs still clearly reveal cluster centers, cluster boundaries, and degree of membership of each data point to the cluster that it belongs. Clustering through bump hunting and valley seeking based on these functions are more robust than that based on density functions obtained by kernel density estimation, which are often oscillatory or over-smoothed. These problems of kernel density estimation are resolved using Level Set Methods and related techniques. Comparisons with two existing density- based methods, valley seeking and DBSCAN, are presented which illustrate the advantages of our approach. |
Year | DOI | Venue |
|---|---|---|
2006 | 10.1109/TPAMI.2006.117 | IEEE Transactions on Pattern Analysis and Machine Intelligence |
Keywords | Field | DocType |
partial differential equation,kernel density estimate,level set method,indexing terms | Density estimation,Cluster (physics),Data mining,Complete-linkage clustering,Computer science,Algorithm,Geometry,Cluster analysis,Probability density function,DBSCAN,Kernel (statistics),Kernel density estimation | Journal |
Volume | Issue | ISSN |
28 | 6 | 0162-8828 |
ISBN | Citations | PageRank |
3-540-26076-5 | 16 | 0.87 |
References | Authors | |
25 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Andy M. Yip | 1 | 232 | 20.65 |
| Chris Ding | 2 | 9308 | 501.21 |
| Tony F. Chan | 3 | 8733 | 659.77 |