메뉴 건너뛰기




Volumn , Issue , 2013, Pages 509-518

StaticGreedy: Solving the scalability-accuracy dilemma in influence maximization

Author keywords

Greedy algorithm; Influence maximization; Scalability; Social networks; Viral marketing

Indexed keywords

COMPUTATIONAL EXPENSE; GREEDY ALGORITHMS; HIGH SCALABILITIES; INFLUENCE MAXIMIZATIONS; OBJECTIVE FUNCTIONS; ORDERS OF MAGNITUDE; SPREAD FUNCTIONS; VIRAL MARKETING;

EID: 84889574435     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2505515.2505541     Document Type: Conference Paper
Times cited : (202)

References (29)
  • 1
    • 84885066266 scopus 로고    scopus 로고
    • Popularity prediction in microblogging network: A case study on sina weibo
    • ACM
    • P. Bao, H.-W. Shen, J. Huang, and X.-Q. Cheng. Popularity prediction in microblogging network: a case study on sina weibo. In WWW'13, pages 177-178, ACM, 2013.
    • (2013) WWW'13 , pp. 177-178
    • Bao, P.1    Shen, H.-W.2    Huang, J.3    Cheng, X.-Q.4
  • 2
    • 38449123148 scopus 로고    scopus 로고
    • Competitive influence maximization in social networks
    • Springer
    • S. Bharathi, D. Kempe, and M. Salek. Competitive influence maximization in social networks. In WINE'07, pages 306-311, Springer, 2007.
    • (2007) WINE'07 , pp. 306-311
    • Bharathi, S.1    Kempe, D.2    Salek, M.3
  • 3
    • 80052722917 scopus 로고    scopus 로고
    • Limiting the spread of misinformation in social networks
    • ACM
    • C. Budak, D. Agrawal, and A. El Abbadi. Limiting the spread of misinformation in social networks. In WWW'11, pages 665-674, ACM, 2011.
    • (2011) WWW'11 , pp. 665-674
    • Budak, C.1    Agrawal, D.2    El Abbadi, A.3
  • 4
    • 36849059175 scopus 로고    scopus 로고
    • Maximizing influence in a competitive social network: A follower's perspective
    • ACM
    • T. Carnes, C. Nagarajan, S. M. Wild, and A. van Zuylen. Maximizing influence in a competitive social network: a follower's perspective. In ICEC'07, pages 351-360, ACM, 2007.
    • (2007) ICEC'07 , pp. 351-360
    • Carnes, T.1    Nagarajan, C.2    Wild, S.M.3    Van Zuylen, A.4
  • 5
    • 77956192689 scopus 로고    scopus 로고
    • Scalable influence maximization for prevalent viral marketing in large-scale social networks
    • ACM
    • W. Chen, C. Wang, and Y. Wang. Scalable influence maximization for prevalent viral marketing in large-scale social networks. In KDD'10, pages 1029-1038, ACM, 2010.
    • (2010) KDD'10 , pp. 1029-1038
    • Chen, W.1    Wang, C.2    Wang, Y.3
  • 6
    • 70350643635 scopus 로고    scopus 로고
    • Efficient influence maximization in social networks
    • W. Chen, Y. Wang, and S. Yang. Efficient influence maximization in social networks. In KDD'09, pages 199-208, 2009.
    • (2009) KDD'09 , pp. 199-208
    • Chen, W.1    Wang, Y.2    Yang, S.3
  • 7
    • 79951737128 scopus 로고    scopus 로고
    • Scalable influence maximization in social networks under the linear threshold model
    • W. Chen, Y. Yuan, and L. Zhang. Scalable influence maximization in social networks under the linear threshold model. In ICDM'10, pages 88-97, 2010.
    • (2010) ICDM'10 , pp. 88-97
    • Chen, W.1    Yuan, Y.2    Zhang, L.3
  • 8
    • 0035789667 scopus 로고    scopus 로고
    • Mining the network value of customers
    • ACM
    • P. Domingos and M. Richardson. Mining the network value of customers. In KDD'01, pages 57-66, ACM, 2001.
    • (2001) KDD'01 , pp. 57-66
    • Domingos, P.1    Richardson, M.2
  • 9
    • 79955154683 scopus 로고    scopus 로고
    • Celf++: Optimizing the greedy algorithm for influence maximization in social networks
    • ACM
    • A. Goyal, W. Lu, and L. V. Lakshmanan. Celf++: optimizing the greedy algorithm for influence maximization in social networks. In WWW'11, pages 47-48, ACM, 2011.
    • (2011) WWW'11 , pp. 47-48
    • Goyal, A.1    Lu, W.2    Lakshmanan, L.V.3
  • 10
    • 84880198866 scopus 로고    scopus 로고
    • Influence blocking maximization in social networks under the competitive linear threshold model
    • SIAM / Omnipress
    • X. He, G. Song, W. Chen, and Q. Jiang. Influence blocking maximization in social networks under the competitive linear threshold model. In SDM'12, pages 463-474. SIAM / Omnipress, 2012.
    • (2012) SDM'12 , pp. 463-474
    • He, X.1    Song, G.2    Chen, W.3    Jiang, Q.4
  • 11
    • 77956038675 scopus 로고    scopus 로고
    • Social recommendation with interpersonal influence
    • IOS Press
    • J. Huang, X.-Q. Cheng, J. Guo, H.-W. Shen, and K. Yang. Social recommendation with interpersonal influence. In ECAI'10, pages 601-606, IOS Press, 2010.
    • (2010) ECAI'10 , pp. 601-606
    • Huang, J.1    Cheng, X.-Q.2    Guo, J.3    Shen, H.-W.4    Yang, K.5
  • 12
    • 84863230067 scopus 로고    scopus 로고
    • Exploring social influence via posterior effect of word-of-mouth recommendations
    • ACM
    • J. Huang, X.-Q. Cheng, H.-W. Shen, T. Zhou, and X. Jin. Exploring social influence via posterior effect of word-of-mouth recommendations. In WSDM'12, pages 573-582, ACM, 2012.
    • (2012) WSDM'12 , pp. 573-582
    • Huang, J.1    Cheng, X.-Q.2    Shen, H.-W.3    Zhou, T.4    Jin, X.5
  • 13
    • 80055036647 scopus 로고    scopus 로고
    • Simulated annealing based influence maximization in social networks
    • Association for the Advancement of Artificial Intelligence
    • Q. Jiang, G. Song, C. Gao, Y. Wang, W. Si, and K. Xie. Simulated annealing based influence maximization in social networks. In AAAI'11, pages 127-132, Association for the Advancement of Artificial Intelligence, 2011.
    • (2011) AAAI'11 , pp. 127-132
    • Jiang, Q.1    Song, G.2    Gao, C.3    Wang, Y.4    Si, W.5    Xie, K.6
  • 14
    • 33747172362 scopus 로고    scopus 로고
    • Maximizing the spread of influence through a social network
    • ACM
    • D. Kempe, J. Kleinberg, and E. Tardos. Maximizing the spread of influence through a social network. In KDD'03, pages 137-146, ACM, 2003.
    • (2003) KDD'03 , pp. 137-146
    • Kempe, D.1    Kleinberg, J.2    Tardos, E.3
  • 15
    • 33750335820 scopus 로고    scopus 로고
    • Tractable models for information diffusion in social networks
    • Springer-Verlag
    • M. Kimura and K. Saito. Tractable models for information diffusion in social networks. In PKDD'06, pages 259-271, Springer-Verlag, 2006.
    • (2006) PKDD'06 , pp. 259-271
    • Kimura, M.1    Saito, K.2
  • 16
    • 76749098758 scopus 로고    scopus 로고
    • Extracting influential nodes on a social network for information diffusion
    • M. Kimura, K. Saito, R. Nakano, and H. Motoda. Extracting influential nodes on a social network for information diffusion. Data Mining and Knowledge Discovery, 20(1):70-97, 2010.
    • (2010) Data Mining and Knowledge Discovery , vol.20 , Issue.1 , pp. 70-97
    • Kimura, M.1    Saito, K.2    Nakano, R.3    Motoda, H.4
  • 18
    • 84871042217 scopus 로고    scopus 로고
    • Mining topic-level opinion influence in microblog
    • ACM
    • D. Li, X. Shuai, G. Sun, J. Tang, Y. Ding, and Z. Luo. Mining topic-level opinion influence in microblog. In CIKM'12, pages 1562-1566. ACM, 2012.
    • (2012) CIKM'12 , pp. 1562-1566
    • Li, D.1    Shuai, X.2    Sun, G.3    Tang, J.4    Ding, Y.5    Luo, Z.6
  • 19
    • 84865620133 scopus 로고    scopus 로고
    • A pagerank-based heuristic algorithm for influence maximization in the social network
    • Z.-L. Luo, W.-D. Cai, Y.-J. Li, and D. Peng. A pagerank-based heuristic algorithm for influence maximization in the social network. LNEE, 157:485-490, 2012.
    • (2012) LNEE , vol.157 , pp. 485-490
    • Luo, Z.-L.1    Cai, W.-D.2    Li, Y.-J.3    Peng, D.4
  • 21
    • 35448960789 scopus 로고    scopus 로고
    • On the submodularity of influence in social networks
    • ACM
    • E. Mossel and S. Roch. On the submodularity of influence in social networks. In STOC'07, pages 128-134. ACM, 2007.
    • (2007) STOC'07 , pp. 128-134
    • Mossel, E.1    Roch, S.2
  • 23
    • 0000095809 scopus 로고
    • An analysis of approximations for maximizing submodular set functions
    • G. L. Nemhauser, L. A. Wolsey, and M. L. Fisher. An analysis of approximations for maximizing submodular set functions. Mathematical Programming, 14:265-294, 1978.
    • (1978) Mathematical Programming , vol.14 , pp. 265-294
    • Nemhauser, G.L.1    Wolsey, L.A.2    Fisher, M.L.3
  • 24
    • 0242456823 scopus 로고    scopus 로고
    • Mining knowledge-sharing sites for viral marketing
    • ACM
    • M. Richardson and P. Domingos. Mining knowledge-sharing sites for viral marketing. In KDD'02, pages 61-70, ACM, 2002.
    • (2002) KDD'02 , pp. 61-70
    • Richardson, M.1    Domingos, P.2
  • 25
    • 84871039983 scopus 로고    scopus 로고
    • Influence propagation in adversarial setting: How to defeat competition with least amount of investment
    • ACM
    • S. Shirazipourazad, B. Bogard, H. Vachhani, A. Sen, and P. Horn. Influence propagation in adversarial setting: how to defeat competition with least amount of investment. In CIKM'12, pages 585-594. ACM, 2012.
    • (2012) CIKM'12 , pp. 585-594
    • Shirazipourazad, S.1    Bogard, B.2    Vachhani, H.3    Sen, A.4    Horn, P.5
  • 26
    • 78651320806 scopus 로고    scopus 로고
    • A study of rumor control strategies on social networks
    • ACM
    • R. M. Tripathy, A. Bagchi, and S. Mehta. A study of rumor control strategies on social networks. In CIKM'10, pages 1817-1820. ACM, 2010.
    • (2010) CIKM'10 , pp. 1817-1820
    • Tripathy, R.M.1    Bagchi, A.2    Mehta, S.3
  • 27
    • 84865609190 scopus 로고    scopus 로고
    • Scalable influence maximization for independent cascade model in large-scale social networks
    • C. Wang, W. Chen, and Y. Wang. Scalable influence maximization for independent cascade model in large-scale social networks. Data Mining and Knowledge Discovery, 25(3):545-576, 2012.
    • (2012) Data Mining and Knowledge Discovery , vol.25 , Issue.3 , pp. 545-576
    • Wang, C.1    Chen, W.2    Wang, Y.3
  • 28
    • 77956196510 scopus 로고    scopus 로고
    • Community-based greedy algorithm for mining top-k influential nodes in mobile social networks
    • ACM
    • Y. Wang, G. Cong, G. Song, and K. Xie. Community-based greedy algorithm for mining top-k influential nodes in mobile social networks. In KDD'10, pages 1039-1048, ACM, 2010.
    • (2010) KDD'10 , pp. 1039-1048
    • Wang, Y.1    Cong, G.2    Song, G.3    Xie, K.4
  • 29
    • 84866612153 scopus 로고    scopus 로고
    • Exploring social influence for recommendation: A generative model approach
    • ACM
    • M. Ye, X. Liu, and W.-C. Lee. Exploring social influence for recommendation: a generative model approach. In SIGIR'12, pages 671-680. ACM, 2012.
    • (2012) SIGIR'12 , pp. 671-680
    • Ye, M.1    Liu, X.2    Lee, W.-C.3


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.