arrow
返回

A Multi-Objective Genetic Algorithm for detecting dynamic communities using a local search driven immigrant's scheme

delete2020-09-01
delete6
PRE
AI
Á
Ángel Panizo-LLedot
G
Gema Bello-Orgaz
D
David Camacho *
DOI:10.1016/j.future.2019.10.041delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
The interest in Community Detection Problems on networks that evolves over time has experienced an increasing attention over the last years. Multi-Objective Genetic Algorithms and other bio-inspired methods have been successfully applied to tackle the community finding problem in static networks. Although, there are a large number of evolutionary and bio-inspired approaches that combine Local Search Strategies and other techniques from graph theory to handle the community detection problems in static networks, few research has been done related to the application of these algorithms over temporal, or dynamic, networks. This work is focused on the design, implementation, and the empirical analysis of a new Multi-Objective Genetic Algorithm that combines an Immigrant's scheme with local search strategies for dynamic community detection. The main contribution of this new algorithm is to address the adaptation of these strategies to dynamic networks. On the one hand, the Immigrant's scheme motif is to reuse previously acquired information to reduce computational time. On the other hand, in a dynamic environment is possible that a valid solution became invalid due to some changes in the environment, for example, if some nodes or edges have been removed or added to the network. Therefore, the aim of the local search operator used in the new algorithm is to transform an invalid solution, due to a change happened on the network, into a valid one maintaining the highest possible quality. Finally, the proposed algorithm has been tested using several synthetic and real-world networks, and compared against several algorithms (DYNMOGA, ALPA, Infomap) from the state of the art. (C) 2019 Elsevier B.V. All rights reserved.
Keyword:
Dynamic community finding
Multi-Objective Genetic algorithms
Graph computing
Network analysis
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

F
Future Generation Computer Systems-The International Journal of eScience
IF:
6.1
论文数:
6.9K
被引数:
2.3W

机构

U
Universidad Politecnica de Madrid
学者数:
1.4W
论文数: 1.2W
被引数: 10
U
Universidad Rey Juan Carlos
学者数:
6.2K
论文数: 6.2K
被引数: 6.7K
引用论文

引用论文

Financial Risk Estimation in Construction Contracts
err2015-01-01
err0
errOAAI
errAgnieszka Dziadosz; Andrzej Tomczyk; Oleg Kapliński
err分享
err收藏
ADAPTIVE K-MEANS ALGORITHM FOR OVERLAPPED GRAPH CLUSTERING
err2012-09-26
err50
errOAAI
errBello-Orgaz, Gema; Menendez, Hector D.; Camacho, David
err分享
err收藏
err分享
err收藏
Measuring the Radicalisation Risk in Social Networks
err2017-01-01
err41
errOAAI
errLara-Cabrera, Raul; Gonzalez Pardon, Antonio; Benouaret, Karim; Faci, Noura; Benslimane, Djamal; Camacho, David
err分享
err收藏
Detecting communities and their evolutions in dynamic social networks-a Bayesian approach
err2010-09-25
err239
errOAAI
errYang, Tianbao; Chi, Yun; Zhu, Shenghuo; Gong, Yihong; Jin, Rong
err分享
err收藏
Sleep Apnea: Relationship to Age, Sex, and Alzheimer's Dementia
err1983-09-01
err0
PREAI
errRobert G Smallwood; Michael V. Vitiello; Elizabeth C. Giblin; Patricia N. Prinz
err分享
err收藏
学者 查看更多内容