Name
Abstract | ||
|---|---|---|
Many validity index algorithms have been proposed to determine the number of clusters. These methods usually employ the Euclidean distance as the measurement. However, it is difficult for the Euclidean distance metric to evaluate the compactness of data when non-linear relationship exists between different components of data. Moreover, most current algorithms can not estimate well the scope of the number of clusters. To address these problems, in this paper, we adopt the kernel-induced distance to measure the relationship among data points. We first estimate the upper bound of the number of clusters to effectively reduce iteration time of validity index algorithm. Then, to determine the number of clusters, we design a kernelized validity index algorithm to automatically determine the optimal number of clusters. Experiments show that the proposed approach can obtain promising results. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1007/978-3-642-13498-2_47 | ICSI |
Keywords | Field | DocType |
FISHER DISCRIMINANT-ANALYSIS,ALGORITHMS,SELECTION,NUMBER | Data point,Cluster (physics),Mathematical optimization,Upper and lower bounds,Computer science,Euclidean distance,Compact space,Cluster analysis,Eigenvalues and eigenvectors | Conference |
Volume | ISSN | ISBN |
6146 | 0302-9743 | 3-642-13497-1 |
Citations | PageRank | References |
0 | 0.34 | 13 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Zizhu Fan | 1 | 329 | 14.61 |
| Xiangang Jiang | 2 | 0 | 1.35 |
| Baogen Xu | 3 | 122 | 19.54 |
| Zhaofeng Jiang | 4 | 0 | 0.34 |