Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.1145/2310057.2310059acmconferencesArticle/Chapter ViewAbstractPublication PageshtConference Proceedingsconference-collections
research-article

Identifying influential users by their postings in social networks

Published: 25 June 2012 Publication History

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.

References

[1]
E. Bakshy, W. A. Mason, J. M. Hofman, and D. J. Watts. Everyone's an Influencer: Quantifying Influence on Twitter. In WSDM'11 Proceedings of the 4th ACM International Conference on Web Search and Data Mining, pp.65--74, Hong Kong, China, 2011.
[2]
E. Bakshy, B. Karrer, and A. Adamic, Lada. Social Influence and the Diffusion of User-Created Content. In 10th ACM Conference on Electronic Commerce, Stanford, California, 2009. Association of Computing Machinery.
[3]
A. Leavitt, E. Burchard, D. Fisher, and S. Gilbert. The Influentials: New Approaches for Analyzing Influence on Twitter. Web Ecology Project, http://tinyurl.com/lzjlzq, 2009.
[4]
Klout Score: http://klout.com/home
[5]
Twinfluence: http://twitterfacts.blogspot.com/2008/10/twinfluence.html
[6]
J. Weng, E. Lim, J. Jiang, and Q. He. TwitterRank: Finding Topic-sensitive Influential Twitterers. In WSDM '10 Proceedings of the 3rd ACM International Conference on Web Search and Data Mining, pp.261--270, 2010.
[7]
D. L. Hansen, B. Shneiderman, and M. A. Smith. Visualizing Threaded Conversation Networks: Mining Message Boards and Email Lists for Actionable Insights. In Proceedings of AMT '10, pp.47--62, 2010.
[8]
M. Mathioudakis and N. Koudas. Efficient Identification of Starters and Followers in Social Media. In EDBT '09 Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology, pp.708--719, 2009.
[9]
J. Shetty, and J. Adibi. Discovering Important Nodes through Graph Entropy. In the 11th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2005.
[10]
C. Nobel and D. J. Cook. Graph-based anomaly detection. In Proceedings of the 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp.631--636, 2003.
[11]
M. U. Ilyas, and H. Radha. A KLT-inspired Node Centrality for Identifying Influential Neighborhoods in Graphs. In Conference on Information Sciences and Systems, pp.1--7, 2010.
[12]
L. Tang, and H. Liu. Graph Mining Applications to Social Network Analysis. Managing and Mining Graph Data. In Managing and Mining Graph Data, pp.487--513, 2010.
[13]
A. Sala, L, Cao, C. Wilson, R. Zablit, H. Zheng, and B. Y. Zhao. Measurement-calibrated Graph Models for Social Network Experiments. In WWW'10 Proceedings of the 19th International Conference on World Wide Web, pp.861--870, 2010.
[14]
C. Wilson, B. Boe, A. Sala, K. P. N. Puttaswamy, and B. Y. Zhao. User interactions in social networks and their implications. In Proceedings. of EuroSys, pp.205--218, April 2009.
[15]
John Scott. "Centrality and Centralization". In Social Network Analysis: a handbook. London: SAGE Publications, 2000.
[16]
Lipkus, Alan H., A proof of the triangle inequality for the Tanimoto distance, J Math Chem 26 (1--3): pp.263--265, 1999.
[17]
B. Sun, V. TY. Ng. Lifespan and Popularity Measurement of Online Content on Social Networks. In Social Computing Workshop of IEEE ISI Conference, pp.379--383, 2011.
[18]
Matthias Dehme. Information processing in complex networks: Graph entropy and information functionals. In Applied Mathematics and Computation, vol 201, page 82--94, 2008.

Cited By

View all
  • (2021)Influence Cascades: Entropy-Based Characterization of Behavioral Influence Patterns in Social MediaEntropy10.3390/e2302016023:2(160)Online publication date: 28-Jan-2021
  • (2020)Modeling Influence with Semantics in Social NetworksACM Computing Surveys10.1145/336978053:1(1-38)Online publication date: 6-Feb-2020
  • (2018)Incentive-Compatible DiffusionProceedings of the 2018 World Wide Web Conference10.1145/3178876.3186043(1379-1388)Online publication date: 10-Apr-2018
  • Show More Cited By

