TwitterRank

Published 4 February 2010Open access

Jianshu Weng, Ee‐Peng Lim, Jing Jiang, Qi He

Citations1,734

TL;DR

Experimental results show that TwitterRank outperforms the one Twitter currently uses and other related algorithms, including the original PageRank and Topic-sensitive PageRank, which is proposed to measure the influence of users in Twitter.

Abstract

This paper focuses on the problem of identifying influential users of micro-blogging services. Twitter, one of the most notable micro-blogging services, employs a social-networking model called "following", in which each user can choose who she wants to "follow" to receive tweets from without requiring the latter to give permission first. In a dataset prepared for this study, it is observed that (1) 72.4% of the users in Twitter follow more than 80% of their followers, and (2) 80.5% of the users have 80% of users they are following follow them back. Our study reveals that the presence of "reciprocity" can be explained by phenomenon of homophily. Based on this finding, TwitterRank, an extension of PageRank algorithm, is proposed to measure the influence of users in Twitter. TwitterRank measures the influence taking both the topical similarity between users and the link structure into account. Experimental results show that TwitterRank outperforms the one Twitter currently uses and other related algorithms, including the original PageRank and Topic-sensitive PageRank.

Keywords

Computer SciencePhysics and Astronomy

Journal of Machine Learning ResearchLatent dirichlet allocation

27,049 Citations2003David M. Blei, Andrew Y. Ng +1 more

Annual Review of SociologyBirds of a Feather: Homophily in Social Networks

18,576 Citations2001Miller McPherson, Lynn Smith‐Lovin +1 more

Computer Networks and ISDN SystemsThe anatomy of a large-scale hypertextual Web search engine

15,828 Citations1998Sergey Brin, Lawrence M. Page

This paper provides an in-depth description of Google, a prototype of a large-scale search engine which makes heavy use of the structure present in hypertext and looks at the problem of how to effectively deal with uncontrolled hypertext collections where anyone can publish anything they want.

Journal of the ACMAuthoritative sources in a hyperlinked environment

9,060 Citations1999Jon Kleinberg

This work proposes and test an algorithmic formulation of the notion of authority, based on the relationship between a set of relevant authoritative pages and the set of “hub pages” that join them together in the link structure, and has connections to the eigenvectors of certain matrices associated with the link graph.

View PDF

Maximizing the spread of influence through a social network

7,314 Citations2003David Kempe, Jon Kleinberg +1 more

An analysis framework based on submodular functions shows that a natural greedy strategy obtains a solution that is provably within 63% of optimal for several classes of models, and suggests a general approach for reasoning about the performance guarantees of algorithms for these types of influence problems in social networks.

Proceedings of the National Academy of SciencesFinding scientific topics

6,017 Citations2004Thomas L. Griffiths, Mark Steyvers

A generative model for documents is described, introduced by Blei, Ng, and Jordan, and a Markov chain Monte Carlo algorithm is presented for inference in this model, which is used to analyze abstracts from PNAS by using Bayesian model selection to establish the number of topics.

View PDF

BiometrikaA NEW MEASURE OF RANK CORRELATION

5,792 Citations1938M. G. Kendall

Why we twitter

2,639 Citations2007Akshay Java, Xiaodan Song +2 more

It is found that people use microblogging to talk about their daily activities and to seek or share information and the user intentions associated at a community level are analyzed to show how users with similar intentions connect with each other.

Topic-sensitive PageRank

1,524 Citations2002Taher H. Haveliwala

A set of PageRank vectors are proposed, biased using a set of representative topics, to capture more accurately the notion of importance with respect to a particular topic, and are shown to generate more accurate rankings than with a single, generic PageRank vector.

IEEE Transactions on Information TheoryA new metric for probability distributions

1,171 Citations2003Dominik Endres, J.E. Schindelin

A metric for probability distributions is introduced, which is bounded, information-theoretically motivated, and has a natural Bayesian interpretation, and the square root of the well-known /spl chi//sup 2/ distance is an asymptotic approximation.

View PDF