基于元胞自动机的网络扩散模型:为更可扩展的病毒式营销做准备

Yin Guisheng, Wei Jijie, Dong Hongbin
{"title":"基于元胞自动机的网络扩散模型:为更可扩展的病毒式营销做准备","authors":"Yin Guisheng, Wei Jijie, Dong Hongbin","doi":"10.1109/CTS.2012.6261068","DOIUrl":null,"url":null,"abstract":"Nowadays, social network web sites are becoming increasingly popular. Accordingly, viral marketing which aimed to promote products in social network received more and more attention. The Network Diffusion model describes how information or influence is propagated in a social network. It is of great importance to the viral marketing/influence maximization problem. However, there are two challenges: first, how to build the diffusion model so as to simulate the diffusion process better, and second, how improve the efficiency of the diffusion model so that it can be applied to more scalable viral marketing problems. To tackle these two problems, we proposed a Cellular Automaton based Network Diffusion (CAND) model. We also proved that the CAND model is equivalent to the Linear Threshold (LT) model under certain conditions. Moreover, the model is realized and a speed up method is used so as to improve the efficiency of the model. Experiments show that compared with the LT model, our model is much more efficient on four real life social network datasets, indicating a better scalability for Viral Marketing.","PeriodicalId":200122,"journal":{"name":"2012 International Conference on Collaboration Technologies and Systems (CTS)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"A Cellular Automaton based Network Diffusion model: Preparation for more scalable Viral Marketing\",\"authors\":\"Yin Guisheng, Wei Jijie, Dong Hongbin\",\"doi\":\"10.1109/CTS.2012.6261068\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Nowadays, social network web sites are becoming increasingly popular. Accordingly, viral marketing which aimed to promote products in social network received more and more attention. The Network Diffusion model describes how information or influence is propagated in a social network. It is of great importance to the viral marketing/influence maximization problem. However, there are two challenges: first, how to build the diffusion model so as to simulate the diffusion process better, and second, how improve the efficiency of the diffusion model so that it can be applied to more scalable viral marketing problems. To tackle these two problems, we proposed a Cellular Automaton based Network Diffusion (CAND) model. We also proved that the CAND model is equivalent to the Linear Threshold (LT) model under certain conditions. Moreover, the model is realized and a speed up method is used so as to improve the efficiency of the model. Experiments show that compared with the LT model, our model is much more efficient on four real life social network datasets, indicating a better scalability for Viral Marketing.\",\"PeriodicalId\":200122,\"journal\":{\"name\":\"2012 International Conference on Collaboration Technologies and Systems (CTS)\",\"volume\":\"13 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-05-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2012 International Conference on Collaboration Technologies and Systems (CTS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CTS.2012.6261068\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 International Conference on Collaboration Technologies and Systems (CTS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CTS.2012.6261068","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

摘要

如今,社交网站正变得越来越流行。因此,以在社交网络上推广产品为目的的病毒式营销越来越受到重视。网络扩散模型描述了信息或影响如何在社交网络中传播。这对于病毒式营销/影响力最大化问题非常重要。然而,有两个挑战:一是如何建立扩散模型,以便更好地模拟扩散过程;二是如何提高扩散模型的效率,使其能够应用于更具可扩展性的病毒式营销问题。为了解决这两个问题,我们提出了一个基于元胞自动机的网络扩散(CAND)模型。我们还证明了CAND模型在一定条件下与线性阈值(LT)模型等效。在此基础上,对模型进行了实现,并采用加速方法提高了模型的效率。实验表明,与LT模型相比,我们的模型在四个现实生活中的社交网络数据集上效率更高,表明病毒式营销具有更好的可扩展性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A Cellular Automaton based Network Diffusion model: Preparation for more scalable Viral Marketing
Nowadays, social network web sites are becoming increasingly popular. Accordingly, viral marketing which aimed to promote products in social network received more and more attention. The Network Diffusion model describes how information or influence is propagated in a social network. It is of great importance to the viral marketing/influence maximization problem. However, there are two challenges: first, how to build the diffusion model so as to simulate the diffusion process better, and second, how improve the efficiency of the diffusion model so that it can be applied to more scalable viral marketing problems. To tackle these two problems, we proposed a Cellular Automaton based Network Diffusion (CAND) model. We also proved that the CAND model is equivalent to the Linear Threshold (LT) model under certain conditions. Moreover, the model is realized and a speed up method is used so as to improve the efficiency of the model. Experiments show that compared with the LT model, our model is much more efficient on four real life social network datasets, indicating a better scalability for Viral Marketing.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信