基于节点相似度的半监督社区发现算法

Jinghong Wang, Jiateng Yang, S. Shi
{"title":"基于节点相似度的半监督社区发现算法","authors":"Jinghong Wang, Jiateng Yang, S. Shi","doi":"10.1109/ISKE47853.2019.9170279","DOIUrl":null,"url":null,"abstract":"With the advent of the era 01 big data, complex network community detection has become an important research direction. Based on the similarity of the community detection methods attractions GN algorithm fast and accurate but has higher time complexity. In order to overcome the deficiency of GN efficiency, this paper presents a semi-supervised GN algorithm based on node similarity, takes full advantage of the known node, cannot link constraints, a priori information combined with the similarity information between nodes, and validated using artificial and real networks. It is proved that the algorithm proposed in this paper reduces the GN algorithm's time complexity and improve the efficiency.","PeriodicalId":399084,"journal":{"name":"2019 IEEE 14th International Conference on Intelligent Systems and Knowledge Engineering (ISKE)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Semi-Supervised Community Discovery Algorithm Based on Node Similarity\",\"authors\":\"Jinghong Wang, Jiateng Yang, S. Shi\",\"doi\":\"10.1109/ISKE47853.2019.9170279\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"With the advent of the era 01 big data, complex network community detection has become an important research direction. Based on the similarity of the community detection methods attractions GN algorithm fast and accurate but has higher time complexity. In order to overcome the deficiency of GN efficiency, this paper presents a semi-supervised GN algorithm based on node similarity, takes full advantage of the known node, cannot link constraints, a priori information combined with the similarity information between nodes, and validated using artificial and real networks. It is proved that the algorithm proposed in this paper reduces the GN algorithm's time complexity and improve the efficiency.\",\"PeriodicalId\":399084,\"journal\":{\"name\":\"2019 IEEE 14th International Conference on Intelligent Systems and Knowledge Engineering (ISKE)\",\"volume\":\"19 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2019 IEEE 14th International Conference on Intelligent Systems and Knowledge Engineering (ISKE)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISKE47853.2019.9170279\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 IEEE 14th International Conference on Intelligent Systems and Knowledge Engineering (ISKE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISKE47853.2019.9170279","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

随着01大数据时代的到来,复杂网络社区检测成为一个重要的研究方向。基于相似性的社区检测方法吸引GN算法快速准确,但具有较高的时间复杂度。为了克服GN效率的不足,本文提出了一种基于节点相似度的半监督GN算法,充分利用了已知节点、不能链接约束、先验信息与节点间相似度信息相结合的优势,并通过人工网络和真实网络进行了验证。实验证明,本文提出的算法降低了GN算法的时间复杂度,提高了效率。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Semi-Supervised Community Discovery Algorithm Based on Node Similarity
With the advent of the era 01 big data, complex network community detection has become an important research direction. Based on the similarity of the community detection methods attractions GN algorithm fast and accurate but has higher time complexity. In order to overcome the deficiency of GN efficiency, this paper presents a semi-supervised GN algorithm based on node similarity, takes full advantage of the known node, cannot link constraints, a priori information combined with the similarity information between nodes, and validated using artificial and real networks. It is proved that the algorithm proposed in this paper reduces the GN algorithm's time complexity and improve the efficiency.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信