Random Walk with Pre-filtering for Social Link Prediction

Ting Jin, Tong Xu, Enhong Chen, Qi Liu, Haiping Ma, Jingsong Lv, Guoping Hu
{"title":"Random Walk with Pre-filtering for Social Link Prediction","authors":"Ting Jin, Tong Xu, Enhong Chen, Qi Liu, Haiping Ma, Jingsong Lv, Guoping Hu","doi":"10.1109/CIS.2013.36","DOIUrl":null,"url":null,"abstract":"The prosperity of content-oriented social media services has raised the new chances for understanding users' social behaviors. Different from traditional social networks, the links in social media are usually influenced by user references rather than the real world connections, thus the traditional methods based on social network evolvement may fail to reveal the adequate links. Meanwhile, the existing link prediction algorithms considering both social topology and nodes attributes might be too much computationally complex. To deal with these challenges, in this paper, we propose a two steps link prediction framework, in which a filter is functioned to select the candidates firstly, and then the adapted Supervised Random Walk (SRW) is executed to rank the candidates for prediction. Experiments on the real world data set of social media indicate that our framework could effectively and efficiently predict the appropriate links, which outperforms the baselines including ordinary SRW with acceptable margin.","PeriodicalId":294223,"journal":{"name":"2013 Ninth International Conference on Computational Intelligence and Security","volume":"22 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 Ninth International Conference on Computational Intelligence and Security","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CIS.2013.36","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

Abstract

The prosperity of content-oriented social media services has raised the new chances for understanding users' social behaviors. Different from traditional social networks, the links in social media are usually influenced by user references rather than the real world connections, thus the traditional methods based on social network evolvement may fail to reveal the adequate links. Meanwhile, the existing link prediction algorithms considering both social topology and nodes attributes might be too much computationally complex. To deal with these challenges, in this paper, we propose a two steps link prediction framework, in which a filter is functioned to select the candidates firstly, and then the adapted Supervised Random Walk (SRW) is executed to rank the candidates for prediction. Experiments on the real world data set of social media indicate that our framework could effectively and efficiently predict the appropriate links, which outperforms the baselines including ordinary SRW with acceptable margin.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
社会链接预测的预过滤随机漫步
以内容为导向的社交媒体服务的繁荣为理解用户的社交行为提供了新的机会。与传统社交网络不同的是,社交媒体中的链接通常受到用户参考的影响,而不是现实世界的联系,因此基于社交网络演变的传统方法可能无法揭示足够的链接。同时,现有的同时考虑社会拓扑和节点属性的链路预测算法计算量过大。为了应对这些挑战,本文提出了一种两步链接预测框架,该框架首先使用过滤器选择候选节点,然后使用自适应的有监督随机行走(SRW)对候选节点进行排序。在真实的社交媒体数据集上的实验表明,我们的框架能够有效地预测出合适的链接,在可接受的边际范围内优于包括普通SRW在内的基线。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Co-op Advertising Analysis within a Supply Chain Based on the Three-Stage Non-cooperate Dynamic Game Model Study on Pseudorandomness of Some Pseudorandom Number Generators with Application The Superiority Analysis of Linear Frequency Modulation and Barker Code Composite Radar Signal The Improvement of the Commonly Used Linear Polynomial Selection Methods A Parallel Genetic Algorithm for Solving the Probabilistic Minimum Spanning Tree Problem
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1