Efficient structural graph clustering: an index-based approach

Graph clustering is a fundamental problem widely applied in many applications. The structural graph clustering ( SCAN ) method obtains not only clusters but also hubs and outliers. However, the clustering results heavily depend on two parameters, ϵ and μ , while the optimal parameter setting depends...

Full description

Saved in:

Bibliographic Details
Published in:	The VLDB journal Vol. 28; no. 3; pp. 377 - 399
Main Authors:	Wen, Dong, Qin, Lu, Zhang, Ying, Chang, Lijun, Lin, Xuemin
Format:	Journal Article
Language:	English
Published:	Berlin/Heidelberg Springer Berlin Heidelberg 01.06.2019 Springer Nature B.V
Subjects:	Algorithms Apexes Clustering Computer Science Database Management Graph theory Optimization Optimization techniques Parameters Query processing Regular Paper User requirements Graph clustering Dynamic graphs SCAN I/O Efficient algorithms
ISSN:	1066-8888, 0949-877X
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!