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

Jaehong Yu, Seoung Bum Kim

Research output: Contribution to journalArticle

6 Citations (Scopus)

Abstract

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.

Original languageEnglish
Pages (from-to)231-243
Number of pages13
JournalInformation Sciences
Volume360
DOIs
Publication statusPublished - 2016 Sep 10

Keywords

  • Geodesic distance
  • Mutual neighborhood-based density coefficient
  • Noisy data clustering
  • Nonlinearity

ASJC Scopus subject areas

  • Artificial Intelligence
  • Software
  • Control and Systems Engineering
  • Theoretical Computer Science
  • Computer Science Applications
  • Information Systems and Management

Fingerprint Dive into the research topics of 'Density-based geodesic distance for identifying the noisy and nonlinear clusters'. Together they form a unique fingerprint.

  • Cite this