skip to main content
10.1145/1641389.1641391acmconferencesArticle/Chapter ViewAbstractPublication Pagesicmi-mlmiConference Proceedingsconference-collections
research-article

Word-of-mouth algorithms: what you don't know will hurt you

Published: 06 November 2009 Publication History

Abstract

Word-of-mouth communication has been shown to play a key role in a variety of environments such as viral marketing and churn prediction. A family of algorithms, generally known as information spreading algorithms has been developed to model such pervasive behavior. Although these algorithms have produced good results, in general, they do not consider that the social network reconstructed to model the environment of an individual is limited by the information available. In this paper we study how the missing information (in the form of missing nodes and/or missing links) affects the spread of information in the well-known Dasgupta et al. (2008) algorithm. The results indicate that the error made grows logarithmically with the amount of information (links, nodes or both) unknown.

References

[1]
J. Leskovec et al., 'Sampling from Large Graphs', KDD, 2006.
[2]
K. Dasgupta et al., 'Social Ties and their relevance to churn in mobile telecom network', EDBT, 2008.
[3]
M. Seshadri et al., 'Mobile Call Graphs: Beyond Power-Law and Lognormal Distributions', KDD, 2008.
[4]
J-.P. Onnela et al., 'Structure and tie strenghs in mobile communication networks', New Journal of Physics 9, 2007.

Cited By

View all

Index Terms

  1. Word-of-mouth algorithms: what you don't know will hurt you

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM Conferences
    ICMI-MLMI '09: Proceedings of the ICMI-MLMI '09 Workshop on Multimodal Sensor-Based Systems and Mobile Phones for Social Computing
    November 2009
    27 pages
    ISBN:9781605586946
    DOI:10.1145/1641389
    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: 06 November 2009

    Permissions

    Request permissions for this article.

    Check for updates

    Author Tags

    1. link
    2. simulation
    3. social network
    4. word-of-mouth

    Qualifiers

    • Research-article

    Conference

    ICMI-MLMI '09
    Sponsor:

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • 0
      Total Citations
    • 249
      Total Downloads
    • Downloads (Last 12 months)1
    • Downloads (Last 6 weeks)0
    Reflects downloads up to 05 Mar 2025

    Other Metrics

    Citations

    Cited By

    View all

    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