期刊
PATTERN RECOGNITION
卷 97, 期 -, 页码 -出版社
ELSEVIER SCI LTD
DOI: 10.1016/j.patcog.2019.107001
关键词
Graph-based clustering; Unsupervised learning; Spectral clustering; Pseudo-density reconstruction; Node cutting
资金
- Brain Korea PLUS
- Basic Science Research Program through the National Research Foundation of Korea - Ministry of Science, ICT and Future Planning [NRF-2016R1A2B1008994]
- Ministry of Trade, Industry & Energy under the Industrial Technology Innovation Program [R1623371]
- Institute for Information & communications Technology Promotion - Korea government [2018-0-00440]
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. (C) 2019 Elsevier Ltd. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据