메뉴 건너뛰기




Volumn 13-17-August-2016, Issue , 2016, Pages 795-804

Robust influence maximization

Author keywords

Influence maximization; Information diffusion; Robust optimization; Social networks

Indexed keywords

DATA MINING; OPTIMIZATION; SOCIAL NETWORKING (ONLINE);

EID: 84984973515     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2939672.2939745     Document Type: Conference Paper
Times cited : (157)

References (28)
  • 3
    • 0141712989 scopus 로고    scopus 로고
    • Robust optimization-methodology and applications
    • A. Ben-Tal and A. Nemirovski. Robust optimization-methodology and applications. Mathematical Programming, 92(3):453-480, 2002.
    • (2002) Mathematical Programming , vol.92 , Issue.3 , pp. 453-480
    • Ben-Tal, A.1    Nemirovski, A.2
  • 5
    • 79952624396 scopus 로고    scopus 로고
    • Pure exploration in finitely-armed and continuous-armed bandits
    • S. Bubeck, R. Munos, and G. Stoltz. Pure exploration in finitely-armed and continuous-armed bandits. Theoretical Computer Science, 412:1832-1852, 2011.
    • (2011) Theoretical Computer Science , vol.412 , pp. 1832-1852
    • Bubeck, S.1    Munos, R.2    Stoltz, G.3
  • 6
    • 80052722917 scopus 로고    scopus 로고
    • Limiting the spread of misinformation in social networks
    • C. Budak, D. Agrawal, and A. El Abbadi. Limiting the spread of misinformation in social networks. In WWW 2011.
    • (2011) WWW
    • Budak, C.1    Agrawal, D.2    El Abbadi, A.3
  • 7
    • 84937870894 scopus 로고    scopus 로고
    • Combinatorial pure exploration of multi-armed bandits
    • S. Chen, T. Lin, I. King, M. R. Lyu, and W. Chen. Combinatorial pure exploration of multi-armed bandits. In NIPS 2014.
    • (2014) NIPS
    • Chen, S.1    Lin, T.2    King, I.3    Lyu, M.R.4    Chen, W.5
  • 10
    • 77956192689 scopus 로고    scopus 로고
    • Scalable inuence maximization for prevalent viral marketing in large-scale social networks
    • W. Chen, C. Wang, and Y. Wang. Scalable inuence maximization for prevalent viral marketing in large-scale social networks. In KDD 2010.
    • (2010) KDD
    • Chen, W.1    Wang, C.2    Wang, Y.3
  • 11
    • 70350643635 scopus 로고    scopus 로고
    • Effcient inuence maximization in social networks
    • W. Chen, Y. Wang, and S. Yang. Effcient inuence maximization in social networks. In KDD 2009.
    • (2009) KDD
    • Chen, W.1    Wang, Y.2    Yang, S.3
  • 13
    • 0035789667 scopus 로고    scopus 로고
    • Mining the network value of customers
    • P. Domingos and M. Richardson. Mining the network value of customers. In KDD 2001.
    • (2001) KDD
    • Domingos, P.1    Richardson, M.2
  • 14
    • 0032108328 scopus 로고    scopus 로고
    • A threshold of ln n for approximating set cover
    • U. Feige. A threshold of ln n for approximating set cover. Journal of the ACM (JACM), 45(4):634-652, 1998.
    • (1998) Journal of the ACM (JACM) , vol.45 , Issue.4 , pp. 634-652
    • Feige, U.1
  • 15
    • 77950933438 scopus 로고    scopus 로고
    • Learning inuence probabilities in social networks
    • A. Goyal, F. Bonchi, and L. V. Lakshmanan. Learning inuence probabilities in social networks. In WSDM 2010.
    • (2010) WSDM
    • Goyal, A.1    Bonchi, F.2    Lakshmanan, L.V.3
  • 16
    • 79955154683 scopus 로고    scopus 로고
    • Celf++: Optimizing the greedy algorithm for inuence maximization in social networks
    • A. Goyal, W. Lu, and L. V. Lakshmanan. Celf++: optimizing the greedy algorithm for inuence maximization in social networks. In WWW 2011.
    • (2011) WWW
    • Goyal, A.1    Lu, W.2    Lakshmanan, L.V.3
  • 17
    • 84985016388 scopus 로고    scopus 로고
    • Robust inuence maximization
    • X. He and D. Kempe. Robust inuence maximization. In KDD 2016.
    • (2016) KDD
    • He, X.1    Kempe, D.2
  • 19
    • 33747172362 scopus 로고    scopus 로고
    • Maximizing the spread of inuence through a social network
    • D. Kempe, J. Kleinberg, and e. Tardos. Maximizing the spread of inuence through a social network. In KDD 2003.
    • (2003) KDD
    • Kempe, D.1    Kleinberg, J.2    Tardos, E.3
  • 20
    • 58149308162 scopus 로고    scopus 로고
    • Robust submodular observation selection
    • A. Krause, H. B. McMahon, C. Guestrin, and A. Gupta. Robust submodular observation selection. JMLR, 9:2761-2801, 2008.
    • (2008) JMLR , vol.9 , pp. 2761-2801
    • Krause, A.1    McMahon, H.B.2    Guestrin, C.3    Gupta, A.4
  • 23
    • 85006773355 scopus 로고    scopus 로고
    • From competition to complementarity: Comparative inuence diffusion and maximization
    • W. Lu, W. Chen, and L. V. Lakshmanan. From competition to complementarity: comparative inuence diffusion and maximization. In VLDB 2015.
    • (2015) VLDB
    • Lu, W.1    Chen, W.2    Lakshmanan, L.V.3
  • 24
    • 84919819150 scopus 로고    scopus 로고
    • Learning the graph of epidemic cascades
    • P. Netrapalli and S. Sanghavi. Learning the graph of epidemic cascades. In SIGMETRICS 2012.
    • (2012) SIGMETRICS
    • Netrapalli, P.1    Sanghavi, S.2
  • 25
    • 80053444447 scopus 로고    scopus 로고
    • Uncovering the temporal dynamics of diffusion networks
    • M. G. Rodriguez, D. Balduzzi, and B. Scholkopf. Uncovering the temporal dynamics of diffusion networks. In ICML 2011.
    • (2011) ICML
    • Rodriguez, M.G.1    Balduzzi, D.2    Scholkopf, B.3
  • 27
    • 70350639694 scopus 로고    scopus 로고
    • Social inuence analysis in large-scale networks
    • J. Tang, J. Sun, C. Wang, and Z. Yang. Social inuence analysis in large-scale networks. In KDD 2009.
    • (2009) KDD
    • Tang, J.1    Sun, J.2    Wang, C.3    Yang, Z.4
  • 28
    • 84904282615 scopus 로고    scopus 로고
    • Inuence maximization: Near-optimal time complexity meets practical Effciency
    • Y. Tang, X. Xiao, and Y. Shi. Inuence maximization: near-optimal time complexity meets practical Effciency. In SIGMOD 2014.
    • (2014) SIGMOD
    • Tang, Y.1    Xiao, X.2    Shi, Y.3


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