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

On the precision of social and information networks

Published: 07 October 2013 Publication History

Abstract

The diffusion of information on online social and information networks has been a popular topic of study in recent years, but attention has typically focused on speed of dissemination and recall (i.e. the fraction of users getting a piece of information). In this paper, we study the complementary notion of the precision of information diffusion. Our model of information dissemination is "broadcast-based'', i.e., one where every message (original or forwarded) from a user goes to a fixed set of recipients, often called the user's ``friends'' or ``followers'', as in Facebook and Twitter. The precision of the diffusion process is then defined as the fraction of received messages that a user finds interesting.
On first glance, it seems that broadcast-based information diffusion is a "blunt" targeting mechanism, and must necessarily suffer from low precision. Somewhat surprisingly, we present preliminary experimental and analytical evidence to the contrary: it is possible to simultaneously have high precision (i.e. is bounded below by a constant), high recall, and low diameter!
We start by presenting a set of conditions on the structure of user interests, and analytically show the necessity of each of these conditions for obtaining high precision. We also present preliminary experimental evidence from Twitter verifying that these conditions are satisfied. We then prove that the Kronecker-graph based generative model of Leskovec et al. satisfies these conditions given an appropriate and natural definition of user interests. Further, we show that this model also has high precision, high recall, and low diameter. We finally present preliminary experimental evidence showing Twitter has high precision, validating our conclusion. This is perhaps a first step towards a formal understanding of the immense popularity of online social networks as an information dissemination mechanism.

References

[1]
O. Alonso, C. Carson, D. Gerster, X. Ji, and S. U. Nabar. Detecting uninteresting content in text streams. In SIGIR Crowdsourcing for Search Evaluation Workshop, 2010.
[2]
Apache. Apache Mahout, http://mahout.apache.org.
[3]
D. Chakrabarti and C. Faloutsos. Graph mining: Laws, generators, and algorithms. ACM Computing Surveys (CSUR), 38(1):2, 2006.
[4]
P. Domingos and M. Richardson. Mining the network value of customers. Proc. 7th ACM SIGKDD Intl. Conf. Knowledge Discovery and Data Mining, pages 57--66, 2001.
[5]
D. Easley and J. M. Kleinberg. Networks, crowds, and markets, volume 8. Cambridge Univ Press, 2010.
[6]
S. L .Feld. Why your friends have more friends than you do. American Journal of Sociology, pages 1464--1477, 1991.
[7]
I. Foudalis, K. Jain, C. H. Papadimitriou, and M. Sideri. Modeling social networks through user background and behavior. In WAW, pages 85--102, 2011.
[8]
M. Girvan and M. E. J. Newman. Community structure in social and biological networks. Proc. Nat. Acad. Sci., 99(12):7821--7826, 2002.
[9]
M. S. Granovetter. The strength of weak ties. Amer. J. Sociology, pages 1360--1380, 1973.
[10]
A. L. Hughes and L. Palen. Twitter adoption and use in mass convergence and emergency events. Intl. J. Emergency Management, 6(3):248--260, 2009.
[11]
Twitter Inc. Embedded Tweets, 2013 (accessed June 26, 2013). https://dev.twitter.com/docs/embedded-tweets.
[12]
R. Karp, C. Schindelhauer, S. Shenker, and B. Vocking. Randomized rumor spreading. In Proc. 41st Ann. Symp. on Foundations of Computer Science, pages 565--574. IEEE, 2000.
[13]
D. Kempe, J. Kleinberg, and É. Tardos. Maximizing the spread of influence through a social network. Proc. 9th ACM SIGKDD Intl. Conf. Knowledge Discovery and Data Mining, pages 137--146, 2003.
[14]
M. Kim and J. Leskovec. Multiplicative attribute graph model of real-world networks. Internet Mathematics, 8(1--2):113--160, 2012.
[15]
J. Kleinberg. Cascading Behavior in Networks: Algorithmic and Economic Issues. In N. Nisan, T. Roughgarden, E. Tardos, and V.V. Vazirani, editors, Algorithmic Game Theory. Cambridge University Press New York, NY, USA, 2007.
[16]
J. M. Kleinberg. Navigation in a small world. Nature, 406(6798):845--845, 2000.
[17]
S. Lattanzi and D. Sivakumar. Affiliation networks. In Proc. 41st Annual ACM Symp. Theory of Computing, pages 427--434. 2009.
[18]
J. Leskovec, D. Chakrabarti, J. Kleinberg, C. Faloutsos, and Z. Ghahramani. Kronecker graphs: An approach to modeling networks. The J. Machine Learning Res., 11:985--1042, 2010.
[19]
J. Leskovec, L. A. Adamic, and B. A. Huberman. The dynamics of viral marketing. ACM Trans. Web, 1(1):5, 2007.
[20]
J. Leskovec, J. Kleinberg, and C. Faloutsos. Graphs over time: Densification laws, shrinking diameters and possible explanations. In Proc. 11th ACM SIGKDD Intl. Conf. Knowledge Discovery in Data Mining, pages 177--187. 2005.
[21]
M. Mahdian and Y. Xu. Stochastic kronecker graphs. Random Struct. Algorithms, 38(4):453--466, 2011.
[22]
C. D. Manning, P. Raghavan, and H. Schütze. Introduction to information retrieval, volume 1. Cambridge University Press, Cambridge, 2008.
[23]
A. K. McCallum. Mallet: A machine learning for language toolkit. 2002.
[24]
P. McFedries. Technically speaking: All a-twitter. Spectrum, IEEE, 44(10):84--84, 2007.
[25]
S. Milgram. The small world problem. Psychology Today, 2(1):60--67, 1967.
[26]
M. Mitzenmacher. A brief history of generative models for power law and lognormal distributions. Internet Mathematics, 1(2):226--251, 2004.
[27]
L. Page, S. Brin, R. Motwani, and T. Winograd. The pagerank citation ranking: Bringing order to the web. Technical Report 1999--66, Stanford InfoLab, November 1999. Previous number = SIDL-WP-1999-0120.
[28]
N. Park, K. F. Kee, and S. Valenzuela. Being immersed in social networking environment: Facebook groups, uses and gratifications, and social outcomes. CyberPsychology & Behavior, 12(6):729--733, 2009.
[29]
E. M. Rogers. Diffusion of innovations. Free Press, 2010.
[30]
D. Sculley. Combined regression and ranking. In Proc. 16th ACM SIGKDD Intl. Conf. on Knowledge Discovery and Data Mining, pages 979--988. 2010.
[31]
D. J. Watts and S. H. Strogatz. Collective dynamics of 'small-world' networks. Nature, 393(6684):440--442, 1998.

