Divisive Algorithm Based on Node Clustering Coefficient for Community Detection
This paper studies the relationship between the clustering coefficient of nodes and the community structure of the network. Communities in a network are regarded as node-induced subgraphs of the network in this study. We define the border of a subgraph and the node network density of a node and pres...
Main Authors: | Qingbin Ji, Deyu Li, Zhen Jin |
---|---|
Format: | Article |
Language: | English |
Published: |
IEEE
2020-01-01
|
Series: | IEEE Access |
Subjects: | |
Online Access: | https://ieeexplore.ieee.org/document/9153899/ |
Similar Items
-
Generating Random Graphs with Tunable Clustering Coefficient
by: Parikh, Nidhi Kiranbhai
Published: (2014) -
Network community partition based on intelligent clustering algorithm
by: Z.M. Cai
Published: (2020-12-01) -
Community Detection Algorithm Based on Nonnegative Matrix Factorization and Improved Density Peak Clustering
by: Hong Lu, et al.
Published: (2020-01-01) -
Community Detection and Visualization in Complex Network by the Density-Canopy-Kmeans Algorithm and MDS Embedding
by: Manzhi Li, et al.
Published: (2019-01-01) -
Overlapping Structures Detection in Protein-Protein Interaction Networks Using Community Detection Algorithm Based on Neighbor Clustering Coefficient
by: Yan Wang, et al.
Published: (2021-06-01)