Inferring lockstep behavior from connectivity pattern in large graphs

    Knowl. Inf. Syst., Volume 48, Issue 2, 2015, Pages 399-428.

    Cited by: 28|Bibtex|Views35|Links
    EI
    Keywords:
    Lockstep behavior Connectivity pattern Spectral subspace Propagation method Singular vector

    Abstract:

    Given multimillion-node graphs such as \"who-follows-whom\", \"patent-cites-patent\", \"user-likes-page\" and \"actor/director-makes-movie\" networks, how can we find unexpected behaviors? When companies operate on the graphs with monetary incentives to sell Twitter \"Followers\" and Facebook page \"Likes\", the graphs show strange connec...More

    Code:

    Data:

    Your rating :
    0

     

    Tags
    Comments