Jul 2026· Knowledge and Information Systems· Vol 68· 0 citations· 61 references
TL;DR
A novel method is designed that disrupts the structure of the original network by adding and deleting edges, ensuring an equal number of additions and deletions, with the aim to enhance concealment and address the issue of inadequate deception.
A novel heuristic community detection algorithm, termed CoDeSEG, which identifies communities by minimizing the network's two-dimensional structural entropy within a potential game framework, and introduces a structural entropy-based node overlapping heuristic for detecting overlapping communities, with a near-linear t...
Pu Li, Yantuan Xian, Hao Peng et al.· arXiv.org· 0 citations
This paper presents an efficient hybrid genetic algorithm for multi-objective community detection that makes a good trade-off between solution quality and computational efficiency and provides a viable and scalable approach to community detection in large-scale complex networks.
Mariwan Wahid Ahmed, Kamaran Hama Ali Faraj· International Journal of Art...· 0 citations
The experimental results show that FMDM-DE demonstrates superiority or strong competitiveness over seven state-of-the-art algorithms in terms of mean squared error, standard deviation, and optimization accuracy, indicating its excellent robustness and optimization capability.
Li-Qi Zhao, Zheng-Hao Song, Liang-Liang Sun et al.· Cluster Computing· 0 citations
Can cooperation among large language model (LLM) agents be evolutionarily stable against free-rider invasion? We study an indirect reciprocity donation game where LLM agents observe behavioral traces and donate on a continuous scale. Strategies, represented as natural language prompts, evolve through cultural transmiss...
A group-aware multi-objective evolutionary framework that decomposes seed sets into group-specific sub-solutions that maintains population diversity through subpopulation co-evolution and adaptive sampling and introduces a sampling-based strategy that generates new composite solutions by probabilistically selecting bes...
A. Osmani, L. Tafakori, M. Jalili et al.· Artificial Intelligence Revi...· 0 citations
This work analytically present that stochastic population update can be beneficial for the search of MOEAs, and proves that the expected running time of two well-established MOEAs, SMS-EMOA and NSGA-II, for solving two bi-objective problems can be exponentially decreased if replacing its deterministic population update...
Chao Bian, Yawen Zhou, Miqing Li et al.· GECCO Companion· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.