Adaptive Density Subgraph Clustering

Density peak clustering (DPC) has garnered growing interest over recent decades due to its capability to identify clusters with diverse shapes and its resilience to the presence of noisy data. Most DPC-based methods exhibit high computational complexity. One approach to mitigate this issue involves...

Full description

Saved in:

Bibliographic Details
Published in:	IEEE transactions on computational social systems Vol. 11; no. 4; pp. 5468 - 5482
Main Authors:	Jia, Hongjie, Wu, Yuhao, Mao, Qirong, Li, Yang, Song, Heping
Format:	Journal Article
Language:	English
Published:	Piscataway IEEE 01.08.2024 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:	Adaptive algorithms Adaptive clustering Algorithm design and theory Cluster analysis cluster self-ensemble Clustering Clustering algorithms Data analysis Datasets Density density clustering Density measurement density subgraph Estimation Graph theory Merging Outliers (statistics) Sensitivity Shape measurement Task analysis Time complexity
ISSN:	2329-924X, 2373-7476
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!