基于拓扑数据演化的社交网络链接预测方法

Érick S. Florentino, Argus A. B. Cavalcante, R. Goldschmidt
{"title":"基于拓扑数据演化的社交网络链接预测方法","authors":"Érick S. Florentino, Argus A. B. Cavalcante, R. Goldschmidt","doi":"10.1145/3330204.3330236","DOIUrl":null,"url":null,"abstract":"Link prediction is a graph mining task that aims to identify pairs of non-connected vertices that have a high probability to connect in the future. This task has been frequently implemented by recommendation systems that suggest new interactions between users in social networks. In general, the state-of-the-art link prediction methods only consider data from the most complete and recent state of the network. They do not take into account information about the existing topology when new edges were added to the network's structure. This study raises the hypothesis that recovering such data may contribute to building predictive models more precise than the available ones since those data enrich the description of the application's context with examples that represent exactly the kind of event to be foreseen: the appearance of new connections. Hence, this paper evaluates such hypothesis. For this purpose, it proposes a link prediction method that is based on the historical evolution of the topologies of social networks. Results from experiments with ten real coauthorship social networks reveal the adequacy of the proposed method and the confirmation of the raised hypothesis.","PeriodicalId":348938,"journal":{"name":"Proceedings of the XV Brazilian Symposium on Information Systems","volume":"15 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"A Topological Data Evolution Based Method to Predict Links in Social Networks\",\"authors\":\"Érick S. Florentino, Argus A. B. Cavalcante, R. Goldschmidt\",\"doi\":\"10.1145/3330204.3330236\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Link prediction is a graph mining task that aims to identify pairs of non-connected vertices that have a high probability to connect in the future. This task has been frequently implemented by recommendation systems that suggest new interactions between users in social networks. In general, the state-of-the-art link prediction methods only consider data from the most complete and recent state of the network. They do not take into account information about the existing topology when new edges were added to the network's structure. This study raises the hypothesis that recovering such data may contribute to building predictive models more precise than the available ones since those data enrich the description of the application's context with examples that represent exactly the kind of event to be foreseen: the appearance of new connections. Hence, this paper evaluates such hypothesis. For this purpose, it proposes a link prediction method that is based on the historical evolution of the topologies of social networks. Results from experiments with ten real coauthorship social networks reveal the adequacy of the proposed method and the confirmation of the raised hypothesis.\",\"PeriodicalId\":348938,\"journal\":{\"name\":\"Proceedings of the XV Brazilian Symposium on Information Systems\",\"volume\":\"15 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-05-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the XV Brazilian Symposium on Information Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3330204.3330236\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the XV Brazilian Symposium on Information Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3330204.3330236","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

链接预测是一种图挖掘任务,旨在识别未来有高概率连接的非连接顶点对。这个任务经常被推荐系统实现,这些系统建议社交网络中用户之间的新交互。一般来说,最先进的链路预测方法只考虑来自网络最完整和最新状态的数据。当新边被添加到网络结构中时,它们不考虑现有拓扑的信息。这项研究提出了一个假设,即恢复这些数据可能有助于建立比现有的预测模型更精确的预测模型,因为这些数据丰富了应用程序上下文的描述,这些例子恰好代表了要预测的事件类型:新连接的出现。因此,本文对这一假设进行了评估。为此,提出了一种基于社会网络拓扑历史演变的链路预测方法。从十个真实的合作社交网络的实验结果揭示了所提出的方法的充分性和所提出的假设的确认。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A Topological Data Evolution Based Method to Predict Links in Social Networks
Link prediction is a graph mining task that aims to identify pairs of non-connected vertices that have a high probability to connect in the future. This task has been frequently implemented by recommendation systems that suggest new interactions between users in social networks. In general, the state-of-the-art link prediction methods only consider data from the most complete and recent state of the network. They do not take into account information about the existing topology when new edges were added to the network's structure. This study raises the hypothesis that recovering such data may contribute to building predictive models more precise than the available ones since those data enrich the description of the application's context with examples that represent exactly the kind of event to be foreseen: the appearance of new connections. Hence, this paper evaluates such hypothesis. For this purpose, it proposes a link prediction method that is based on the historical evolution of the topologies of social networks. Results from experiments with ten real coauthorship social networks reveal the adequacy of the proposed method and the confirmation of the raised hypothesis.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信