一种实时社区检测算法:增量标签传播

Sheng Pang, Changjia Chen, Ting Wei
{"title":"一种实时社区检测算法:增量标签传播","authors":"Sheng Pang, Changjia Chen, Ting Wei","doi":"10.1109/ICFIN.2009.5339592","DOIUrl":null,"url":null,"abstract":"Most networks will evolve with time instead of keeping unchanged in reality. Therefore, we proposed the incremental label propagation (ILP) algorithm to detect community structures in complex networks in realtime. ILP algorithm will only take the local changed vertexes into consideration. The computation time is greatly decreased, while vertex (edge) is changed. The algorithm will definitely converge for the original version of label propagation algorithm is converged. We also applied ILP to real-time community detection in a relationship network of online game.","PeriodicalId":123746,"journal":{"name":"2009 First International Conference on Future Information Networks","volume":"113 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":"{\"title\":\"A realtime community detection algorithm: incremental label propagation\",\"authors\":\"Sheng Pang, Changjia Chen, Ting Wei\",\"doi\":\"10.1109/ICFIN.2009.5339592\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Most networks will evolve with time instead of keeping unchanged in reality. Therefore, we proposed the incremental label propagation (ILP) algorithm to detect community structures in complex networks in realtime. ILP algorithm will only take the local changed vertexes into consideration. The computation time is greatly decreased, while vertex (edge) is changed. The algorithm will definitely converge for the original version of label propagation algorithm is converged. We also applied ILP to real-time community detection in a relationship network of online game.\",\"PeriodicalId\":123746,\"journal\":{\"name\":\"2009 First International Conference on Future Information Networks\",\"volume\":\"113 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-11-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"8\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 First International Conference on Future Information Networks\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICFIN.2009.5339592\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 First International Conference on Future Information Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICFIN.2009.5339592","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8

摘要

大多数网络将随着时间而发展,而不是在现实中保持不变。因此,我们提出了增量标签传播(ILP)算法来实时检测复杂网络中的社区结构。ILP算法只考虑局部变化的顶点。在改变顶点(边)的同时,大大减少了计算时间。由于原始版本的标签传播算法是收敛的,因此该算法一定会收敛。我们还将ILP应用于在线游戏关系网络中的实时社区检测。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A realtime community detection algorithm: incremental label propagation
Most networks will evolve with time instead of keeping unchanged in reality. Therefore, we proposed the incremental label propagation (ILP) algorithm to detect community structures in complex networks in realtime. ILP algorithm will only take the local changed vertexes into consideration. The computation time is greatly decreased, while vertex (edge) is changed. The algorithm will definitely converge for the original version of label propagation algorithm is converged. We also applied ILP to real-time community detection in a relationship network of online game.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信