Search Results for author: Jingzhi Tu

Found 3 papers, 0 papers with code

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

no code implementations21 Aug 2020 Gang Mei, Jingzhi Tu, Lei Xiao, Francesco Piccialli

Comparative results demonstrate that the proposed graph clustering algorithm is accurate yet efficient for large networks, which also means that it can be further used to evaluate the intra-cluster and inter-cluster trusts on large networks.

Clustering Graph Clustering

Cannot find the paper you are looking for? You can Submit a new open access paper.