K-core sparsification for intracommunity edges (KSI) for efficient and scalable community detection in complex networks

Community detection in complex networks often suffers from high computational cost and degraded community quality when graph reduction techniques excessively remove structurally important connections. To address this issue, this study proposes K-Core Sparsification for Intracommunity Edges (KSI), a community-aware graph reduction framework that integrates k-core-based backbone preservation with intra-community edge pruning to simplify network structures while maintaining community-relevant information. The proposed method was evaluated on benchmark networks with diverse structural characteristics using structural preservation, community quality, and computational efficiency metrics. Experimental results demonstrate that KSI preserves structural characteristics, improves modularity, reduces conductance, and achieves competitive computational efficiency compared with representative sparsification methods. These findings establish KSI as a community-aware structural refinement framework for scalable and effective community detection in complex networks.

Authors

Institutions

Publication Details

Journal
Intelligent Data Analysis
Published
2026-09-10
DOI
https://doi.org/10.1177/1088467x261486189
Primary Topic
Complex Network Analysis Techniques
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
article

K-core sparsification for intracommunity edges (KSI) for efficient and scalable community detection in complex networks

Tedy Setiadi, Mohd Ridzwan Yaakub, Azuraliza Abu Bakar
Intelligent Data Analysis
Complex Network Analysis Techniques
article

K-core sparsification for intracommunity edges (KSI) for efficient and scalable community detection in complex networks

Tedy Setiadi, Mohd Ridzwan Yaakub, Azuraliza Abu Bakar
article en

Abstract

Community detection in complex networks often suffers from high computational cost and degraded community quality when graph reduction techniques excessively remove structurally important connections. To address this issue, this study proposes K-Core Sparsification for Intracommunity Edges (KSI), a community-aware graph reduction framework that integrates k-core-based backbone preservation with intra-community edge pruning to simplify network structures while maintaining community-relevant information. The proposed method was evaluated on benchmark networks with diverse structural characteristics using structural preservation, community quality, and computational efficiency metrics. Experimental results demonstrate that KSI preserves structural characteristics, improves modularity, reduces conductance, and achieves competitive computational efficiency compared with representative sparsification methods. These findings establish KSI as a community-aware structural refinement framework for scalable and effective community detection in complex networks.

Intelligent Data Analysis
Universitas Ahmad Dahlan (ID), National University of Malaysia (MY)
Openalex Percentile: Top 10%
Complex Network Analysis Techniques
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

K-core sparsification for intracommunity edges (KSI) for efficient and scalable community detection in complex networks — Tedy Setiadi, Mohd Ridzwan Yaakub, et al. · Intelligent Data Analysis (2026) | TGRS Research Map | TGRS