ABSTRACT
The emergence of social media and the enormous growth of social networks have initiated a great amount of research in social influence analysis. In this regard, many approaches take into account only structural information while a few have also incorporated content. In this study we propose a new method to rank users according to their topic-sensitive influence which utilizes a priori information by employing supervised random walks. We explore the use of supervision in a PageRank-like random walk while also exploiting textual information from the available content. We perform a set of experiments on Twitter datasets and evaluate our findings.
- L. Backstrom and J. Leskovec. Supervised Random Walks: Predicting and Recommending Links in Social Networks. Nov. 2010.Google Scholar
- B. Bi, Y. Tian, Y. Sismanis, A. Balmin, and J. Cho. Scalable topic-specific influence analysis on microblogs. In Proceedings of the 7th ACM International Conference on Web Search and Data Mining, WSDM '14, pages 513--522, New York, NY, USA, 2014. ACM. Google ScholarDigital Library
- D. M. Blei, A. Y. Ng, and M. I. Jordan. Latent dirichlet allocation. J. Mach. Learn. Res., 3:993--1022, Mar. 2003. Google ScholarCross Ref
- M. Cha, H. Haddadi, F. Benevenuto, and K. P. Gummadi. Measuring User Influence in Twitter: The Million Follower Fallacy. In Proceedings of the 4th International AAAI Conference on Weblogs and Social Media (ICWSM), May 2010.Google ScholarCross Ref
- R. B. Cialdini and M. R. Trost. Social influence: Social norms, conformity, and compliance, volume 2, pages 151--192. McGraw-Hill., 1998.Google Scholar
- D. Gayo-Avello, D. J. Brenes, D. Fernández-Fernández, M. E. Fernández-Menéndez, and R. Garcıa-Suárez. De retibus socialibus et legibus momenti. CoRR, abs/1012.2057, 2010.Google Scholar
- S. Ghosh, N. K. Sharma, F. Benevenuto, N. Ganguly, and P. K. Gummadi. Cognos: crowdsourcing search for topic experts in microblogs. In W. R. Hersh, J. Callan, Y. Maarek, and M. Sanderson, editors, SIGIR, pages 575--590. ACM, 2012. Google ScholarDigital Library
- T. H. Haveliwala. Topic-sensitive PageRank. In Proceedings of the 11th international conference on World Wide Web, WWW '02, pages 517--526, New York, NY, USA, 2002. ACM. Google ScholarDigital Library
- J. Hu, Y. Fang, and A. Godavarthy. Topical authority propagation on microblogs. In Q. He, A. Iyengar, W. Nejdl, J. Pei, and R. Rastogi, editors, CIKM, pages 1901--1904. ACM, 2013. Google ScholarDigital Library
- G. Kossinets and D. J. Watts. Origins of Homophily in an Evolving Social Network. The American Journal of Sociology, 115(2), 2009.Google ScholarCross Ref
- H. Kwak, C. Lee, H. Park, and S. Moon. What is Twitter, a social network or a news media? In Proceedings of the 19th international conference on World wide web, WWW '10, pages 591--600, New York, NY, USA, 2010. ACM. Google ScholarDigital Library
- C. D. Manning and H. Schütze. Foundations of Statistical Natural Language Processing. The MIT Press, 1 edition, June 1999. Google ScholarDigital Library
- L. Page, S. Brin, R. Motwani, and T. Winograd. The PageRank Citation Ranking: Bringing Order to the Web. Technical report, Stanford Digital Library Technologies Project, 1998.Google Scholar
- A. Pal and S. Counts. Identifying topical authorities in microblogs. In Proceedings of the fourth ACM international conference on Web search and data mining, WSDM '11, pages 45--54, New York, NY, USA, 2011. ACM. Google ScholarDigital Library
- F. Probst, L. Grosswiele, and R. Pfleger. Who will lead and who will follow: Identifying influential users in online social networks. Business and Information Systems Engineering, 5(3):179--193, 2013.Google ScholarCross Ref
- D. M. Romero, W. Galuba, S. Asur, and B. A. Huberman. Influence and Passivity in Social Media. In Proceedings of the 20th international Conference on World wide web, Aug. 2010. Google ScholarDigital Library
- D. Simmie, M. G. Vigliotti, and C. Hankin. Ranking twitter influence by combining network centrality and influence observables in an evolutionary model. Journal of Complex Networks, 2014.Google ScholarCross Ref
- J. Tang, J. Sun, C. Wang, and Z. Yang. Social influence analysis in large-scale networks. In Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining, KDD '09, pages 807--816, New York, NY, USA, 2009. ACM. Google ScholarDigital Library
- D. Tunkelang. http://thenoisychannel.com/2009/01/13/a-twitter-analog-to-pagerank/. Technical report, 2009.Google Scholar
- D. Vogiatzis. Influential users in social networks. In Semantic Hyper/Multimedia Adaptation, pages 271--295. 2013.Google ScholarCross Ref
- J. Weng, E. P. Lim, J. Jiang, and Q. He. TwitterRank: finding topic-sensitive influential twitterers. In Proceedings of the third ACM international conference on Web search and data mining, WSDM '10, pages 261--270, New York, NY, USA, 2010. ACM. Google ScholarDigital Library
Index Terms
Determining Influential Users with Supervised Random Walks
Recommendations
Maximum consistency preferential random walks
ECMLPKDD'12: Proceedings of the 2012th European Conference on Machine Learning and Knowledge Discovery in Databases - Volume Part IIRandom walk plays a significant role in computer science. The popular PageRank algorithm uses random walk. Personalized random walks force random walk to "personalized views" of the graph according to users' preferences. In this paper, we show the close ...
Pseudorandom generators from polarizing random walks
CCC '18: Proceedings of the 33rd Computational Complexity ConferenceWe propose a new framework for constructing pseudorandom generators for n-variate Boolean functions. It is based on two new notions. First, we introduce fractional pseudorandom generators, which are pseudorandom distributions taking values in [-1, 1]n. ...
Speeding up random walks with neighborhood exploration
SODA '10: Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete algorithmsWe consider the following marking process (rw-rand) made by a random walk on an undirected graph G. Upon arrival at a vertex v, it marks v if unmarked and otherwise it marks a randomly chosen unmarked neighbor of v. We also consider a variant of this ...
Comments