کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
495557 862830 2014 13 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Multi-level learning based memetic algorithm for community detection
ترجمه فارسی عنوان
الگوریتم مکتوب مبتنی بر یادگیری چند سطحی برای تشخیص جامعه
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر نرم افزارهای علوم کامپیوتر
چکیده انگلیسی


• We propose a fast memetic algorithm to uncover community structure in networks.
• The proposed algorithm is based on novel multi-level learning strategies at nodes, communities and network partitions levels.
• Our algorithm need not know the number of clusters in advance.
• Our algorithm has superior performances in speed, accuracy and stability.

Complex network has become an important way to analyze the massive disordered information of complex systems, and its community structure property is indispensable to discover the potential functionality of these systems. The research on uncovering the community structure of networks has attracted great attentions from various fields in recent years. Many community detection approaches have been proposed based on the modularity optimization. Among them, the algorithms which optimize one initial solution to a better one are easy to get into local optima. Moreover, the algorithms which are susceptible to the optimized order are easy to obtain unstable solutions. In addition, the algorithms which simultaneously optimize a population of solutions have high computational complexity, and thus they are difficult to apply to practical problems. To solve the above problems, in this study, we propose a fast memetic algorithm with multi-level learning strategies for community detection by optimizing modularity. The proposed algorithm adopts genetic algorithm to optimize a population of solutions and uses the proposed multi-level learning strategies to accelerate the optimization process. The multi-level learning strategies are devised based on the potential knowledge of the node, community and partition structures of networks, and they work on the network at nodes, communities and network partitions levels, respectively. Extensive experiments on both benchmarks and real-world networks demonstrate that compared with the state-of-the-art community detection algorithms, the proposed algorithm has effective performance on discovering the community structure of networks.

Figure optionsDownload as PowerPoint slide

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Applied Soft Computing - Volume 19, June 2014, Pages 121–133
نویسندگان
, , , , ,