Density-based geodesic distance for identifying the noisy and nonlinear clusters

Citations

WEB OF SCIENCE

12
Citations

SCOPUS

14

초록

Clustering analysis can facilitate the extraction of implicit patterns in a dataset and elicit its natural groupings without requiring prior classification information. For superior clustering analysis results, a number of distance measures have been proposed. Recently, geodesic distance has been widely applied to clustering algorithms for nonlinear groupings. However, geodesic distance is sensitive to noise and hence, geodesic distance-based clustering may fail to discover nonlinear clusters in the region of the noise. In this study, we propose a density-based geodesic distance that can identify clusters in nonlinear and noisy situations. Experiments on various simulation and benchmark datasets are conducted to examine the properties of the proposed geodesic distance and to compare its performance with that of existing distance measures. The experimental results confirm that a clustering algorithm with the proposed distance measure demonstrated superior performance compared to the competitors; this was especially true when the cluster structures in the data were inherently noisy and nonlinearly patterned. (C) 2016 Elsevier Inc. All rights reserved.

키워드

Geodesic distance; Mutual neighborhood-based density coefficient; Noisy data clustering; Nonlinearity; VALIDATION
제목
Density-based geodesic distance for identifying the noisy and nonlinear clusters
저자
Yu, Jaehong; Kim, Seoung Bum
DOI
10.1016/j.ins.2016.04.032
발행일
2016-09-10
유형
Article
저널명
Information Sciences
권
360
페이지
231 ~ 243