Seed Selection for Spread of Influence in Social Networks: Temporal vs. Static Approach

@article{Michalski2014SeedSF,
  title={Seed Selection for Spread of Influence in Social Networks: Temporal vs. Static Approach},
  author={R. Michalski and Tomasz Kajdanowicz and Piotr Br{\'o}dka and Przemyslaw Kazienko},
  journal={New Generation Computing},
  year={2014},
  volume={32},
  pages={213-235}
}
  • R. Michalski, Tomasz Kajdanowicz, +1 author Przemyslaw Kazienko
  • Published 2014
  • Computer Science, Physics
  • New Generation Computing
  • The problem of finding optimal set of users for influencing others in the social network has been widely studied. Because it is NP-hard, some heuristics were proposed to find sub-optimal solutions. Still, one of the commonly used assumption is the one that seeds are chosen on the static network, not the dynamic one. This static approach is in fact far from the real-world networks, where new nodes may appear and old ones dynamically disappear in course of time.The main purpose of this paper is… CONTINUE READING

    Figures, Tables, and Topics from this paper.

    Antimicrobial drug resistance in Taiwan.
    10
    Single Cut Distal Femoral Varus Osteotomy (SCFO): A Preliminary Study.
    1
    Entropy-Based Measure for Influence Maximization in Temporal Networks

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 50 REFERENCES
    Graceful Restart Mechanism for BGP
    59
    Distributed simulation of large-scale PCS networks
    71
    Visual Odometry [Tutorial]
    846
    High-content screening moves to the front of the line.
    113
    Pareto-Optimal Cloud Bursting
    46