Enhancing minimum spanning tree-based clustering by removing density-based outliers |
| |
Authors: | Xiaochun Wang Xia Li Wang Cong Chen D. Mitchell Wilkes |
| |
Affiliation: | 1. Xian Jiaotong University, People?s Republic of China;2. Changan University, People?s Republic of China;3. Vanderbilt University, USA |
| |
Abstract: | Traditional minimum spanning tree-based clustering algorithms only make use of information about edges contained in the tree to partition a data set. As a result, with limited information about the structure underlying a data set, these algorithms are vulnerable to outliers. To address this issue, this paper presents a simple while efficient MST-inspired clustering algorithm. It works by finding a local density factor for each data point during the construction of an MST and discarding outliers, i.e., those whose local density factor is larger than a threshold, to increase the separation between clusters. This algorithm is easy to implement, requiring an implementation of iDistance as the only k-nearest neighbor search structure. Experiments performed on both small low-dimensional data sets and large high-dimensional data sets demonstrate the efficacy of our method. |
| |
Keywords: | Clustering Minimum spanning tree-based clustering algorithms Density-based clustering algorithms Indexing structures Density-based outliers |
本文献已被 ScienceDirect 等数据库收录! |
|