Cited By

View all
  • (2019)Data Driven Spatio-Info Network Modeling and Evolution With Population and EconomyIEEE Access10.1109/ACCESS.2019.29192567(77190-77199)Online publication date: 2019
  • (2019)Community Structures in Information NetworksTheory and Applications of Models of Computation10.1007/978-3-030-16989-3_9(119-127)Online publication date: 2-Apr-2019
  • (2018)Stable and Efficient Structures for the Content Production and Consumption in Information CommunitiesGame Theory for Networking Applications10.1007/978-3-319-93058-9_12(163-173)Online publication date: 21-Aug-2018
  • Show More Cited By

Index Terms

  1. On the precision of social and information networks

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM Conferences
    COSN '13: Proceedings of the first ACM conference on Online social networks
    October 2013
    254 pages
    ISBN:9781450320849
    DOI:10.1145/2512938
    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: 07 October 2013

    Permissions

    Request permissions for this article.

    Check for updates

    Author Tags

    1. modeling
    2. precision
    3. recall
    4. social networks

    Qualifiers

    • Research-article

    Conference

    COSN'13
    Sponsor:
    COSN'13: Conference on Online Social Networks
    October 7 - 8, 2013
    Massachusetts, Boston, USA

    Acceptance Rates

    COSN '13 Paper Acceptance Rate 22 of 138 submissions, 16%;
    Overall Acceptance Rate 69 of 307 submissions, 22%

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)3
    • Downloads (Last 6 weeks)1
    Reflects downloads up to 09 Nov 2024

    Other Metrics

    Citations

    Cited By

    View all
    • (2019)Data Driven Spatio-Info Network Modeling and Evolution With Population and EconomyIEEE Access10.1109/ACCESS.2019.29192567(77190-77199)Online publication date: 2019
    • (2019)Community Structures in Information NetworksTheory and Applications of Models of Computation10.1007/978-3-030-16989-3_9(119-127)Online publication date: 2-Apr-2019
    • (2018)Stable and Efficient Structures for the Content Production and Consumption in Information CommunitiesGame Theory for Networking Applications10.1007/978-3-319-93058-9_12(163-173)Online publication date: 21-Aug-2018
    • (2017)CascadesProceedings of the 26th International Conference on World Wide Web10.1145/3038912.3052647(587-596)Online publication date: 3-Apr-2017
    • (2017)Analyzing Resilience of Interest-Based Social Networks Against Node and Link FailuresIEEE Transactions on Signal and Information Processing over Networks10.1109/TSIPN.2017.26978273:2(252-267)Online publication date: Jun-2017
    • (2017)Modeling interest-based social networks: Superimposing Erdős-Rényi graphs over random intersection graphs2017 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)10.1109/ICASSP.2017.7952848(3704-3708)Online publication date: Mar-2017
    • (2016)Social ClicksACM SIGMETRICS Performance Evaluation Review10.1145/2964791.290146244:1(179-192)Online publication date: 14-Jun-2016
    • (2016)Social ClicksProceedings of the 2016 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Science10.1145/2896377.2901462(179-192)Online publication date: 14-Jun-2016
    • (2016)Exploring Patterns of Identity Usage in TweetsProceedings of the 25th International Conference on World Wide Web10.1145/2872427.2883027(401-412)Online publication date: 11-Apr-2016
    • (2016)On the Efficiency of the Information Networks in Social MediaProceedings of the Ninth ACM International Conference on Web Search and Data Mining10.1145/2835776.2835826(83-92)Online publication date: 8-Feb-2016
    • Show More Cited By

    View Options

    Get Access

    Login options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Media

    Figures

    Other

    Tables

    Share

    Share

    Share this Publication link

    Share on social media