메뉴 건너뛰기




Volumn , Issue , 2013, Pages 199-208

Personalized influence maximization on social networks

Author keywords

Influence maximization; Personalization; Social networks

Indexed keywords

APPROXIMATE ALGORITHMS; INFLUENCE MAXIMIZATIONS; INFLUENTIAL NODES; NETWORK INFLUENCES; OBJECTIVE FUNCTIONS; ON-LINE SOCIAL NETWORKS; PERSONALIZATIONS; PERSONALIZED SERVICE;

EID: 84889568232     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2505515.2505571     Document Type: Conference Paper
Times cited : (91)

References (30)
  • 1
    • 33747172362 scopus 로고    scopus 로고
    • Maximizing the spread of influence through a social network
    • David Kempe, Jon Kleinberg, and Eva Tardos. Maximizing the spread of influence through a social network. In Proc. of KDD, pages 137-146, 2003.
    • (2003) Proc. of KDD , pp. 137-146
    • Kempe, D.1    Kleinberg, J.2    Tardos, E.3
  • 2
    • 33750374555 scopus 로고    scopus 로고
    • Personalized recommendation driven by information flow
    • Xiaodan Song, Belle L. Tseng, Ching-Yung Lin, and Ming-Ting Sun. Personalized recommendation driven by information flow. In Proc. of SIGIR, pages 509-516, 2006.
    • (2006) Proc. of SIGIR , pp. 509-516
    • Song, X.1    Tseng, B.L.2    Lin, C.-Y.3    Sun, M.-T.4
  • 4
    • 77950897279 scopus 로고    scopus 로고
    • Twitterrank: Finding topic-sensitive influential twitterers
    • Jianshu Weng, Ee-Peng Lim, Jing Jiang, and Qi He. Twitterrank: Finding topic-sensitive influential twitterers. In Proc. of WSDM, pages 261-270, 2010.
    • (2010) Proc. of WSDM , pp. 261-270
    • Weng, J.1    Lim, E.-P.2    Jiang, J.3    He, Q.4
  • 5
    • 79952397059 scopus 로고    scopus 로고
    • Everyone's an influencer: Quantifying influence on twitter
    • Eytan Bakshy, Winter A. Mason, Jake M. Hofman, and Duncan J. Watts. Everyone's an influencer: Quantifying influence on twitter. In Proc. of WSDM, pages 65-74, 2011.
    • (2011) Proc. of WSDM , pp. 65-74
    • Bakshy, E.1    Mason, W.A.2    Hofman, J.M.3    Watts, D.J.4
  • 6
    • 35448960789 scopus 로고    scopus 로고
    • On the submodularity of influence in social networks
    • Elchanan Mossel and Sebastien Roch. On the submodularity of influence in social networks. In Proc. of STOC, pages 128-134, 2007.
    • (2007) Proc. of STOC , pp. 128-134
    • Mossel, E.1    Roch, S.2
  • 7
    • 0035789667 scopus 로고    scopus 로고
    • Mining the network value of customers
    • Domingos Pedro and Richardson Matt. Mining the network value of customers. In Proc. of KDD, pages 57-66, 2001.
    • (2001) Proc. of KDD , pp. 57-66
    • Pedro, D.1    Matt, R.2
  • 8
    • 0242456823 scopus 로고    scopus 로고
    • Mining knowledge-sharing sites for viral marketing
    • Richardson Matthew and Domingos Pedro. Mining knowledge-sharing sites for viral marketing. In Proc. of KDD, pages 61-70, 2002.
    • (2002) Proc. of KDD , pp. 61-70
    • Matthew, R.1    Pedro, D.2
  • 9
    • 33750335820 scopus 로고    scopus 로고
    • Tractable models for information diffusion in social networks
    • Masahiro Kimura and Kazumi Saito. Tractable models for information diffusion in social networks. In Proc. of PKDD, pages 259-271, 2006.
    • (2006) Proc. of PKDD , pp. 259-271
    • Kimura, M.1    Saito, K.2
  • 10
    • 36348950877 scopus 로고    scopus 로고
    • Extracting influential nodes for information diffusion on a social network
    • Masahiro Kimura, Kazumi Saito, and Ryohei Nakano. Extracting influential nodes for information diffusion on a social network. In Proc. of AAAI, pages 1371-1376, 2007.
    • (2007) Proc. of AAAI , pp. 1371-1376
    • Kimura, M.1    Saito, K.2    Nakano, R.3
  • 11
    • 70350643635 scopus 로고    scopus 로고
    • Efficient influence maximization in social networks
    • Wei Chen, Yajun Wang, and Siyu Yang. Efficient influence maximization in social networks. In Proc. of KDD, pages 199-208, 2009.
    • (2009) Proc. of KDD , pp. 199-208
    • Chen, W.1    Wang, Y.2    Yang, S.3
  • 12
    • 77956196510 scopus 로고    scopus 로고
    • Community-based greedy algorithm for mining top-k influential nodes in mobile social networks
    • Yu Wang, Gao Cong, Guojie Song, and Kunqing Xie. Community-based greedy algorithm for mining top-k influential nodes in mobile social networks. In Proc. of KDD, pages 1039-1048, 2010.
    • (2010) Proc. of KDD , pp. 1039-1048
    • Wang, Y.1    Cong, G.2    Song, G.3    Xie, K.4
  • 13
    • 77956192689 scopus 로고    scopus 로고
    • Scalable influence maximization for prevalent viral marketing in large-scale social networks
    • Wei Chen, Chi Wang, and Yajun Wang. Scalable influence maximization for prevalent viral marketing in large-scale social networks. In Proc. of KDD, pages 1029-1038, 2010.
    • (2010) Proc. of KDD , pp. 1029-1038
    • Chen, W.1    Wang, C.2    Wang, Y.3
  • 14
    • 79951737128 scopus 로고    scopus 로고
    • Scalable influence maximization in social networks under the linear threshold model
    • Wei Chen, Yifei Yuan, and Li Zhang. Scalable influence maximization in social networks under the linear threshold model. In Proc. of ICDM, pages 88-97, 2010.
    • (2010) Proc. of ICDM , pp. 88-97
    • Chen, W.1    Yuan, Y.2    Zhang, L.3
  • 15
    • 84857144698 scopus 로고    scopus 로고
    • Simpath: An efficient algorithm for influence maximization under the linear threshold model
    • Amit Goyal, Wei Lu, and Laks V.S Lakshmanan. Simpath: An efficient algorithm for influence maximization under the linear threshold model. In Proc. of ICDM, pages 211-220, 2011.
    • (2011) Proc. of ICDM , pp. 211-220
    • Goyal, A.1    Lu, W.2    Lakshmanan, L.V.S.3
  • 16
    • 79955154683 scopus 로고    scopus 로고
    • Celf++: Optimizing the greedy algorithm for influence maximization in social networks
    • Amit Goyal, Wei Lu, and Laks V.S Lakshmanan. Celf++: Optimizing the greedy algorithm for influence maximization in social networks. In Proc. of WWW, pages 47-48, 2011.
    • (2011) Proc. of WWW , pp. 47-48
    • Goyal, A.1    Lu, W.2    Lakshmanan, L.V.S.3
  • 17
    • 80052722917 scopus 로고    scopus 로고
    • Limiting the spread of misinformation in social networks
    • Ceren Budak, Divyakant Agrawal, and Amr El Abbadi. Limiting the spread of misinformation in social networks. In Proc. of WWW, pages 665-674, 2011.
    • (2011) Proc. of WWW , pp. 665-674
    • Budak, C.1    Agrawal, D.2    Abbadi, A.E.3
  • 18
    • 38449123148 scopus 로고    scopus 로고
    • Competitive influence maximization in social networks
    • Shishir Bharathi, David Kempe, and Mahyar Salek. Competitive influence maximization in social networks. In Proc. of WINE, pages 306-311, 2007.
    • (2007) Proc. of WINE , pp. 306-311
    • Bharathi, S.1    Kempe, D.2    Salek, M.3
  • 19
    • 84858044308 scopus 로고    scopus 로고
    • Maximizing product adoption in social networks
    • Smriti Bhagat, Amit Goyal, and Laks V.S Lakshmanan. Maximizing product adoption in social networks. In Proc. of WSDM, pages 603-612, 2012.
    • (2012) Proc. of WSDM , pp. 603-612
    • Bhagat, S.1    Goyal, A.2    Lakshmanan, L.V.S.3
  • 20
    • 36849059175 scopus 로고    scopus 로고
    • Maximizing influence in a competitive social network: A follower's perspective
    • Tim Carnes, Chandrashekhar Nagarajan, Stefan M. Wild, and Van Zuylen Ankee. Maximizing influence in a competitive social network: A follower's perspective. In Proc. of ICEC, pages 351-360, 2007.
    • (2007) Proc. of ICEC , pp. 351-360
    • Carnes, T.1    Nagarajan, C.2    Wild, S.M.3    Ankee, V.Z.4
  • 22
    • 84889578572 scopus 로고    scopus 로고
    • Clash of the contagions: Cooperation and competition in information diffusion
    • Seth A. Myers and Jure Leskovec. Clash of the contagions: Cooperation and competition in information diffusion. In Proc. of ICDM.
    • Proc. of ICDM
    • Myers, S.A.1    Leskovec, J.2
  • 23
    • 84874262794 scopus 로고    scopus 로고
    • Learning to discover social circles in ego networks
    • Julian McAuley and Jure Leskovec. Learning to discover social circles in ego networks. In Proc.c of NIPS.
    • Proc.c of NIPS
    • McAuley, J.1    Leskovec, J.2
  • 24
    • 84889585704 scopus 로고    scopus 로고
    • Information diffusion and external influence in networks
    • Seth A. Myers, Chenguang Zhu, and Jure Leskovec. Information diffusion and external influence in networks. In Proc.c of KDD.
    • Proc.c of KDD
    • Myers, S.A.1    Zhu, C.2    Leskovec, J.3
  • 26
    • 84874073436 scopus 로고    scopus 로고
    • Topic-aware social influence propagation models
    • Nicola Barbieri, Francesco Bonchi, and Giuseppe Manco. Topic-aware social influence propagation models. In Proc. of ICDM, pages 81-90, 2012.
    • (2012) Proc. of ICDM , pp. 81-90
    • Barbieri, N.1    Bonchi, F.2    Manco, G.3
  • 28
    • 0000095809 scopus 로고
    • An analysis of the approximations for maximizing submodular set functions
    • G.L. Nemhauser, L.A. Wolsey, and M.L. Fisher. An analysis of the approximations for maximizing submodular set functions. Mathematical Programming, pages 265-294, 1978.
    • (1978) Mathematical Programming , pp. 265-294
    • Nemhauser, G.L.1    Wolsey, L.A.2    Fisher, M.L.3
  • 29
    • 33745770240 scopus 로고    scopus 로고
    • Patterns of influence in a recommendation network
    • Jure Leskovec, Ajit Singh, and Jon Kleinberg. Patterns of influence in a recommendation network. In Proc. of PAKDD, pages 380-389, 2006.
    • (2006) Proc. of PAKDD , pp. 380-389
    • Leskovec, J.1    Singh, A.2    Kleinberg, J.3
  • 30
    • 84889567014 scopus 로고    scopus 로고
    • http://snap.stanford.edu/data/index.html.


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