A Topic Aware-based Approach to Maximize Social Influence

Daniel Santos, A. Perkusich, H. Almeida
{"title":"A Topic Aware-based Approach to Maximize Social Influence","authors":"Daniel Santos, A. Perkusich, H. Almeida","doi":"10.1145/2664551.2664571","DOIUrl":null,"url":null,"abstract":"The use of social networks has shown great potential for information diffusion and formation of public opinion. One key problem that has attracted researchers interest is Topic-based Influence Maximization, that refers to finding a small set of users on a social network that have the ability to influence a substantial portion of users on a given topic. The proposed solutions, however, are not suitable for large-scale social networks and must incorporate mechanisms for determining social influence among users on each topic of interest. Consequently, for these approaches, it becomes difficult or even unfeasible to deal quickly and efficiently with constant changes in the structure of social networks. This problem is particularly relevant as the topics of interest of users and the social influence they exert on each other for every topic are considered together. In this work, it is proposed a scalable solution, that makes use of data mining over an information propagation log, in order to directly select the initial set of influential users on a particular topic without the need to incorporate a previous step for learning users social influence with regard to that topic. As an additional benefit, the targeted seed set also offers an approximation guarantee of the optimal solution. Finally, it is presented a design of experiments over a data set containing information propagation data from a real social network. As main results, we have found some evidences that the proposed solution maintains a trade-off between scalability and accuracy.","PeriodicalId":114454,"journal":{"name":"Brazilian Symposium on Multimedia and the Web","volume":"45 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-11-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Brazilian Symposium on Multimedia and the Web","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2664551.2664571","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

The use of social networks has shown great potential for information diffusion and formation of public opinion. One key problem that has attracted researchers interest is Topic-based Influence Maximization, that refers to finding a small set of users on a social network that have the ability to influence a substantial portion of users on a given topic. The proposed solutions, however, are not suitable for large-scale social networks and must incorporate mechanisms for determining social influence among users on each topic of interest. Consequently, for these approaches, it becomes difficult or even unfeasible to deal quickly and efficiently with constant changes in the structure of social networks. This problem is particularly relevant as the topics of interest of users and the social influence they exert on each other for every topic are considered together. In this work, it is proposed a scalable solution, that makes use of data mining over an information propagation log, in order to directly select the initial set of influential users on a particular topic without the need to incorporate a previous step for learning users social influence with regard to that topic. As an additional benefit, the targeted seed set also offers an approximation guarantee of the optimal solution. Finally, it is presented a design of experiments over a data set containing information propagation data from a real social network. As main results, we have found some evidences that the proposed solution maintains a trade-off between scalability and accuracy.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
以主题意识为基础的最大化社会影响力的方法
社会网络的使用显示了信息传播和舆论形成的巨大潜力。一个引起研究人员兴趣的关键问题是基于主题的影响力最大化,这是指在社交网络上找到一小部分用户,他们有能力影响给定主题的大部分用户。然而,所提出的解决方案不适合大规模的社交网络,必须包含确定用户对每个感兴趣主题的社会影响的机制。因此,对于这些方法来说,快速有效地处理社会网络结构的不断变化变得困难甚至不可行的。这个问题是特别相关的,因为用户感兴趣的话题和他们对每个话题相互施加的社会影响是一起考虑的。在这项工作中,提出了一种可扩展的解决方案,该解决方案利用信息传播日志上的数据挖掘,以便直接选择特定主题上有影响力的用户的初始集合,而无需合并先前的步骤来学习用户对该主题的社会影响力。作为一个额外的好处,目标种子集还提供了最优解的近似保证。最后,提出了一种基于真实社会网络的信息传播数据集的实验设计。作为主要结果,我们发现了一些证据,表明所提出的解决方案保持了可伸缩性和准确性之间的权衡。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Increasing reuse in learning objects authoring: a case study with the Cacuriá tool A Middleware for the Development of Distributed Collaborative Video Applications Social Flipped Classroom, an Innovative Strategy to Improve R&D on a Computer Technological Park Video Streaming Over Publish/Subscribe Features of Second Screen Applications: A Systematic Review
×
引用
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