Predicting Author Blog Channels with High Value Future Posts for Monitoring

Shanchan Wu, T. Elsayed, W. Rand, L. Raschid
{"title":"Predicting Author Blog Channels with High Value Future Posts for Monitoring","authors":"Shanchan Wu, T. Elsayed, W. Rand, L. Raschid","doi":"10.2139/ssrn.1927096","DOIUrl":null,"url":null,"abstract":"\n \n The phenomenal growth of social media, both in scale and importance, has created a unique opportunity to track information diffusion and the spread of influence, but can also make efficient tracking difficult. Given data streams representing blog posts on multiple blog channels and a focal query post on some topic of interest, our objective is to predict which of those channels are most likely to contain a future post that is relevant, or similar, to the focal query post. We denote this task as the future author prediction problem (FAPP). This problem has applications in information diffusion for brand monitoring and blog channel personalization and recommendation. We develop prediction methods inspired by (naive) information retrieval approaches that use historical posts in the blog channel for prediction. We also train a ranking support vector machine (SVM) to solve the problem. We evaluate our methods on an extensive social media dataset; despite the difficulty of the task, all methods perform reasonably well. Results show that ranking SVM prediction can exploit blog channel and diffusion characteristics to improve prediction accuracy. Moreover, it is surprisingly good for prediction in emerging topics and identifying inconsistent authors.\n \n","PeriodicalId":158654,"journal":{"name":"Robert H. Smith: Center for Complexity in Business (Topic)","volume":"71 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-01-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Robert H. Smith: Center for Complexity in Business (Topic)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.2139/ssrn.1927096","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

Abstract

The phenomenal growth of social media, both in scale and importance, has created a unique opportunity to track information diffusion and the spread of influence, but can also make efficient tracking difficult. Given data streams representing blog posts on multiple blog channels and a focal query post on some topic of interest, our objective is to predict which of those channels are most likely to contain a future post that is relevant, or similar, to the focal query post. We denote this task as the future author prediction problem (FAPP). This problem has applications in information diffusion for brand monitoring and blog channel personalization and recommendation. We develop prediction methods inspired by (naive) information retrieval approaches that use historical posts in the blog channel for prediction. We also train a ranking support vector machine (SVM) to solve the problem. We evaluate our methods on an extensive social media dataset; despite the difficulty of the task, all methods perform reasonably well. Results show that ranking SVM prediction can exploit blog channel and diffusion characteristics to improve prediction accuracy. Moreover, it is surprisingly good for prediction in emerging topics and identifying inconsistent authors.
预测未来有高价值文章的作者博客频道进行监控
社交媒体在规模和重要性上的显著增长,为跟踪信息扩散和影响力的传播创造了独特的机会,但也可能使有效的跟踪变得困难。给定表示多个博客通道上的博客文章和某个感兴趣主题的焦点查询文章的数据流,我们的目标是预测哪些通道最有可能包含与焦点查询文章相关或相似的未来文章。我们把这个任务称为未来作者预测问题(FAPP)。该问题在品牌监控的信息扩散和博客渠道的个性化推荐中都有应用。我们开发的预测方法受到(朴素的)信息检索方法的启发,这些方法使用博客频道中的历史帖子进行预测。我们还训练了一个排序支持向量机(SVM)来解决这个问题。我们在一个广泛的社交媒体数据集上评估我们的方法;尽管这项任务很困难,但所有方法的效果都相当不错。结果表明,排序支持向量机预测可以利用博客通道和扩散特性来提高预测精度。此外,它在预测新兴主题和识别不一致的作者方面出奇地好。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信