most citedKCoreMotif: An Efficient Graph Clustering Algorithm for Large Networks by Exploiting k-core Decomposition and Motifs

11 citations · 11 across the 1 of their papers we have counts for

collaborators

1 paper

cs.SI2020★ 11 cited

KCoreMotif: An Efficient Graph Clustering Algorithm for Large Networks by Exploiting k-core Decomposition and Motifs

Gang Mei, Jingzhi Tu, Lei Xiao +1

Clustering analysis has been widely used in trust evaluation on various complex networks such as wireless sensors networks and online social networks. Spectral clustering is one of…