.png){kind=icon}
返回
A robust ant colony optimization-based algorithm for community mining in large scale oriented social graphs
.png){kind=icon}
PRE
AI
DOI：10.1016/j.eswa.2013.04.021.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Community detection plays a key role in such important fields as biology, sociology and computer science. For example, detecting the communities in protein-protein interactions networks helps in understanding their functionalities. Most existing approaches were devoted to community mining in undirected social networks (either weighted or not). In fact, despite their ubiquity, few proposals were interested in community detection in oriented social networks. For example, in a friendship network, the influence between individuals could be asymmetric; in a networked environment, the flow of information could be unidirectional. In this paper, we propose an algorithm, called ACODIG, for community detection in oriented social networks. ACODIG uses an objective function based on measures of density and purity and incorporates the information about edge orientations in the social graph. ACODIG uses ant colony for its optimization. Simulation results on real-world as well as power law artificial benchmark networks reveal a good robustness of ACODIG and an efficiency in computing the real structure of the network. (C) 2013 Published by Elsevier Ltd.
Keyword:
Ant colony optimization
Community detection
Social networks
NP-complete
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.5
论文数:
3.0W
被引数:
10.2W
机构
引用论文
分享收藏Epidemiology, Demographics, and Pathophysiology of Acute Spinal Cord Injury急性脊髓损伤的流行病学，人口统计学和病理生理学.png)
Spine
OAAI
SpineIF0
OAAI分享收藏
查看更多内容