Modelling Influence in a Social Network: Metrics and Evaluation
Published 1 October 2011
Behnam Hajian, Tony White
Citations90
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
The hypothesis explored in this paper is that Influence Rank can be quantified based on the interaction between users and their behavior and results supporting the utility of the measure and the accuracy of its estimation using the Page Rank approximation are presented.
Abstract
Social recommender systems are a recently introduced type of decision support system. One of the issues to be resolved in social recommender systems is the identification of opinion leaders in a network. The focus of this paper is the analysis of a network based on the interactions between users called behavioral analysis. The hypothesis explored in this paper is that Influence Rank can be quantified based on the interaction between users and their behavior. The Influence Rank for a node is defined as the average Influence Rank of its neighborhoods combined with another index called Magnitude of Influence. The correlation between the proposed indices is analyzed in this paper. This combined measure is calculated by a recursive algorithm whose calculation complexity is non-polynomial. However, this measure can be estimated by using the Page Rank algorithm. Results supporting the utility of the measure and the accuracy of its estimation using the Page Rank approximation are presented.
Keywords
Computer SciencePhysics and Astronomy
The PageRank Citation Ranking : Bringing Order to the Web
12,645 Citations1999Lawrence M. Page, Sergey Brin +2 more
This paper describes PageRank, a mathod for rating Web pages objectively and mechanically, effectively measuring the human interest and attention devoted to them, and shows how to efficiently compute PageRank for large numbers of pages.
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.
ACM Transactions on Information SystemsEvaluating collaborative filtering recommender systems
5,762 Citations2004Jonathan L. Herlocker, Joseph A. Konstan +2 more
The key decisions in evaluating collaborative filtering recommender systems are reviewed: the user tasks being evaluated, the types of analysis and datasets being used, the ways in which prediction quality is measured, the evaluation of prediction attributes other than quality, and the user-based evaluation of the system as a whole.
Journal of Abnormal & Social PsychologyA study of normative and informational social influences upon individual judgment.
4,659 Citations1955Morton Deutsch, Harold B. Gerard
Several modifications of the Asch experiment in which the S judges the length of lines in the company of a group of “stooges” who carry out the experimenter's instructions are described.
ScienceNetwork Analysis in the Social Sciences
4,229 Citations2009Stephen P. Borgatti, Ajay Mehra +2 more
The kinds of things that social scientists have tried to explain using social network analysis are reviewed and a nutshell description of the basic assumptions, goals, and explanatory mechanisms prevalent in the field is provided.
Journal of Conflict ResolutionCompliance, identification, and internalization three processes of attitude change
3,622 Citations1958Herbert C. Kelman
NatureControllability of complex networks
3,293 Citations2011Yang‐Yu Liu, Jean-Jacques Slotine +1 more
Analytical tools are developed to study the controllability of an arbitrary complex directed network, identifying the set of driver nodes with time-dependent control that can guide the system’s entire dynamics.
Social NetworksCentrality and network flow
3,061 Citations2005Stephen P. Borgatti
A key claim made in this paper is that centrality measures can be regarded as generating expected values for certain kinds of node outcomes given implicit models of how traffic flows, and that this provides a new and useful way of thinking about centrality.
Proceedings of the International AAAI Conference on Web and Social MediaMeasuring User Influence in Twitter: The Million Follower Fallacy
3,009 Citations2010Meeyoung Cha, Hamed Haddadi +2 more
An in-depth comparison of three measures of influence, using a large amount of data collected from Twitter, is presented, suggesting that topological measures such as indegree alone reveals very little about the influence of a user.
Centrality and network flow
1,739 Citations2005Stephen P. Borgatti
ScienceEconomic Networks: The New Challenges
934 Citations2009Frank Schweitzer, Giorgio Fagiolo +4 more
An approach that stresses the systemic complexity of economic networks and that can be used to revise and extend established paradigms in economic theory will facilitate the design of policies that reduce conflicts between individual interests and global efficiency, as well as reduce the risk of global failure by making economic networks more robust.
Scalable Influence Maximization in Social Networks under the Linear Threshold Model
922 Citations2010Wei Chen, Yifei Yuan +1 more
This paper proposes the first scalable influence maximization algorithm tailored for the linear threshold model, which is scalable to networks with millions of nodes and edges, is orders of magnitude faster than the greedy approximation algorithm proposed by Kempe et al. and its optimized versions, and performs consistently among the best algorithms.
Impact of social influence in e-commerce decision making
357 Citations2007Young Ae Kim, Jaideep Srivastava
An overview of the impact of social influence in E-commerce decision making is presented to provide guidance to researchers and companies who have an interest in related issues and identifies how data about social influence can be captured from online customer behaviors and how it can be used by E- commerce websites to aid the user decision making process.
Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topicsBetweenness centrality correlation in social networks
322 Citations2003K.-I. Goh, Eunsoon Oh +2 more
The betweenness centrality (BC) correlation for each type of SF networks is investigated, implying that each person is surrounded by almost the same influential environments of people no matter how influential the person may be.
Operations ResearchClique Relaxations in Social Network Analysis: The Maximum <i>k</i>-Plex Problem
305 Citations2011Balabhaskar Balasundaram, Sergiy Butenko +1 more
An algorithmic approach is developed exploiting the graph-theoretic properties of a k-plex that is effective in solving the problem to optimality on very large, sparse graphs such as the power law graphs frequently encountered in the applications of interest.
Mining social networks using heat diffusion processes for marketing candidates selection
253 Citations2008Hao Ma, Haixuan Yang +2 more
This work represents a novel approach to the analysis of social network marketing, and is the first work to propose how to defend against negative comments within social networks.
Detecting sources of computer viruses in networks
223 Citations2010Devavrat Shah, Tauhid Zaman
Simulations show that rumor centrality outperforms distance centrality in finding virus sources in networks which are not tree-like, and it is proved that on trees, the rumor center and distance center are equivalent, but on general networks, they may differ.
Adaptive Agents and Multi-Agents SystemsDetermining the top-k nodes in social networks using the Shapley value
78 Citations2008Neeraj Suri, Y. Narahari
This paper proposes a novel and intuitive algorithm based on the Shapley value, for efficiently computing an approximate solution to the problem of selecting, for any given positive integer k, the top-k nodes in a social network, based on a certain measure appropriate for the social network.
Proceedings of the International AAAI Conference on Web and Social MediaSequential Influence Models in Social Networks
77 Citations2010Dan Cosley, Daniel P. Huttenlocher +3 more
Two of the most fundamental definitions of influence are considered, one based on a small set of "snapshot'' observations of a social network and the other based on detailed temporal dynamics, which provide a more detailed process model of how influence spreads.
Lecture notes in computer scienceSocial Network Data and Practices: The Case of Friendfeed
76 Citations2010Fabio Celli, F. Marta L. Di Lascio +3 more
First analysis of Friendfeed, a well-known and feature-rich SNS, is provided to provide a first analysis of the social network for sociological research.
Discovering Influence in Communication Networks Using Dynamic Graph Analysis
36 Citations2010Alexy Khrabrov, George Cybenko
These are the first dynamic metrics for social networks which take into the account both global and local influence (pagerank and repliers), and can be applied to other communication networks as well.
Lecture notes in computer scienceMaximum Betweenness Centrality: Approximability and Tractable Cases
24 Citations2011Martin Fink, Joachim Spoerhase
The reduction of MBC to Maximum Coverage is provided that simplifies the analysis of the algorithm of Dolev et al. considerably and proves that MBC is APX-complete and provides an exact polynomial-time algorithm for MBC on tree graphs.
Lecture notes in business information processingTowards Detecting Influential Users in Social Networks
22 Citations2011Amir Afrasiabi Rad, Morad Benyoucef
This work proposes a method that uses interaction between social network users to detect the most influential among them and calculates the relationship strength and influence by capturing the frequency of interactions between users.
Lecture notes in computer sciencePageRank Optimization in Polynomial Time by Stochastic Shortest Path Reformulation
21 Citations2010Balázs Csanád Csáji, Raphaël M. Jungers +1 more
This work considers the problem of maximizing the PageRank of a node by selecting some of the edges from a set of edges that are under the authors' control, and shows that an optimal solution can be found in polynomial time.
Lecture notes in computer scienceThe Impact of Naive Agents in Heterogeneous Trust-Aware Societies
4 Citations2010Amirali Salehi‐Abari, Tony White
This paper shows empirically that while learning agents can identify malicious agents through direct interaction, naive agents compromise utility through their inability to discern malicious agents.