UM
Affiliated with RCfalse
Status已發表Published
QuickDSC: Clustering by Quick Density Subgraph Estimation
Zheng, Xichen1; Ren, Chengsen1; Yang, Yiyang1; Gong, Zhiguo2; Chen, Xiang3; Hao, Zhifeng4
2021-12-01
Source PublicationInformation Sciences
ISSN0020-0255
Volume581Pages:403-427
Abstract

Density-based clustering is a traditional research topic with the capability of determining clusters of arbitrary shapes. Besides, through the Density Estimator (DE), density-based methods such as MeanShift, and QuickShift can find the local density maximums as Modes that are excellent representatives of the clusters. However, concentrating on the modes only may suffer from the over-segmentation problem. On the other hand, most density-based methods cannot satisfy the scenario requiring partitioning the data samples into exactly K clusters. To overcome these issues, QuickDSC: a novel and efficient clustering algorithm that groups the samples through the Quick Density Subgraph Estimation, is proposed in this work. It firstly identifies the high-density-connected samples as the Density Subgraphs (DSs). And then, the importance of DSs is estimated from two aspects: density and geometric weight. The top-K important DSs are selected as the cluster centers and based on which the cluster memberships of remaining samples are determined. QuickDSC incorporates three crucial clustering attributes: (1) the cluster centroids are modes (as in density-based methods); (2) able to efficiently return results by utilizing the underlying density structure (as in hierarchical clustering methods); and (3) it explicitly returns K clusters (e.g., K-Means, K-Modes). In addition, QuickDSC is theoretically and empirically efficient. It is only slightly slower than classical clustering methods such as K-Means and DBSCAN. Experiments on artificial and real-world datasets demonstrate the advantages of the proposed method, and the clustering quality outperforms the state-of-the-art approaches.

KeywordClustering Density Estimation K-nn Graph K-way Partition
DOI10.1016/j.ins.2021.09.048
URLView the original
Indexed BySCIE
Language英語English
WOS Research AreaComputer Science
WOS SubjectComputer Science, Information Systems
WOS IDWOS:000705058500015
Scopus ID2-s2.0-85118736173
Fulltext Access
Citation statistics
Cited Times [WOS]:0   [WOS Record]     [Related Records in WOS]
Document TypeJournal article
CollectionUniversity of Macau
Corresponding AuthorYang, Yiyang
Affiliation1.Guangdong University of Technology, Faculty of Computer, China
2.University of Macau, State Key Laboratory of Internet of Things for Smart City and Department of Computer and Information Science, China
3.Sun Yat-Sen University, School of Electronics and Information Technology, China
4.Shantou University, College of Engineering, China
Recommended Citation
GB/T 7714
Zheng, Xichen,Ren, Chengsen,Yang, Yiyang,et al. QuickDSC: Clustering by Quick Density Subgraph Estimation[J]. Information Sciences,2021,581:403-427.
APA Zheng, Xichen,Ren, Chengsen,Yang, Yiyang,Gong, Zhiguo,Chen, Xiang,&Hao, Zhifeng.(2021).QuickDSC: Clustering by Quick Density Subgraph Estimation.Information Sciences,581,403-427.
MLA Zheng, Xichen,et al."QuickDSC: Clustering by Quick Density Subgraph Estimation".Information Sciences 581(2021):403-427.
Files in This Item:
There are no files associated with this item.
Related Services
Recommend this item
Bookmark
Usage statistics
Export to Endnote
Google Scholar
Similar articles in Google Scholar
[Zheng, Xichen]'s Articles
[Ren, Chengsen]'s Articles
[Yang, Yiyang]'s Articles
Baidu academic
Similar articles in Baidu academic
[Zheng, Xichen]'s Articles
[Ren, Chengsen]'s Articles
[Yang, Yiyang]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[Zheng, Xichen]'s Articles
[Ren, Chengsen]'s Articles
[Yang, Yiyang]'s Articles
Terms of Use
No data!
Social Bookmark/Share
All comments (0)
No comment.
 

Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.