Vertex-Weighted Measures for Link Prediction in Hashtag Graphs

Logan Praznik, Gautam Srivastava, Chetan Mendhe, Vijay K. Mago
{"title":"Vertex-Weighted Measures for Link Prediction in Hashtag Graphs","authors":"Logan Praznik, Gautam Srivastava, Chetan Mendhe, Vijay K. Mago","doi":"10.1145/3341161.3344828","DOIUrl":null,"url":null,"abstract":"Communications on the popular social networking platform, Twitter, can be mapped in terms of a hashtag graph, where vertices correspond to hashtags, and edges correspond to co-occurrences of hashtags within the same distinct tweet. Furthermore, a vertex in hashtag graphs can be weighted with the number of tweets a hashtag has occurred in, and edges can be weighted with the number of tweets both hashtags have co-occurred in. In this paper, we describe additions to some well-known link prediction methods that allow the weights of both vertices and edges in a weighted hashtag graph to be taken into account. We base our novel predictive additions on the assumption that more popular hashtags have a higher probability to appear with other hashtags in the future. We then apply these improved methods to 3 sets of Twitter data with the intent of predicting hashtags co-occurences in the future. Experimental results on real-life data sets consisting of over 3, 000, 000 combined unique Tweets and over 250, 000 unique hashtags show the effectiveness of the proposed models and algorithms on weighted hashtag graphs.","PeriodicalId":403360,"journal":{"name":"2019 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3341161.3344828","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 9

Abstract

Communications on the popular social networking platform, Twitter, can be mapped in terms of a hashtag graph, where vertices correspond to hashtags, and edges correspond to co-occurrences of hashtags within the same distinct tweet. Furthermore, a vertex in hashtag graphs can be weighted with the number of tweets a hashtag has occurred in, and edges can be weighted with the number of tweets both hashtags have co-occurred in. In this paper, we describe additions to some well-known link prediction methods that allow the weights of both vertices and edges in a weighted hashtag graph to be taken into account. We base our novel predictive additions on the assumption that more popular hashtags have a higher probability to appear with other hashtags in the future. We then apply these improved methods to 3 sets of Twitter data with the intent of predicting hashtags co-occurences in the future. Experimental results on real-life data sets consisting of over 3, 000, 000 combined unique Tweets and over 250, 000 unique hashtags show the effectiveness of the proposed models and algorithms on weighted hashtag graphs.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
标签图中链接预测的顶点加权测度
流行的社交网络平台Twitter上的交流可以用标签图进行映射,其中顶点对应于标签,边缘对应于同一条不同推文中标签的共同出现。此外,hashtag图中的顶点可以用一个hashtag出现的tweet的数量来加权,而边可以用两个hashtag共同出现的tweet的数量来加权。在本文中,我们描述了对一些著名的链接预测方法的补充,这些方法允许考虑加权标签图中顶点和边的权重。我们基于这样的假设,即更受欢迎的标签在未来与其他标签一起出现的可能性更高。然后,我们将这些改进的方法应用于3组Twitter数据,目的是预测未来标签共同出现的情况。在真实数据集上的实验结果表明,所提出的模型和算法在加权标签图上是有效的,这些数据集包括超过300万条独立推文和超过25万个独立标签。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Neural-Brane: An inductive approach for attributed network embedding Customer Recommendation Based on Profile Matching and Customized Campaigns in On-Line Social Networks Characterizing and Detecting Livestreaming Chatbots Two Decades of Network Science: as seen through the co-authorship network of network scientists Show me your friends, and I will tell you whom you vote for: Predicting voting behavior in social networks
×
引用
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