节点可用性变化网络中的补偿播种

Jarosław Jankowski, Radosław Michalski, Przemyslaw Kazienko
{"title":"节点可用性变化网络中的补偿播种","authors":"Jarosław Jankowski, Radosław Michalski, Przemyslaw Kazienko","doi":"10.1145/2492517.2500256","DOIUrl":null,"url":null,"abstract":"Diffusion of information in social networks takes more and more attention from marketers. New methods and algorithms are constantly developed towards maximizing reach of the campaigns and increasing their effectiveness. One of the important research directions in this area is related to selecting initial nodes of the campaign to result with maximizing its effects represented as total number of infections. To achieve this goal, several strategies were developed and they are based on different network measures and other characteristics of users. The problem is that most of these strategies base on static network properties while typical online networks change over time and are sensitive to varying activity of users. In this work a novel strategy is proposed which is based on multiple measures with additional parameters related to nodes availability in time periods prior to the campaign. Presented results show that it is possible to compensate users with high network measures by others having high frequency of system usage, which, instead, may be easier or cheaper to acquire.","PeriodicalId":442230,"journal":{"name":"2013 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2013)","volume":"57 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-08-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"20","resultStr":"{\"title\":\"Compensatory seeding in networks with varying avaliability of nodes\",\"authors\":\"Jarosław Jankowski, Radosław Michalski, Przemyslaw Kazienko\",\"doi\":\"10.1145/2492517.2500256\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Diffusion of information in social networks takes more and more attention from marketers. New methods and algorithms are constantly developed towards maximizing reach of the campaigns and increasing their effectiveness. One of the important research directions in this area is related to selecting initial nodes of the campaign to result with maximizing its effects represented as total number of infections. To achieve this goal, several strategies were developed and they are based on different network measures and other characteristics of users. The problem is that most of these strategies base on static network properties while typical online networks change over time and are sensitive to varying activity of users. In this work a novel strategy is proposed which is based on multiple measures with additional parameters related to nodes availability in time periods prior to the campaign. Presented results show that it is possible to compensate users with high network measures by others having high frequency of system usage, which, instead, may be easier or cheaper to acquire.\",\"PeriodicalId\":442230,\"journal\":{\"name\":\"2013 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2013)\",\"volume\":\"57 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-08-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"20\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2013)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/2492517.2500256\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2013)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2492517.2500256","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 20

摘要

社交网络中的信息扩散越来越受到营销人员的关注。不断开发新的方法和算法,以最大限度地扩大活动范围并提高其有效性。该领域的一个重要研究方向是选择运动的初始节点,使其效果最大化,表示为感染总数。为了实现这一目标,开发了几种策略,它们基于不同的网络措施和用户的其他特征。问题是,这些策略大多基于静态网络属性,而典型的在线网络会随着时间的推移而变化,并且对用户活动的变化很敏感。在这项工作中,提出了一种新的策略,该策略基于与活动之前时间段内节点可用性相关的附加参数的多个度量。所提出的结果表明,可以通过其他具有高系统使用频率的用户来补偿具有高网络度量的用户,而这些用户可能更容易或更便宜地获得。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Compensatory seeding in networks with varying avaliability of nodes
Diffusion of information in social networks takes more and more attention from marketers. New methods and algorithms are constantly developed towards maximizing reach of the campaigns and increasing their effectiveness. One of the important research directions in this area is related to selecting initial nodes of the campaign to result with maximizing its effects represented as total number of infections. To achieve this goal, several strategies were developed and they are based on different network measures and other characteristics of users. The problem is that most of these strategies base on static network properties while typical online networks change over time and are sensitive to varying activity of users. In this work a novel strategy is proposed which is based on multiple measures with additional parameters related to nodes availability in time periods prior to the campaign. Presented results show that it is possible to compensate users with high network measures by others having high frequency of system usage, which, instead, may be easier or cheaper to acquire.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Statistical analysis and implications of SNS search in under-developed countries Identifying unreliable sources of skill and competency information Assessing group cohesion in homophily networks Exploiting online social data in ontology learning for event tracking and emergency response Event identification for social streams using keyword-based evolving graph sequences
×
引用
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