Index Terms

  1. Identifying influential users by their postings in social networks

    Recommendations

    Reviews

    Klaus K. Obermeier

    Identifying influential users in social networks is the holy grail for a whole host of enterprise activities, ranging from product marketing to product design. If it were possible to pick the top influencers from the millions of social network users, marketing would be more efficient, trends could be spotted faster, and opinions could be captured more cogently. Current approaches that try to determine influence in social networks are limited to tallying connections, posts, and followers, often without scientific rationale. The authors of this paper propose a graph model that represents the relationship between related posts in a more complex fashion than simply counting them. The new twist in their approach is to go beyond investigating the people who start a post by stipulating a go-between, a connector that bridges clusters of posts. Distinguishing starters from connectors enables the model to capture both the explicit and implicit relationships between posts. Consequently, it identifies the most influential users from a dynamic interaction point of view, using a much more stringent method than the static endeavors that attempt to generate "vanity scores" in order to sell user data to marketing departments. To recap the relevant definitions: Starters generate more "inlinks" than "outlinks" (that is, they receive more links than they make), which is somewhat counterintuitive to the notion of a starter. Connectors link starters, in this framework. In the proposed graph model, the edges represent actions and the nodes represent actors. Influential posts are determined by concentrating on starters and connectors. The core sections of the paper discuss graph modeling of online postings, including graph construction, graph transformation, and influence measurements (for example, degree measure, shortest-path cost measure, and graph entropy measure). To test their assumptions, the authors conducted an experiment on Twitter that showed different results for each of the three measurement types, but in a complementary fashion. A composite view of the measurement results identified the influential starters and connectors. While the paper presents a quantitative view of starters and connectors, a valuable extension of the work would be to look at the text components more closely to see if it is possible to identify connectors and starters via text mining techniques. The authors suggest this at the end of their paper. Another interesting study would be to compare their approach with Christakis and Fowler's [1], who successfully predicted influenza outbreaks at Harvard using the friendship paradox [2]. This paradox states that, on average, most people have fewer friends than their friends have, so the people with the most friends should be the most influential. Online Computing Reviews Service

    Access critical reviews of Computing literature here

    Become a reviewer for Computing Reviews.

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM Conferences
    MSM '12: Proceedings of the 3rd international workshop on Modeling social media
    June 2012
    46 pages
    ISBN:9781450314022
    DOI:10.1145/2310057
    Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

    Sponsors

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    Published: 25 June 2012

    Permissions

    Request permissions for this article.

    Check for updates

    Author Tags

    1. graph entropy
    2. graph modeling
    3. node centrality
    4. social networks
    5. starter and connecter identification
    6. user influence

    Qualifiers

    • Research-article

    Conference

    HT '12
    Sponsor:
    HT '12: 23rd ACM Conference on Hypertext and Social Media
    June 25, 2012
    Wisconsin, Milwaukee, USA

    Acceptance Rates

    Overall Acceptance Rate 3 of 12 submissions, 25%

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)13
    • Downloads (Last 6 weeks)0
    Reflects downloads up to 26 Jan 2025

    Other Metrics

    Citations

    Cited By

    View all
    • (2021)Influence Cascades: Entropy-Based Characterization of Behavioral Influence Patterns in Social MediaEntropy10.3390/e2302016023:2(160)Online publication date: 28-Jan-2021
    • (2020)Modeling Influence with Semantics in Social NetworksACM Computing Surveys10.1145/336978053:1(1-38)Online publication date: 6-Feb-2020
    • (2018)Incentive-Compatible DiffusionProceedings of the 2018 World Wide Web Conference10.1145/3178876.3186043(1379-1388)Online publication date: 10-Apr-2018
    • (2018)Detecting Topic Authoritative Social Media Users: A Multilayer Network ApproachIEEE Transactions on Multimedia10.1109/TMM.2017.276332420:5(1195-1208)Online publication date: May-2018
    • (2018)Role Identification of Social NetworkersEncyclopedia of Social Network Analysis and Mining10.1007/978-1-4939-7131-2_247(2270-2278)Online publication date: 12-Jun-2018
    • (2017)Quantitative Verification of Social Media NetworksProceedings of the Fourth IEEE/ACM International Conference on Big Data Computing, Applications and Technologies10.1145/3148055.3148063(53-62)Online publication date: 5-Dec-2017
    • (2017)Temporal Topic-Based Multi-Dimensional Social Influence Evaluation in Online Social NetworksWireless Personal Communications: An International Journal10.1007/s11277-017-4047-095:3(2143-2171)Online publication date: 1-Aug-2017
    • (2017)Role Identification of Social NetworkersEncyclopedia of Social Network Analysis and Mining10.1007/978-1-4614-7163-9_247-1(1-9)Online publication date: 3-Apr-2017
    • (2016)Measuring user influence in GitHubProceedings of the 3rd International Workshop on CrowdSourcing in Software Engineering10.1145/2897659.2897663(15-21)Online publication date: 14-May-2016
    • (2014)Analyzing sentimental influence of posts on social networksProceedings of the 2014 IEEE 18th International Conference on Computer Supported Cooperative Work in Design (CSCWD)10.1109/CSCWD.2014.6846903(546-551)Online publication date: May-2014
    • Show More Cited By

    View Options

    Login options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Figures

    Tables

    Media

    Share

    Share

    Share this Publication link

    Share on social media