메뉴 건너뛰기




Volumn , Issue , 2014, Pages 75-86

Influence maximization: Near-optimal time complexity meets practical efficiency

Author keywords

Algorithms; Experimentation; Theory

Indexed keywords

ALGORITHMS; COMMERCE; DATA PROCESSING; EFFICIENCY;

EID: 84904282615     PISSN: 07308078     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2588555.2593670     Document Type: Conference Paper
Times cited : (856)

References (25)
  • 1
    • 84904319248 scopus 로고    scopus 로고
    • http://arxiv.org/abs/1404.0900.
  • 2
    • 84904298038 scopus 로고    scopus 로고
    • http://an.kaist.ac.kr/traces/WWW2010.html.
  • 3
    • 38449123148 scopus 로고    scopus 로고
    • Competitive influence maximization in social networks
    • S. Bharathi, D. Kempe, and M. Salek. Competitive influence maximization in social networks. In WINE, pages 306-311, 2007.
    • (2007) WINE , pp. 306-311
    • Bharathi, S.1    Kempe, D.2    Salek, M.3
  • 4
    • 84902108772 scopus 로고    scopus 로고
    • Maximizing social influence in nearly optimal time
    • C. Borgs, M. Brautbar, J. Chayes, and B. Lucier. Maximizing social influence in nearly optimal time. In SODA, pages 946-957, 2014.
    • SODA , vol.2014 , pp. 946-957
    • Borgs, C.1    Brautbar, M.2    Chayes, J.3    Lucier, B.4
  • 5
    • 84894649182 scopus 로고    scopus 로고
    • Time-critical influence maximization in social networks with time-delayed diffusion process
    • W. Chen, W. Lu, and N. Zhang. Time-critical influence maximization in social networks with time-delayed diffusion process. In AAAI, 2012.
    • (2012) AAAI
    • Chen, W.1    Lu, W.2    Zhang, N.3
  • 6
    • 77956192689 scopus 로고    scopus 로고
    • Scalable influence maximization for prevalent viral marketing in large-scale social networks
    • W. Chen, C. Wang, and Y. Wang. Scalable influence maximization for prevalent viral marketing in large-scale social networks. In KDD, pages 1029-1038, 2010.
    • (2010) KDD , pp. 1029-1038
    • Chen, W.1    Wang, C.2    Wang, Y.3
  • 7
    • 70350643635 scopus 로고    scopus 로고
    • Efficient influence maximization in social networks
    • W. Chen, Y. Wang, and S. Yang. Efficient influence maximization in social networks. In KDD, pages 199-208, 2009.
    • (2009) KDD , pp. 199-208
    • Chen, W.1    Wang, Y.2    Yang, S.3
  • 8
    • 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, pages 88-97, 2010.
    • (2010) ICDM , pp. 88-97
    • Chen, W.1    Yuan, Y.2    Zhang, L.3
  • 9
    • 0035789667 scopus 로고    scopus 로고
    • Mining the network value of customers
    • P. Domingos and M. Richardson. Mining the network value of customers. In KDD, pages 57-66, 2001.
    • (2001) KDD , pp. 57-66
    • Domingos, P.1    Richardson, M.2
  • 10
    • 77950933438 scopus 로고    scopus 로고
    • Learning influence probabilities in social networks
    • A. Goyal, F. Bonchi, and L. V. S. Lakshmanan. Learning influence probabilities in social networks. In WSDM, pages 241-250, 2010.
    • (2010) WSDM , pp. 241-250
    • Goyal, A.1    Bonchi, F.2    Lakshmanan, L.V.S.3
  • 11
    • 84858020035 scopus 로고    scopus 로고
    • A data-based approach to social influence maximization
    • A. Goyal, F. Bonchi, and L. V. S. Lakshmanan. A data-based approach to social influence maximization. PVLDB, 5(1):73-84, 2011.
    • (2011) PVLDB , vol.5 , Issue.1 , pp. 73-84
    • Goyal, A.1    Bonchi, F.2    Lakshmanan, L.V.S.3
  • 12
    • 79955154683 scopus 로고    scopus 로고
    • Celf++: Optimizing the greedy algorithm for influence maximization in social networks
    • A. Goyal, W. Lu, and L. V. S. Lakshmanan. Celf++: optimizing the greedy algorithm for influence maximization in social networks. In WWW, pages 47-48, 2011.
    • (2011) WWW , pp. 47-48
    • Goyal, A.1    Lu, W.2    Lakshmanan, L.V.S.3
  • 13
    • 84857144698 scopus 로고    scopus 로고
    • Simpath: An efficient algorithm for influence maximization under the linear threshold model
    • A. Goyal, W. Lu, and L. V. S. Lakshmanan. Simpath: An efficient algorithm for influence maximization under the linear threshold model. In ICDM, pages 211-220, 2011.
    • (2011) ICDM , pp. 211-220
    • Goyal, A.1    Lu, W.2    Lakshmanan, L.V.S.3
  • 14
    • 0000934061 scopus 로고
    • Threshold models of collective behavior
    • M. Granovetter. Threshold models of collective behavior. American Journal of Sociology, 83(6):1420-1443, 1978.
    • (1978) American Journal of Sociology , vol.83 , Issue.6 , pp. 1420-1443
    • Granovetter, M.1
  • 15
    • 0010087219 scopus 로고    scopus 로고
    • Talk of the network: A complex systems look at the underlying process of word-of-mouth
    • E. M. J. Goldenberg, B. Libai. Talk of the network: A complex systems look at the underlying process of word-of-mouth. Marketing Letters, 12(3):211-223, 2001.
    • (2001) Marketing Letters , vol.12 , Issue.3 , pp. 211-223
    • Goldenberg, E.M.J.1    Libai, B.2
  • 16
    • 26444591202 scopus 로고    scopus 로고
    • Using complex systems analysis to advance marketing theory development
    • E. M. J. Goldenberg, B. Libai. Using complex systems analysis to advance marketing theory development. American Journal of Sociology, 9:1, 2001.
    • (2001) American Journal of Sociology , vol.9 , pp. 1
    • Goldenberg, E.M.J.1    Libai, B.2
  • 17
    • 84874023094 scopus 로고    scopus 로고
    • Irie: Scalable and robust influence maximization in social networks
    • K. Jung, W. Heo, and W. Chen. Irie: Scalable and robust influence maximization in social networks. In ICDM, pages 918-923, 2012.
    • (2012) ICDM , pp. 918-923
    • Jung, K.1    Heo, W.2    Chen, W.3
  • 18
    • 33747172362 scopus 로고    scopus 로고
    • Maximizing the spread of influence through a social network
    • D. Kempe, J. M. Kleinberg, and É. Tardos. Maximizing the spread of influence through a social network. In KDD, pages 137-146, 2003.
    • (2003) KDD , pp. 137-146
    • Kempe, D.1    Kleinberg, J.M.2    Tardos, E.3
  • 19
    • 26444526647 scopus 로고    scopus 로고
    • Influential nodes in a diffusion model for social networks
    • D. Kempe, J. M. Kleinberg, and É. Tardos. Influential nodes in a diffusion model for social networks. In ICALP, pages 1127-1138, 2005.
    • (2005) ICALP , pp. 1127-1138
    • Kempe, D.1    Kleinberg, J.M.2    Tardos, E.3
  • 20
    • 84881351873 scopus 로고    scopus 로고
    • Scalable and parallelizable processing of influence maximization for large-scale social networks
    • J. Kim, S.-K. Kim, and H. Yu. Scalable and parallelizable processing of influence maximization for large-scale social networks. In ICDE, pages 266-277, 2013.
    • (2013) ICDE , pp. 266-277
    • Kim, J.1    Kim, S.-K.2    Yu, H.3
  • 21
    • 84906956789 scopus 로고    scopus 로고
    • Strip: Stream learning of influence probabilities
    • K. Kutzkov, A. Bifet, F. Bonchi, and A. Gionis. Strip: stream learning of influence probabilities. In KDD, pages 275-283, 2013.
    • KDD , vol.2013 , pp. 275-283
    • Kutzkov, K.1    Bifet, A.2    Bonchi, F.3    Gionis, A.4
  • 23
    • 84874263116 scopus 로고    scopus 로고
    • Influence diffusion dynamics and influence maximization in social networks with friend and foe relationships
    • Y. Li, W. Chen, Y. Wang, and Z.-L. Zhang. Influence diffusion dynamics and influence maximization in social networks with friend and foe relationships. In WSDM, pages 657-666, 2013.
    • WSDM , vol.2013 , pp. 657-666
    • Li, Y.1    Chen, W.2    Wang, Y.3    Zhang, Z.-L.4
  • 24
    • 85025599759 scopus 로고    scopus 로고
    • The bang for the buck: Fair competitive viral marketing from the host perspective
    • W. Lu, F. Bonchi, A. Goyal, and L. V. S. Lakshmanan. The bang for the buck: fair competitive viral marketing from the host perspective. In KDD, pages 928-936, 2013.
    • KDD , vol.2013 , pp. 928-936
    • Lu, W.1    Bonchi, F.2    Goyal, A.3    Lakshmanan, L.V.S.4


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