KCoreMotif: An Efficient Graph Clustering Algorithm for Large Networks by Exploiting k-core Decomposition and Motifs.
Gang MeiJingzhi TuLei XiaoFrancesco PiccialliPublished in: CoRR (2020)
Keyphrases
- clustering algorithm
- biological networks
- graph clustering
- maximum spanning tree
- graph partitioning
- tree decomposition
- fully connected
- small world
- social networks
- average degree
- partitioning algorithm
- data clustering
- protein interaction networks
- network analysis
- decomposition method
- directed graph
- graph representation
- graph layout
- network structure
- functional modules
- graph structures
- edge weights
- graph matching
- structural learning
- graph mining
- overlapping communities
- graph structure
- graph theory
- network motifs
- community discovery
- bipartite graph
- random walk
- network size
- dynamic networks
- cluster analysis
- pairwise
- graph databases
- community detection
- weighted graph
- betweenness centrality
- bayesian networks
- fuzzy c means
- data mining