Results 1  10
of
152
Twitterrank: finding topicsensitive influential twitterers
 IN IN PROCEEDINGS OF THE 3RD INTERNATIONAL CONFERENCE ON WEB SEARCH AND DATA MINING
, 2010
"... This paper focuses on the problem of identifying influential users of microblogging services. Twitter, one of the most notable microblogging services, employs a socialnetworking model called “following”, in which each user can choose who she wants to “follow” to receive tweets from without requir ..."
Abstract

Cited by 285 (12 self)
 Add to MetaCart
(Show Context)
This paper focuses on the problem of identifying influential users of microblogging services. Twitter, one of the most notable microblogging services, employs a socialnetworking 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 [14]. 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
Efficient influence maximization in social networks
 In Proc. of ACM KDD
, 2009
"... Influence maximization is the problem of finding a small subset of nodes (seed nodes) in a social network that could maximize the spread of influence. In this paper, we study the efficient influence maximization from two complementary directions. One is to improve the original greedy algorithm of [5 ..."
Abstract

Cited by 197 (18 self)
 Add to MetaCart
Influence maximization is the problem of finding a small subset of nodes (seed nodes) in a social network that could maximize the spread of influence. In this paper, we study the efficient influence maximization from two complementary directions. One is to improve the original greedy algorithm of [5] and its improvement [7] to further reduce its running time, and the second is to propose new degree discount heuristics that improves influence spread. We evaluate our algorithms by experiments on two large academic collaboration graphs obtained from the online archival database arXiv.org. Our experimental results show that (a) our improved greedy algorithm achieves better running time comparing with the improvement of [7] with matching influence spread, (b) our degree discount heuristics achieve much better influence spread than classic degree and centralitybased heuristics, and when tuned for a specific influence cascade model, it achieves almost matching influence thread with the greedy algorithm, and more importantly (c) the degree discount heuristics run only in milliseconds while even the improved greedy algorithms run in hours in our experiment graphs with a few tens of thousands of nodes. Based on our results, we believe that finetuned heuristics may provide truly scalable solutions to the influence maximization problem with satisfying influence spread and blazingly fast running time. Therefore, contrary to what implied by the conclusion of [5] that traditional heuristics are outperformed by the greedy approximation algorithm, our results shed new lights on the research of heuristic algorithms.
Learning Influence Probabilities In Social Networks
"... Recently, there has been tremendous interest in the phenomenon of influence propagation in social networks. The studies in this area assume they have as input to their problems a social graph with edges labeled with probabilities of influence between users. However, the question of where these proba ..."
Abstract

Cited by 148 (18 self)
 Add to MetaCart
(Show Context)
Recently, there has been tremendous interest in the phenomenon of influence propagation in social networks. The studies in this area assume they have as input to their problems a social graph with edges labeled with probabilities of influence between users. However, the question of where these probabilities come from or how they can be computed from real social network data has been largely ignored until now. Thus it is interesting to ask whether from a social graph and a log of actions by its users, one can build models of influence. This is the main problem attacked in this paper. In addition to proposing models and algorithms for learning the model parameters and for testing the learned models to make predictions, we also develop techniques for predicting the time by which a user may be expected to perform an action. We validate our ideas and techniques using the Flickr data set consisting of a social graph with 1.3M nodes, 40M edges, and an action log consisting of 35M tuples referring to 300K distinct actions. Beyond showing that there is genuine influence happening in a real social network, we show that our techniques have excellent prediction performance.
An eventbased framework for characterizing the evolution of interaction graphs
, 2007
"... Interaction graphs are ubiquitous in many fields such as bioinformatics, sociology and physical sciences. There have been many studies in the literature targeted at studying and mining these graphs. However, almost all of them have studied these graphs from a static point of view. The study of the e ..."
Abstract

Cited by 95 (3 self)
 Add to MetaCart
