A k-MCST Based Algorithm for Discovering Core-Periphery Structures in Graphs.
Susheela PolepalliRaj BhatnagarPublished in: PAKDD (1) (2021)
Keyphrases
- learning algorithm
- cost function
- detection algorithm
- graph structure
- experimental evaluation
- convergence rate
- times faster
- theoretical analysis
- particle swarm optimization
- high accuracy
- improved algorithm
- computational cost
- dynamic programming
- k means
- graph clustering
- graph structures
- computational complexity
- segmentation algorithm
- significant improvement
- preprocessing
- worst case
- spanning tree
- minimum spanning tree
- graph construction
- introduce a general framework