Reading PAGE

Peer Evaluation activity

Downloads 6
Views 8
Collected by 1

Total impact ?

    Send a

    Enrique has...

    Trusted 0
    Reviewed 0
    Emailed 0
    Shared/re-used 0
    Discussed 0
    Invited 0
    Collected 10

     

    This was brought to you by:

    block this user Enrique Frias-Martinez Trusted member

    Senior Research Fellow

    Telefonica Research, Madrid, Spain

    How Did You Get to Know That? A Traceable Word-of-Mouth Algorithm

    Export to Mendeley

    Word-of-mouth communication has been shown to play a key role in a variety of environments such as viral marketing and virus spreading. A family of algorithms, generally known as information spreading algorithms or word-of-mouth algorithms, has been developed to characterize such behavior. However, they have limitations, including the inability to: (1) capture when the communications or contacts take place and (2) explain where the influence comes from. These drawbacks have limited the studies about how the spreading of influence takes place in social networks. In this paper, we present a new word-of-mouth algorithm that considers the temporality of the communications and keeps track of how influence travels over the social network. We validate the proposed algorithm via simulations of word-of-mouth traces on call detailed records, in order to model how influence spreads. Our results indicate that (1) static factors of social networks are not enough to model influence and (2) there seems to be statistical invariants of how influence spreads in a network.

    Oh la laClose

    Your session has expired but don’t worry, your message
    has been saved.Please log in and we’ll bring you back
    to this page. You’ll just need to click “Send”.

    Your evaluation is of great value to our authors and readers. Many thanks for your time.

    Review Close

    Short review
    Select a comment
    Select a grade
    You and the author
    Anonymity My review is anonymous( Log in  or  Register )
    publish
    Close

    When you're done, click "publish"

    Only blue fields are mandatory.

    Relation to the author*
    Overall Comment*
    Anonymity* My review is anonymous( Log in  or  Register )
     

    Focus & Objectives*

    Have the objectives and the central topic been clearly introduced?

    Novelty & Originality*

    Do you consider this work to be an interesting contribution to knowledge?

    Arrangement, Transition and Logic

    Are the different sections of this work well arranged and distributed?

    Methodology & Results

    Is the author's methodology relevant to both the objectives and the results?

    Data Settings & Figures

    Were tables and figures appropriate and well conceived?

    References and bibliography

    Is this work well documented and has the bibliography been properly established?

    Writing

    Is this work well written, checked and edited?

    Write Your Review (you can paste text as well)
    Please be civil and constructive. Thank you.


    Grade (optional, N/A by default)

    N/A 1 1.5 2 2.5 3 3.5 4 4.5 5 5.5 6 6.5 7 7.5 8 8.5 9 9.5 10
    Close

    Your mailing list is currently empty.
    It will build up as you send messages
    and links to your peers.

     No one besides you has access to this list.
    Close
    Enter the e-mail addresses of your recipients in the box below.  Note: Peer Evaluation will NOT store these email addresses   log in
    Your recipients

    Your message:

    Your email : Your email address will not be stored or shared with others.

    Your message has been sent.

    Description

    Title : How Did You Get to Know That? A Traceable Word-of-Mouth Algorithm
    Author(s) : Manuel Cebrian, Enrique Frias-Martinez, Heath Hohwald, Ruben Lara, Nuria Oliver
    Abstract : Word-of-mouth communication has been shown to play a key role in a variety of environments such as viral marketing and virus spreading. A family of algorithms, generally known as information spreading algorithms or word-of-mouth algorithms, has been developed to characterize such behavior. However, they have limitations, including the inability to: (1) capture when the communications or contacts take place and (2) explain where the influence comes from. These drawbacks have limited the studies about how the spreading of influence takes place in social networks. In this paper, we present a new word-of-mouth algorithm that considers the temporality of the communications and keeps track of how influence travels over the social network. We validate the proposed algorithm via simulations of word-of-mouth traces on call detailed records, in order to model how influence spreads. Our results indicate that (1) static factors of social networks are not enough to model influence and (2) there seems to be statistical invariants of how influence spreads in a network.
    Subject : unspecified
    Area : Other
    Language : English
    Year : 2009

    Affiliations Telefonica Research, Madrid, Spain
    Journal : 2009 International Conference on Computational Science and Engin
    Publisher : IEEE
    Pages : 292 - 297
    Url : http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=5284066
    Isbn : 978-1-4244-5334-4
    Doi : 10.1109/CSE.2009.176

    Leave a comment

    This contribution has not been reviewed yet. review?

    You may receive the Trusted member label after :

    • Reviewing 10 uploads, whatever the media type.
    • Being trusted by 10 peers.
    • If you are blocked by 10 peers the "Trust label" will be suspended from your page. We encourage you to contact the administrator to contest the suspension.

    Does this seem fair to you? Please make your suggestions.

    Please select an affiliation to sign your evaluation:

    Cancel Evaluation Save

    Please select an affiliation:

    Cancel   Save

    Enrique's Peer Evaluation activity

    Enrique has...

    Trusted 0
    Reviewed 0
    Emailed 0
    Shared/re-used 0
    Discussed 0
    Invited 0
    Collected 10
    Invite this peer to...
    Title
    Start date (dd/mm/aaaa)
    Location
    URL
    Message
    send
    Close

    Full Text request

    Your request will be sent.

    Please enter your email address to be notified
    when this article becomes available

    Your email


     
    Your email address will not be shared or spammed.