Clustering by Local Gravitation
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Wang, Zhiqiang | - |
dc.contributor.author | Yu, Zhiwen | - |
dc.contributor.author | Philip Chen C.L. | - |
dc.contributor.author | You, Jane | - |
dc.contributor.author | Gu, Tianlong | - |
dc.contributor.author | Wong, Hau-San | - |
dc.contributor.author | ZHANG, Jun | - |
dc.date.accessioned | 2023-11-24T02:39:06Z | - |
dc.date.available | 2023-11-24T02:39:06Z | - |
dc.date.issued | 2018-05 | - |
dc.identifier.issn | 2168-2267 | - |
dc.identifier.issn | 2168-2275 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/erica/handle/2021.sw.erica/115774 | - |
dc.description.abstract | The objective of cluster analysis is to partition a set of data points into several groups based on a suitable distance measure. We first propose a model called local gravitation among data points. In this model, each data point is viewed as an object with mass, and associated with a local resultant force (LRF) generated by its neighbors. The motivation of this paper is that there exist distinct differences between the LRFs (including magnitudes and directions) of the data points close to the cluster centers and at the boundary of the clusters. To capture these differences efficiently, two new local measures named centrality and coordination are further investigated. Based on empirical observations, two new clustering methods called local gravitation clustering and communication with local agents are designed, and several test cases are conducted to verify their effectiveness. The experiments on synthetic data sets and real-world data sets indicate that both clustering approaches achieve good performance on most of the data sets. © 2013 IEEE. | - |
dc.format.extent | 14 | - |
dc.language | 영어 | - |
dc.language.iso | ENG | - |
dc.publisher | IEEE Advancing Technology for Humanity | - |
dc.title | Clustering by Local Gravitation | - |
dc.type | Article | - |
dc.publisher.location | 미국 | - |
dc.identifier.doi | 10.1109/TCYB.2017.2695218 | - |
dc.identifier.scopusid | 2-s2.0-85019031101 | - |
dc.identifier.wosid | 000429247700004 | - |
dc.identifier.bibliographicCitation | IEEE Transactions on Cybernetics, v.48, no.5, pp 1383 - 1396 | - |
dc.citation.title | IEEE Transactions on Cybernetics | - |
dc.citation.volume | 48 | - |
dc.citation.number | 5 | - |
dc.citation.startPage | 1383 | - |
dc.citation.endPage | 1396 | - |
dc.type.docType | 정기학술지(Article(Perspective Article포함)) | - |
dc.description.isOpenAccess | N | - |
dc.description.journalRegisteredClass | sci | - |
dc.description.journalRegisteredClass | scie | - |
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.relation.journalWebOfScienceCategory | Computer Science, Cybernetics | - |
dc.subject.keywordPlus | DENSITY | - |
dc.subject.keywordPlus | ALGORITHM | - |
dc.subject.keywordPlus | FRAMEWORK | - |
dc.subject.keywordPlus | SEARCH | - |
dc.subject.keywordPlus | FIND | - |
dc.subject.keywordAuthor | Cluster algorithms | - |
dc.subject.keywordAuthor | cluster analysis | - |
dc.subject.keywordAuthor | clustering | - |
dc.subject.keywordAuthor | density-based clustering | - |
dc.identifier.url | https://ieeexplore.ieee.org/document/7915751 | - |
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.