Yaakub, Mohd Ridzwan
Unknown Affiliation

Published : 2 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 2 Documents
Search

Strategies for improving the quality of community detection based on modularity optimization Setiadi, Tedy; Yaakub, Mohd Ridzwan; Abu Bakar, Azuraliza
IAES International Journal of Artificial Intelligence (IJ-AI) Vol 13, No 2: June 2024
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijai.v13.i2.pp1794-1804

Abstract

Community detection is a field of interest in social networks. Many new methods have emerged for community detection solution, however the modularity optimization method is the most prominent. Community detection based on modularity optimization (CDMO) has fundamental problems in the form of solution degeneration and resolution limits. From the two problems, the resolution limit is more concerned because it affects the resulting community's quality. During the last decade, many studies have attempted to address the problems, but so far they have been carried out partially, no one has thoroughly discussed efforts to improve the quality of CDMO. In this paper, we aim to investigate works in handling resolution limit and improving the quality of CDMO, along with their strengths and limitations. We derive six categories of strategies to improve the quality of CDMO, namely developing multi-resolution modularity, creating local modularity, creating modularity density, creating new metrics as an alternative to modularity, creating new quality metrics as a substitute for modularity, involving node attributes in determining community detection, and extending the single objective function into a multi-objective function. These strategies can be used as a guide in developing community detection methods. By considering network size, network type, and community distribution, we can choose the appropriate strategy in improving the quality of community detection.
Community preserving sparsification based on K-core for enhanced community detection in attributed networks Setiadi, Tedy; Yaakub, Mohd Ridzwan; Bakar, Azuraliza Abu
International Journal of Advances in Intelligent Informatics Vol 11, No 4 (2025): November 2025
Publisher : Universitas Ahmad Dahlan

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.26555/ijain.v11i4.2209

Abstract

Community detection is an important aspect of complex network analysis, especially in attribute networks where topological structure and attribute information both play a role in community formation. Traditional structure-based methods tend to result in topologically dense but semantically inconsistent communities, while attribute-based approaches can improve semantic coherence but face scalability constraints and high computational costs. On the other hand, graph sparsification techniques have been used to reduce the size of the network, but most focus on structural aspects alone and rarely consider attributes, so the quality of the resulting community is often degraded. This study proposes CPSK (Community Preserving Sparsification based on K-core), a sparsification framework that combines k-core decomposition with attribute-based side weighting. This approach is designed specifically for attribute networks, with the aim of maintaining a balance between structural reduction and community semantic consistency, while improving the efficiency of the detection process. Evaluation of the six datasets showed that CPSK consistently generates more stable and meaningful communities than existing attribute-based community detection methods, while maintaining an edge in computing efficiency on large-scale and heterogeneous networks.