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.