EvoS&R: Evolving Multiple Seeds and Radii For Varying Density Data Clustering

  • Chen, Jun-Xian; 
  • Gong, Yue-Jiao; 
  • Chen, Wei-Neng; 
  • Zhang, Jun
Citations

WEB OF SCIENCE

2
Citations

SCOPUS

3

초록

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

키워드

Clustering algorithms; Clustering methods; Density clustering; differential evolution; Encoding; hybrid encoding; Optimization; parameter tuning; Shape; Task analysis; Tuning; varying density
제목
EvoS&R: Evolving Multiple Seeds and Radii For Varying Density Data Clustering
저자
Chen, Jun-Xian; Gong, Yue-Jiao; Chen, Wei-Neng; Zhang, Jun
DOI
10.1109/TKDE.2023.3312760
발행일
2024-05
유형
Article
저널명
IEEE Transactions on Knowledge and Data Engineering
권
36
호
5
페이지
1 ~ 14