Identifying influential users by their postings in social networks
Published 25 June 2012
Beiming Sun, Vincent Ng
Citations41
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
A graph model is proposed to represent the relationships between online posts of one topic, in order to identify the influential users, and a new role is suggested, the connecter, to help bridging two different clusters of posts.
Abstract
Much research effort has been conducted to analyze information from social networks, including finding the influential users. In this paper, we propose a graph model to represent the relationships between online posts of one topic, in order to identify the influential users. Besides the role of starters, we suggest a new role, the connecter, to help bridging two different clusters of posts. Three methods for measuring the influences of online posts are discussed to distinguish starters and connecters in the graph. The results of the different measurements can then be integrated to determine the most influential posts and their respective authors. With the information of the explicit and implicit relationship between posts, our model tries to identify the most influential users based on their direct interaction as well as the implicit relationship among postings. The experiment is performed on Twitter to verify the model and the three methods of influence measurement. The interpretation of the methods is also given to justify the experiment results.
Keywords
Computer SciencePhysics and Astronomy
Contemporary Sociology A Journal of ReviewsSocial Network Analysis: A Handbook.
6,046 Citations1993Franz Urban Pappi, James G. Scott
TwitterRank
1,734 Citations2010Jianshu Weng, Ee‐Peng Lim +2 more
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.
Everyone's an influencer
1,659 Citations2011Eytan Bakshy, Jake M. Hofman +2 more
It is concluded that word-of-mouth diffusion can only be harnessed reliably by targeting large numbers of potential influencers, thereby capturing average effects and that predictions of which particular user or URL will generate large cascades are relatively unreliable.
Computational and Mathematical Organization TheoryIdentifying sets of key players in a social network
1,147 Citations2006Stephen P. Borgatti
It is found that off-the-shelf centrality measures are not optimal for solving either generic problem, and therefore new measures are presented.
User interactions in social networks and their implications
887 Citations2009Christo Wilson, Bryce Boe +3 more
This paper proposes the use of interaction graphs to impart meaning to online social links by quantifying user interactions, and uses both types of graphs to validate two well-known social-based applications (RE and SybilGuard).
Graph-based anomaly detection
471 Citations2003Caleb C. Noble, Diane J. Cook
This paper introduces two techniques for graph-based anomaly detection, and introduces a new method for calculating the regularity of a graph, with applications to anomaly detection.
Social influence and the diffusion of user-created content
308 Citations2009Eytan Bakshy, Brian Karrer +1 more
An empirical study of user-to-user content transfer occurring in the context of a time-evolving social network in Second Life, a massively multiplayer virtual world finds that sharing among friends occurs more rapidly than sharing among strangers, but that content that diffuses primarily through social influence tends to have a more limited audience.
Applied Mathematics and ComputationInformation processing in complex networks: Graph entropy and information functionals
281 Citations2007Matthias Dehmer
Numerical results are provided demonstrating not only the feasibility of the method, which has polynomial time complexity, but also its usefulness with regard to practical applications aiming to an understanding of information processing in complex networks.
Discovering important nodes through graph entropy the case of Enron email database
252 Citations2005Jitesh Shetty, Jafar Adibi
This work exploits an information theoretic model that combines information theory with statistical techniques from area of text mining and natural language processing to show how entropy models on graphs are relevant to study of information flow in an organization.
Journal of Mathematical ChemistryA proof of the triangle inequality for the Tanimoto distance
228 Citations1999Alan H. Lipkus
A new, simple proof that this distance satisfies the triangle inequality is presented and can be defined based on the Tanimoto coefficient.
Measurement-calibrated graph models for social network experiments
173 Citations2010Alessandra Sala, Lili Cao +4 more
This paper explores the feasibility of measurement-calibrated synthetic graphs using six popular graph models and a variety of real social graphs gathered from the Facebook social network and finds that two models consistently produce synthetic graphs with common graph metric values similar to those of the original graphs.
The Kluwer international series on advances in database systemsGraph Mining Applications to Social Network Analysis
137 Citations2010Lei Tang, Huan Liu
This chapter presents some graph patterns that are commonly observed in large-scale social networks and categorize and survey representative graph mining approaches and evaluation strategies for community detection.
Efficient identification of starters and followers in social media
34 Citations2009Michael Mathioudakis, Nick Koudas
This paper formalizes notions of 'starters' and 'followers' in social media and focuses on the development of random sampling approaches allowing us to achieve significant efficiency while identifying starters and followers.
Lecture notes in computer scienceVisualizing Threaded Conversation Networks: Mining Message Boards and Email Lists for Actionable Insights
33 Citations2010Derek L. Hansen, Ben Shneiderman +1 more
How actionable insights for community managers can be gained by applying the network analysis metrics and visualizations available in the free, open source NodeXL tool, which is a powerful, yet easy-to-use tool embedded in Excel 2007/2010.
A KLT-inspired node centrality for identifying influential neighborhoods in graphs
21 Citations2010Muhammad Ilyas, Hayder Radha
It is shown that principal component centrality's ranking procedure is based on spectral analysis of the network's graph adjacency matrix and identification of its most significant eigenvectors.
From Sociology to Computing in Social Networks
16 Citations2010Nasrullah Memon, Reda Alhajj
Important aspects of social networking analysis are covered in this work by combining experimental and theoretical research, and a specific focus is devoted to emerging trends and the industry needs associated with utilizing data mining techniques.
Lifespan and popularity measurement of online content on social networks
10 Citations2011Beiming Sun, Vincent Ng
The Comment Arrival Model is proposed to identify the lifespan and the comment frequency pattern of posts, which are considered the main factors to define post popularity and 4 general models to measure the popularity of posts are presented.
Journal of Mathematical ChemistryPartitioning technique procedure revisited II: Application to the Stark and Zeeman problems in light atoms
3 Citations1999P.G. Logrado, J. D. M. Vianna