Outer-Points shaver: Robust graph-based clustering via node cutting

Younghoon Kim, Hyungrok Do, Seoung Bum Kim

    Research output: Contribution to journalArticlepeer-review

    18 Citations (Scopus)

    Abstract

    Graph-based clustering is an efficient method for identifying clusters in local and nonlinear data patterns. Among the existing methods, spectral clustering is one of the most prominent algorithms. However, this method is vulnerable to noise and outliers. This study proposes a robust graph-based clustering method that removes the data nodes of relatively low density. The proposed method calculates the pseudo-density from a similarity matrix, and reconstructs it using a sparse regularization model. In this process, noise and the outer points are determined and removed. Unlike previous edge cutting-based methods, the proposed method is robust to noise while detecting clusters because it cuts out irrelevant nodes. We use a simulation and real-world data to demonstrate the usefulness of the proposed method by comparing it to existing methods in terms of clustering accuracy and robustness to noisy data. The comparison results confirm that the proposed method outperforms the alternatives.

    Original languageEnglish
    Article number107001
    JournalPattern Recognition
    Volume97
    DOIs
    Publication statusPublished - 2020 Jan

    Bibliographical note

    Publisher Copyright:
    © 2019

    Keywords

    • Graph-based clustering
    • Node cutting
    • Pseudo-density reconstruction
    • Spectral clustering
    • Unsupervised learning

    ASJC Scopus subject areas

    • Software
    • Signal Processing
    • Computer Vision and Pattern Recognition
    • Artificial Intelligence

    Fingerprint

    Dive into the research topics of 'Outer-Points shaver: Robust graph-based clustering via node cutting'. Together they form a unique fingerprint.

    Cite this