Abstract
Similarity is the core problem of clustering. Clustering algorithms that are based on a certain, fixed type of similarity are not sufficient to explore complicated structures. In this paper, a constructing method for multiple similarity is proposed to deal with complicated structures of data sets. Multiple similarity derives from the local modification of the initial similarity, based on the feedback information of elementary clusters. Combined with the proposed algorithm, the repeated modifications of local similarity measurement generate a hierarchical clustering result. Some synthetic and real data sets are employed to exhibit the superiority of the new clustering algorithm.
| Original language | English |
|---|---|
| Pages (from-to) | 155-162 |
| Number of pages | 8 |
| Journal | Pattern Recognition Letters |
| Volume | 34 |
| Issue number | 2 |
| DOIs | |
| State | Published - 15 Jan 2013 |
Keywords
- Agglomerative clustering
- Blurring
- Data mining
- Heuristic
- Structural nearest neighbor
- Top-down