Neighborhood density information in clustering

Mujahid N. Syed*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

Abstract

Density Based Clustering (DBC) methods are capable of identifying arbitrary shaped data clusters in the presence of noise. DBC methods are based on the notion of local neighborhood density estimation. A major drawback of DBC methods is their poor performance in high-dimensions. In this work, a novel DBC method that performs well in high-dimensions is presented. The novelty of the proposed method can be summed up as follows: a hybrid first-second order optimization algorithm for identifying high-density data points; an adaptive scan radius for identifying reachable points. Theoretical results on the validity of the proposed method are presented in this work. The effectiveness and efficiency of the proposed approach are illustrated via rigorous experimental evaluations. The proposed method is compared with the well known DBC methods on synthetic and real data from the literature. Both internal and external cluster validation measures are used to evaluate the performance of the proposed method.

Original languageEnglish
Pages (from-to)855-872
Number of pages18
JournalAnnals of Mathematics and Artificial Intelligence
Volume90
Issue number7-9
DOIs
StatePublished - Sep 2022

Bibliographical note

Publisher Copyright:
© 2021, The Author(s), under exclusive licence to Springer Nature Switzerland AG.

Keywords

  • Data clustering
  • Density estimation
  • Nonlinear optimization

ASJC Scopus subject areas

  • Artificial Intelligence
  • Applied Mathematics

Fingerprint

Dive into the research topics of 'Neighborhood density information in clustering'. Together they form a unique fingerprint.

Cite this