Abstract
This paper presents a novel hierarchical clustering method using support vector machines. A common approach for hierarchical clustering is to use distance for the task. However, different choices for computing inter-cluster distances often lead to fairly distinct clustering outcomes, causing interpretation difficulties in practice. In this paper, we propose to use a one-class support vector machine (OC-SVM) to directly find high-density regions of data. Our algorithm generates nested set estimates using the OC-SVM and exploits the hierarchical structure of the estimated sets. We demonstrate the proposed algorithm on synthetic datasets. The cluster hierarchy is visualized with dendrograms and spanning trees.
| Original language | English |
|---|---|
| Pages (from-to) | 1164-1175 |
| Number of pages | 12 |
| Journal | Symmetry |
| Volume | 7 |
| Issue number | 3 |
| DOIs | |
| State | Published - 2015 |
Keywords
- Dendrogram
- Gaussian kernel
- Hierarchical clustering
- One-class support vector machines
- Spanning tree