(Show Context)
Interaction graphs are ubiquitous in many fields such as bioinformatics, sociology and physical sciences. There have been many studies in the literature targeted at studying and mining these graphs. However, almost all of them have studied these graphs from a static point of view. The study of the evolution of these graphs over time can provide tremendous insight on the behavior of entities, communities and the flow of information among them. In this work, we present an eventbased characterization of critical behavioral patterns for temporally varying interaction graphs. We use nonoverlapping snapshots of interaction graphs and develop a framework for capturing and identifying interesting events from them. We use these events to characterize complex behavioral patterns of individuals and communities over time. We show how semantic information can be incorporated to reason about communitybehavior events. We also demonstrate the application of behavioral patterns for the purposes of modeling evolution, link prediction and influence maximization. Finally, we present a diffusion model for evolving networks, based on our framework.
On the submodularity of influence in social networks
 In The Annual ACM Symposium on Theory of Computing(STOC
, 2007
"... We prove and extend a conjecture of Kempe, Kleinberg, and Tardos (KKT) on the spread of influence in social networks. A social network can be represented by a directed graph where the nodes are individuals and the edges indicate a form of social relationship. A simple way to model the diffusion of i ..."
Abstract

Cited by 87 (3 self)
 Add to MetaCart
(Show Context)
We prove and extend a conjecture of Kempe, Kleinberg, and Tardos (KKT) on the spread of influence in social networks. A social network can be represented by a directed graph where the nodes are individuals and the edges indicate a form of social relationship. A simple way to model the diffusion of ideas, innovative behavior, or “wordofmouth ” effects on such a graph is to consider an increasing process of “infected” (or active) nodes: each node becomes infected once an activation function of the set of its infected neighbors crosses a certain threshold value. Such a model was introduced by KKT in [7, 8] where the authors also impose several natural assumptions: the threshold values are (uniformly) random to account for our lack of knowledge of the true values; and the activation functions are monotone and submodular, i.e. have “diminishing returns. ” The monotonicity condition indicates that a node is more likely to become active if more of its neighbors are active, while the submodularity condition, indicates that the marginal effect of each neighbor is decreasing when the set of active neighbors increases. For an initial set of active nodes S, let σ(S) denote the expected number of active nodes at termination. Here we prove a conjecture of KKT: we show that the function σ(S) is submodular under
Competitive influence maximization in social networks
 In WINE
, 2007
"... Abstract. Social networks often serve as a medium for the diffusion of ideas or innovations. An individual’s decision whether to adopt a product or innovation will be highly dependent on the choices made by the individual’s peers or neighbors in the social network. In this work, we study the game of ..."
Abstract

Cited by 87 (2 self)
 Add to MetaCart
(Show Context)
Abstract. Social networks often serve as a medium for the diffusion of ideas or innovations. An individual’s decision whether to adopt a product or innovation will be highly dependent on the choices made by the individual’s peers or neighbors in the social network. In this work, we study the game of innovation diffusion with multiple competing innovations such as when multiple companies market competing products using viral marketing. Our first contribution is a natural and mathematically tractable model for the diffusion of multiple innovations in a network. We give a (1−1/e) approximation algorithm for computing the best response to an opponent’s strategy, and prove that the “price of competition ” of this game is at most 2. We also discuss “first mover ” strategies which try to maximize the expected diffusion against perfect competition. Finally, we give an FPTAS for the problem of maximizing the influence of a single player when the underlying graph is a tree. 1
What’s in a Hashtag? Content based Prediction of the Spread of Ideas in Microblogging Communities
"... Current social media research mainly focuses on temporal trends of the information flow and on the topology of the social graph that facilitates the propagation of information. In this paper we study the effect of the content of the idea on the information propagation. We present an efficient hybrid ..."
Abstract

Cited by 43 (1 self)
 Add to MetaCart
(Show Context)
Current social media research mainly focuses on temporal trends of the information flow and on the topology of the social graph that facilitates the propagation of information. In this paper we study the effect of the content of the idea on the information propagation. We present an efficient hybrid approach based on a linear regression for predicting the spread of an idea in a given time frame. We show that a combination of content features with temporal and topological features minimizes prediction error. Our algorithm is evaluated on Twitter hashtags extracted from a dataset of more than 400 million tweets. We analyze the contribution and the limitations of the various feature types to the spread of information, demonstrating that content aspects can be used as strong predictors thus should not be disregarded. We also study the dependencies between global features such as graph topology and content features.
Maximizing influence in a competitive social network: a follower’s perspective
 In ICEC ’07: Proceedings of the ninth international conference on Electronic commerce
, 2007
"... We consider the problem faced by a company that wants to use viral marketing to introduce a new product into a market where a competing product is already being introduced. We assume that consumers will use only one of the two products and will influence their friends in their decision of which prod ..."
Abstract

Cited by 38 (0 self)
 Add to MetaCart
We consider the problem faced by a company that wants to use viral marketing to introduce a new product into a market where a competing product is already being introduced. We assume that consumers will use only one of the two products and will influence their friends in their decision of which product to use. We propose two models for the spread of influence of competing technologies through a social network and consider the influence maximization problem from the follower’s perspective. In particular we assume the follower has a fixed budget available that can be used to target a subset of consumers and show that, although it is NPhard to select the most influential subset to target, it is possible to give an efficient algorithm that is within 63 % of optimal. Our computational experiments show that by using knowledge of the social network and the set of consumers targeted by the competitor, the follower may in fact capture a majority of the market by targeting a relatively small set of the right consumers.
Discovering leaders from community actions
 In In Proceedings of ACM 17th Conference on Information and Knowledge Management (CIKM
, 2008
"... We introduce a novel frequent pattern mining approach to discover leaders and tribes in social networks. In particular, we consider social networks where users perform actions. Actions may be as simple as tagging resources (urls) as in del.icio.us, rating songs as in Yahoo! Music, or movies as in Ya ..."
Abstract

Cited by 37 (6 self)
 Add to MetaCart
(Show Context)
We introduce a novel frequent pattern mining approach to discover leaders and tribes in social networks. In particular, we consider social networks where users perform actions. Actions may be as simple as tagging resources (urls) as in del.icio.us, rating songs as in Yahoo! Music, or movies as in Yahoo! Movies, or users buying gadgets such as cameras, handhelds, etc. and blogging a review on the gadgets. The assumption is that actions performed by a user can be seen by their network friends. Users seeing their friends ’ actions are sometimes tempted to perform those actions. We are interested in the problem of studying the propagation of such “influence”, and on this basis, identifying which users are leaders when it comes to setting the trend for performing various actions. We consider alternative definitions of leaders based on frequent patterns and develop algorithms for their efficient discovery. Our definitions are based on observing the way influence propagates in a time window, as the window is moved in time. Given a social graph and a table of user actions, our algorithms can discover leaders of various flavors by making one pass over the actions table. We run detailed experiments to evaluate the utility and scalability of our algorithms on reallife data. The results of our experiments confirm on the one hand, the efficiency of the proposed algorithm, and on the other hand, the effectiveness and relevance of the overall framework. To the best of our knowledge, this the first frequent pattern based approach to social network mining.
A Note on Maximizing the Spread of Influence in Social Networks
"... Abstract. We consider the spread maximization problem that was defined by Domingos and Richardson [7, 22]. In this problem, we are given a social network represented as a graph and are required to find the set of the most “influential ” individuals that by introducing them with a new technology, we ..."
Abstract

Cited by 35 (0 self)
 Add to MetaCart
Abstract. We consider the spread maximization problem that was defined by Domingos and Richardson [7, 22]. In this problem, we are given a social network represented as a graph and are required to find the set of the most “influential ” individuals that by introducing them with a new technology, we maximize the expected number of individuals in the network, later in time, that adopt the new technology. This problem has applications in viral marketing, where a company may wish to spread the rumor of a new product via the most influential individuals in popular social networks such as Myspace and Blogsphere. The spread maximization problem was recently studied in several models of social networks [14, 15, 20]. In this short paper we study this problem in the context of the well studied probabilistic voter model. We provide very simple and efficient algorithms for solving this problem. An interesting special case of our result is that the most natural heuristic solution, which picks the nodes in the network with the highest degree, is indeed the optimal solution.