%0 Journal Article
%T Discovering Overlapping Communities Based on Line Graph and PSO<br>基于线图与PSO的网络重叠社区发现
%A HUANG Fa-Liang
%A XIAO Nan-Feng
%A <br>黄发良
%A 肖南峰
%J 自动化学报
%D 2011
%I 
%X From the perspective of optimizing modularity, an overlapping community discovery algorithm, LGPSO, is proposed based on line graph and PSO. The property that a partition of a line graph corresponds to a cover of the corresponding original graph is proved. LGPSO discovers overlapping communities in original graph using PSO to optimize partition of line graph. The experiments on some real-world networks show that the algorithm can fast and effectively discover the intrinsic overlapping communities in networks without any domain information.
%K Community discovery
%K line graph
%K particle swarm optimization (PSO)
%K complex network<br>社区发现
%K 线图
%K 粒子群优化
%K 复杂网络
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=E76622685B64B2AA896A7F777B64EB3A&aid=2CF049F8B8CD371031BF89D6A7A08FED&yid=9377ED8094509821&vid=42425781F0B1C26E&iid=9CF7A0430CBB2DFD&sid=D932AD0F8FDA3032&eid=EEBB803F60D7DC4B&journal_id=0254-4156&journal_name=自动化学报&referenced_num=0&reference_num=15