EvoS&R: Evolving Multiple Seeds and Radii For Varying Density Data Clustering
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Chen, Jun-Xian | - |
dc.contributor.author | Gong, Yue-Jiao | - |
dc.contributor.author | Chen, Wei-Neng | - |
dc.contributor.author | Zhang, Jun | - |
dc.date.accessioned | 2023-11-24T02:36:00Z | - |
dc.date.available | 2023-11-24T02:36:00Z | - |
dc.date.issued | 2024-05 | - |
dc.identifier.issn | 1041-4347 | - |
dc.identifier.issn | 1558-2191 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/erica/handle/2021.sw.erica/115722 | - |
dc.description.abstract | Density clustering has shown advantages over other types of clustering methods for processing arbitrarily shaped datasets. In recent years, extensive research efforts has been made on the improvements of DBSCAN or the algorithms incorporating the concept of density peaks. However, these previous studies remain the problems of being sensitive to the parameter settings, and some of them will stuck in weak results when encountering the situations of varying-density distributions. To overcome these issues, we propose an evolution framework named EvoS&R that evolves multiple seeds and the corresponding radii for varying-density data clustering. Compared with the traditional methods, EvoS&R handles the parameter tuning and multi-density fitting problems in an integrated and straightforward manner. Note that, however, the underlying task in EvoS&R is a mixed-variable optimization problem that is challenging in nature. We specifically design a hybrid encoding differential evolution algorithm with novel encoding, mutation, etc., to solve the optimization problem efficiently. Extensive experiments on density-based datasets shows that our algorithm outperforms the other state-of-the-arts in most cases, which validates the effectiveness of the proposed method. IEEE | - |
dc.format.extent | 14 | - |
dc.language | 영어 | - |
dc.language.iso | ENG | - |
dc.publisher | IEEE Computer Society | - |
dc.title | EvoS&R: Evolving Multiple Seeds and Radii For Varying Density Data Clustering | - |
dc.type | Article | - |
dc.publisher.location | 미국 | - |
dc.identifier.doi | 10.1109/TKDE.2023.3312760 | - |
dc.identifier.scopusid | 2-s2.0-85171570697 | - |
dc.identifier.wosid | 001196644600008 | - |
dc.identifier.bibliographicCitation | IEEE Transactions on Knowledge and Data Engineering, v.36, no.5, pp 1 - 14 | - |
dc.citation.title | IEEE Transactions on Knowledge and Data Engineering | - |
dc.citation.volume | 36 | - |
dc.citation.number | 5 | - |
dc.citation.startPage | 1 | - |
dc.citation.endPage | 14 | - |
dc.type.docType | Article | - |
dc.description.isOpenAccess | N | - |
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 | Computer Science, Information Systems | - |
dc.relation.journalWebOfScienceCategory | Engineering, Electrical & Electronic | - |
dc.subject.keywordAuthor | Clustering algorithms | - |
dc.subject.keywordAuthor | Clustering methods | - |
dc.subject.keywordAuthor | Density clustering | - |
dc.subject.keywordAuthor | differential evolution | - |
dc.subject.keywordAuthor | Encoding | - |
dc.subject.keywordAuthor | hybrid encoding | - |
dc.subject.keywordAuthor | Optimization | - |
dc.subject.keywordAuthor | parameter tuning | - |
dc.subject.keywordAuthor | Shape | - |
dc.subject.keywordAuthor | Task analysis | - |
dc.subject.keywordAuthor | Tuning | - |
dc.subject.keywordAuthor | varying density | - |
dc.identifier.url | https://ieeexplore.ieee.org/document/10244047 | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
55 Hanyangdeahak-ro, Sangnok-gu, Ansan, Gyeonggi-do, 15588, Korea+82-31-400-4269 sweetbrain@hanyang.ac.kr
COPYRIGHT © 2021 HANYANG 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.