Interest-matching information propagation in multiple online social networks

ACM International Conference Proceeding Series

Volumn , Issue , 2012, Pages 1824-1828

  Shen, Yilin ^a   Dinh, Thang N ^a   Zhang, Huiyuan ^a   Thai, My T ^a  

^a University of Florida   (United States)

Author keywords

information propagation; interest prediction; iterative semi supervised learning; multiple online social networks

Indexed keywords

INFORMATION PROPAGATION; LEARNING-BASED APPROACH; MULTIPLE NETWORKS; NETWORK TOPOLOGY; ONLINE SOCIAL NETWORKS; RESEARCH TOPICS; SEMI-SUPERVISED LEARNING;

ELECTRIC NETWORK TOPOLOGY; KNOWLEDGE MANAGEMENT; SUPERVISED LEARNING;

SOCIAL NETWORKING (ONLINE);

EID: 84871091847     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2396761.2398525     Document Type: Conference Paper

References (17)

1. http://developer.klout.com/.
2. http://dev.mendeley.com/.
3. http://www-personal.umich.edu/ mejn/netdata/.
4. O. Ben-Zwi, D. Hermelin, D. Lokshtanov, and I. Newman. An exact almost optimal algorithm for target set selection in social networks. In EC '09, pages 355-362, New York, NY, USA, 2009. ACM.
5. W. Chen, Y. Wang, and S. Yang. Efficient influence maximization in social networks. In KDD '09, pages 199-208, New York, NY, USA, 2009. ACM.
6. P. Domingos and M. Richardson. Mining the network value of customers. In KDD '01, pages 57-66, NY, USA, 2001. ACM.
7. M. Gjoka, M. Kurant, C. T. Butts, and A. Markopoulou. Walking in Facebook: A case study of unbiased sampling of OSNs. In Proceedings of IEEE INFOCOM 2010, pages 1-9. IEEE, Mar. 2010.
8. A. Gliozzo, C. Strapparava, and I. Dagan. Investigating unsupervised learning for text categorization bootstrapping. In Proceedings of HLT '05.
9. D. Kempe, J. Kleinberg, and É. Tardos. Maximizing the spread of influence through a social network. In KDD'03, pages 137-146. ACM, NY, USA, 2003.
10. M. Kimura and K. Saito. Tractable models for information diffusion in social networks. In Principles of Data Mining and Knowledge Discovery, pages 259-271, 2006.
11. H. Kwak, C. Lee, H. Park, and S. Moon. What is Twitter, a social network or a news media? In Proceedings of WWW '10, pages 591-600, New York, NY, USA, 2010. ACM.
12. R. Lempel and S. Moran. Salsa: the stochastic approach for link-structure analysis. ACM Trans. Inf. Syst., 19(2):131-160, 2001.
13. J. Leskovec, A. Krause, C. Guestrin, C. Faloutsos, J. VanBriesen, and N. Glance. Cost-effective outbreak detection in networks. In KDD '07, pages 420-429, New York, NY, USA, 2007. ACM.
14. J. Löfberg. Yalmip : A toolbox for modeling and optimization in MATLAB. In Proceedings of CACSD, Taiwan, 2004.
15. Y. Shen, D. T. Nguyen, and M. T. Thai. On the hardness and inapproximability of optimization problems on power law graphs. In COCOA '09, pages 197-211, Berlin, Heidelberg, 2010. Springer-Verlag.
16. S. Tang, J. Yuan, X. Mao, X.-Y. Li, W. Chen, and G. Dai. Relationship classification in large scale online social networks and its impact on information propagation. In INFOCOM, pages 2291-2299, 2011.
17. J. Yang and J. Leskovec. Patterns of temporal variation in online media. In Proceedings of the fourth ACM international conference on Web search and data mining, WSDM '11, pages 177-186, New York, NY, USA, 2011. ACM.