Outer-Points shaver: Robust graph-based clustering via node cutting
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Kim, Younghoon | - |
dc.contributor.author | Do, Hyungrok | - |
dc.contributor.author | Kim, Seoung Bum | - |
dc.date.accessioned | 2021-08-31T15:53:19Z | - |
dc.date.available | 2021-08-31T15:53:19Z | - |
dc.date.created | 2021-06-18 | - |
dc.date.issued | 2020-01 | - |
dc.identifier.issn | 0031-3203 | - |
dc.identifier.uri | https://scholar.korea.ac.kr/handle/2021.sw.korea/58892 | - |
dc.description.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. (C) 2019 Elsevier Ltd. All rights reserved. | - |
dc.language | English | - |
dc.language.iso | en | - |
dc.publisher | ELSEVIER SCI LTD | - |
dc.subject | SELECTION | - |
dc.title | Outer-Points shaver: Robust graph-based clustering via node cutting | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Kim, Seoung Bum | - |
dc.identifier.doi | 10.1016/j.patcog.2019.107001 | - |
dc.identifier.scopusid | 2-s2.0-85070685351 | - |
dc.identifier.wosid | 000491609400006 | - |
dc.identifier.bibliographicCitation | PATTERN RECOGNITION, v.97 | - |
dc.relation.isPartOf | PATTERN RECOGNITION | - |
dc.citation.title | PATTERN RECOGNITION | - |
dc.citation.volume | 97 | - |
dc.type.rims | ART | - |
dc.type.docType | Article | - |
dc.description.journalClass | 1 | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Computer Science | - |
dc.relation.journalResearchArea | Engineering | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Artificial Intelligence | - |
dc.relation.journalWebOfScienceCategory | Engineering, Electrical & Electronic | - |
dc.subject.keywordPlus | SELECTION | - |
dc.subject.keywordAuthor | Graph-based clustering | - |
dc.subject.keywordAuthor | Unsupervised learning | - |
dc.subject.keywordAuthor | Spectral clustering | - |
dc.subject.keywordAuthor | Pseudo-density reconstruction | - |
dc.subject.keywordAuthor | Node cutting | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
145 Anam-ro, Seongbuk-gu, Seoul, 02841, Korea+82-2-3290-2963
COPYRIGHT © 2021 Korea University. All Rights Reserved.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.