Automatic clustering approach based on particle swarm optimization for data with arbitrary shaped clusters
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Chen, Geng-Bin | - |
dc.contributor.author | Song, An | - |
dc.contributor.author | Zhang, Chun-Ju | - |
dc.contributor.author | Liu, Xiao-Fang | - |
dc.contributor.author | Chen, Wei-Neng | - |
dc.contributor.author | Zhan, Zhi-Hui | - |
dc.contributor.author | Zhong, Jing-Hui | - |
dc.contributor.author | Zhang, Jun | - |
dc.contributor.author | Hu, Xiao-Min | - |
dc.date.accessioned | 2023-12-12T12:30:59Z | - |
dc.date.available | 2023-12-12T12:30:59Z | - |
dc.date.issued | 2017-03 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/erica/handle/2021.sw.erica/116353 | - |
dc.description.abstract | Recently, partitional clustering approaches based on Evolutionary Algorithms (EAs) have shown promising in solving the data clustering problems. However, with the nearest prototype (NP) rule as the method for decoding, most of them are only suitable for clustering datasets with convex (e.g. hyperspherical) clusters. In this paper, we propose an automatic clustering approach using particle swarm optimization (PSO). A new encoding scheme with a novel decoding method, named the nearest multiple prototypes (NMP) rule, is applied to the PSO-based clustering algorithm to automatically determine an appropriate number of clusters in the procedure of clustering and partition datasets with arbitrary shaped clusters. The algorithm is experimentally validated on both synthetic and real datasets. The results show that the proposed PSO-based approach is very competitive when comparing with two popular clustering algorithms. © 2016 IEEE. | - |
dc.format.extent | 8 | - |
dc.language | 영어 | - |
dc.language.iso | ENG | - |
dc.publisher | Institute of Electrical and Electronics Engineers Inc. | - |
dc.title | Automatic clustering approach based on particle swarm optimization for data with arbitrary shaped clusters | - |
dc.type | Article | - |
dc.publisher.location | 미국 | - |
dc.identifier.doi | 10.1109/ICICIP.2016.7885913 | - |
dc.identifier.scopusid | 2-s2.0-85018173454 | - |
dc.identifier.wosid | 000406239700008 | - |
dc.identifier.bibliographicCitation | 2016 Seventh International Conference on Intelligent Control and Information Processing (ICICIP), pp 41 - 48 | - |
dc.citation.title | 2016 Seventh International Conference on Intelligent Control and Information Processing (ICICIP) | - |
dc.citation.startPage | 41 | - |
dc.citation.endPage | 48 | - |
dc.type.docType | Conference paper | - |
dc.description.isOpenAccess | N | - |
dc.description.journalRegisteredClass | sci | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Automation & Control Systems | - |
dc.relation.journalResearchArea | Computer Science | - |
dc.relation.journalWebOfScienceCategory | Automation & Control Systems | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Artificial Intelligence | - |
dc.subject.keywordAuthor | Evolutionary algorithm | - |
dc.subject.keywordAuthor | Multiple prototypes | - |
dc.subject.keywordAuthor | Particle swarm optimization (PSO) | - |
dc.subject.keywordAuthor | Partitional clustering | - |
dc.subject.keywordAuthor | Prototype-based encoding | - |
dc.identifier.url | https://ieeexplore.ieee.org/document/7885913 | - |
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.