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...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	IEEE transactions on computational social systems Ročník 11; číslo 4; s. 5468 - 5482
Hlavní autoři:	Jia, Hongjie, Wu, Yuhao, Mao, Qirong, Li, Yang, Song, Heping
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Piscataway IEEE 01.08.2024 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!