基于主题相似度的链接添加提高重叠社区检测质量

Sonia Ghiasifard, Shahram Khadivi, M. Asadpour, Atefeh Zafarian
{"title":"基于主题相似度的链接添加提高重叠社区检测质量","authors":"Sonia Ghiasifard, Shahram Khadivi, M. Asadpour, Atefeh Zafarian","doi":"10.1109/AISP.2015.7123518","DOIUrl":null,"url":null,"abstract":"Community detection in social networks is usually done based on the density of connections between groups of nodes. However, these links do not necessarily represent an actual friendship especially in online social networks. There are users with declared friendship connections but without actual communication and no common interests. Most of the works in this area can be divided into two groups: topology-based and topic-based. The former usually leads to communities each containing diverse topics, and the latter leads to communities each with a consistent topic but with diverse structure. In this paper, we measure the similarity between users using topic models to generate virtual links for users with common interests. Moreover, in order to reduce the effect of useless links between users, we weight the network by measuring similarity of users' topics, so we could generate conforming communities, which contain only one topic or a group of consistent topics. The test results on Enron email dataset have shown the superior performance of our proposed method in the task of community detection.","PeriodicalId":405857,"journal":{"name":"2015 The International Symposium on Artificial Intelligence and Signal Processing (AISP)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2015-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Improving the quality of overlapping community detection through link addition based on topic similarity\",\"authors\":\"Sonia Ghiasifard, Shahram Khadivi, M. Asadpour, Atefeh Zafarian\",\"doi\":\"10.1109/AISP.2015.7123518\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Community detection in social networks is usually done based on the density of connections between groups of nodes. However, these links do not necessarily represent an actual friendship especially in online social networks. There are users with declared friendship connections but without actual communication and no common interests. Most of the works in this area can be divided into two groups: topology-based and topic-based. The former usually leads to communities each containing diverse topics, and the latter leads to communities each with a consistent topic but with diverse structure. In this paper, we measure the similarity between users using topic models to generate virtual links for users with common interests. Moreover, in order to reduce the effect of useless links between users, we weight the network by measuring similarity of users' topics, so we could generate conforming communities, which contain only one topic or a group of consistent topics. The test results on Enron email dataset have shown the superior performance of our proposed method in the task of community detection.\",\"PeriodicalId\":405857,\"journal\":{\"name\":\"2015 The International Symposium on Artificial Intelligence and Signal Processing (AISP)\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-03-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 The International Symposium on Artificial Intelligence and Signal Processing (AISP)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/AISP.2015.7123518\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 The International Symposium on Artificial Intelligence and Signal Processing (AISP)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/AISP.2015.7123518","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

社交网络中的社区检测通常基于节点组之间的连接密度来完成。然而,这些联系并不一定代表真正的友谊,尤其是在在线社交网络中。有些用户宣称是朋友,但没有实际的交流,也没有共同的兴趣。该领域的大部分工作可以分为两类:基于拓扑的和基于主题的。前者通常导致每个社区都包含不同的主题,后者导致每个社区都有一致的主题,但结构不同。在本文中,我们使用主题模型来度量用户之间的相似度,为具有共同兴趣的用户生成虚拟链接。此外,为了减少用户之间无用链接的影响,我们通过测量用户主题的相似度来对网络进行加权,因此我们可以生成一致性社区,该社区仅包含一个主题或一组一致的主题。在安然电子邮件数据集上的测试结果表明,本文提出的方法在社区检测任务中具有优越的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Improving the quality of overlapping community detection through link addition based on topic similarity
Community detection in social networks is usually done based on the density of connections between groups of nodes. However, these links do not necessarily represent an actual friendship especially in online social networks. There are users with declared friendship connections but without actual communication and no common interests. Most of the works in this area can be divided into two groups: topology-based and topic-based. The former usually leads to communities each containing diverse topics, and the latter leads to communities each with a consistent topic but with diverse structure. In this paper, we measure the similarity between users using topic models to generate virtual links for users with common interests. Moreover, in order to reduce the effect of useless links between users, we weight the network by measuring similarity of users' topics, so we could generate conforming communities, which contain only one topic or a group of consistent topics. The test results on Enron email dataset have shown the superior performance of our proposed method in the task of community detection.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信