Competitive Influence Maximization within Time and Budget Constraints in Online Social Networks: An Algorithmic Approach
暂无分享,去创建一个
[1] Weiyi Liu,et al. Containment of competitive influence spread in social networks , 2016, Knowl. Based Syst..
[2] Laks V. S. Lakshmanan,et al. The bang for the buck: fair competitive viral marketing from the host perspective , 2013, KDD.
[3] Divyakant Agrawal,et al. Limiting the spread of misinformation in social networks , 2011, WWW.
[4] Richard M. Karp,et al. An Optimal Algorithm for Monte Carlo Estimation , 2000, SIAM J. Comput..
[5] John C. S. Lui,et al. Boosting Information Spread: An Algorithmic Approach , 2017, ICDE.
[6] Jure Leskovec,et al. Local Higher-Order Graph Clustering , 2017, KDD.
[7] Allan Borodin,et al. Threshold Models for Competitive Influence in Social Networks , 2010, WINE.
[8] Shishir Bharathi,et al. Competitive Influence Maximization in Social Networks , 2007, WINE.
[9] Xiaokui Xiao,et al. Influence maximization: near-optimal time complexity meets practical efficiency , 2014, SIGMOD Conference.
[10] Kian-Lee Tan,et al. Real-time Targeted Influence Maximization for Online Advertisements , 2015, Proc. VLDB Endow..
[11] Wei Chen,et al. Scalable influence maximization for prevalent viral marketing in large-scale social networks , 2010, KDD.
[12] Matthew Richardson,et al. Trust Management for the Semantic Web , 2003, SEMWEB.
[13] Xiaokui Xiao,et al. Influence Maximization in Near-Linear Time: A Martingale Approach , 2015, SIGMOD Conference.
[14] Jure Leskovec,et al. Community Structure in Large Networks: Natural Cluster Sizes and the Absence of Large Well-Defined Clusters , 2008, Internet Math..
[15] My T. Thai,et al. A Billion-Scale Approximation Algorithm for Maximizing Benefit in Viral Marketing , 2017, IEEE/ACM Transactions on Networking.
[16] Rong Zheng,et al. On Budgeted Influence Maximization in Social Networks , 2012, IEEE Journal on Selected Areas in Communications.
[17] Kyomin Jung,et al. IRIE: Scalable and Robust Influence Maximization in Social Networks , 2011, 2012 IEEE 12th International Conference on Data Mining.
[18] Leslie G. Valiant,et al. The Complexity of Enumeration and Reliability Problems , 1979, SIAM J. Comput..
[19] Johan Kwisthout,et al. Community-based influence maximization in social networks under a competitive linear threshold model , 2017, Knowl. Based Syst..
[20] Laks V. S. Lakshmanan,et al. SIMPATH: An Efficient Algorithm for Influence Maximization under the Linear Threshold Model , 2011, 2011 IEEE 11th International Conference on Data Mining.
[21] Deying Li,et al. Minimum cost seed set for threshold influence problem under competitive models , 2018, World Wide Web.
[22] My T. Thai,et al. Stop-and-Stare: Optimal Sampling Algorithms for Viral Marketing in Billion-scale Networks , 2016, SIGMOD Conference.
[23] Jon Kleinberg,et al. Maximizing the spread of influence through a social network , 2003, KDD '03.
[24] Fan Chung Graham,et al. Concentration Inequalities and Martingale Inequalities: A Survey , 2006, Internet Math..
[25] Andreas Krause,et al. Cost-effective outbreak detection in networks , 2007, KDD '07.
[26] Li Pan,et al. Dominated competitive influence maximization with time-critical and time-delayed diffusion in social networks , 2017, J. Comput. Sci..
[27] Christos Faloutsos,et al. Graph evolution: Densification and shrinking diameters , 2006, TKDD.
[28] Yifei Yuan,et al. Scalable Influence Maximization in Social Networks under the Linear Threshold Model , 2010, 2010 IEEE International Conference on Data Mining.
[29] Deying Li,et al. An efficient randomized algorithm for rumor blocking in online social networks , 2017, IEEE INFOCOM 2017 - IEEE Conference on Computer Communications.
[30] Laks V. S. Lakshmanan,et al. From Competition to Complementarity: Comparative Influence Diffusion and Maximization , 2015, Proc. VLDB Endow..
[31] Mong-Li Lee,et al. Targeted Influence Maximization in Social Networks , 2016, CIKM.
[32] Xuemin Lin,et al. Efficient Distance-Aware Influence Maximization in Geo-Social Networks , 2017, IEEE Transactions on Knowledge and Data Engineering.
[33] Laks V. S. Lakshmanan,et al. CELF++: optimizing the greedy algorithm for influence maximization in social networks , 2011, WWW.
[34] Samir Khuller,et al. The Budgeted Maximum Coverage Problem , 1999, Inf. Process. Lett..