Using Social Sensors for Influence Propagation in Networks with Positive and Negative Relationships

Basak Guler, Burak Varan, Kaya Tutuncuoglu, Mohamed Nafea, Ahmed A. Zewail, Aylin Yener, Damien Octeau

    Research output: Contribution to journalArticle

    3 Citations (Scopus)

    Abstract

    Online social communities often exhibit complex relationship structures, ranging from close friends to political rivals. As a result, persons are influenced by their friends and foes differently. Future network applications can benefit from integrating these structural differences in propagation schemes through socially aware sensors. In this paper, we introduce a propagation model for such social sensor networks with positive and negative relationship types. We tackle two main scenarios based on this model. The first one is to minimize the end-to-end propagation cost of influencing a target person in favor of an idea by utilizing sensor observations about the relationship types in the underlying social graph. The propagation cost is incurred by social and physical network dynamics such as propagation delay, frequency of interaction, the strength of friendship/foe ties or the impact factor of the propagating idea. We next extend this problem by incorporating the impact of message deterioration and ignorance, and by limiting the number of persons influenced against the idea before reaching the target. Second, we study the propagation problem while minimizing the number of negatively influenced persons on the path, and provide extensions to elaborate on the impact of network parameters. We demonstrate our results in both an artificially created network and the Epinions signed network topology. Our results show that judicious propagation schemes lead to a significant reduction in the average cost and complexity of network propagation compared to naïve myopic algorithms.

    Original languageEnglish (US)
    Article number7001579
    Pages (from-to)360-373
    Number of pages14
    JournalIEEE Journal on Selected Topics in Signal Processing
    Volume9
    Issue number2
    DOIs
    StatePublished - Mar 1 2015

    Fingerprint

    Sensors
    Costs
    Sensor networks
    Deterioration
    Topology

    All Science Journal Classification (ASJC) codes

    • Signal Processing
    • Electrical and Electronic Engineering

    Cite this

    Guler, Basak ; Varan, Burak ; Tutuncuoglu, Kaya ; Nafea, Mohamed ; Zewail, Ahmed A. ; Yener, Aylin ; Octeau, Damien. / Using Social Sensors for Influence Propagation in Networks with Positive and Negative Relationships. In: IEEE Journal on Selected Topics in Signal Processing. 2015 ; Vol. 9, No. 2. pp. 360-373.
    @article{f4fc08f3074a4b5cacc62404b23ce5ab,
    title = "Using Social Sensors for Influence Propagation in Networks with Positive and Negative Relationships",
    abstract = "Online social communities often exhibit complex relationship structures, ranging from close friends to political rivals. As a result, persons are influenced by their friends and foes differently. Future network applications can benefit from integrating these structural differences in propagation schemes through socially aware sensors. In this paper, we introduce a propagation model for such social sensor networks with positive and negative relationship types. We tackle two main scenarios based on this model. The first one is to minimize the end-to-end propagation cost of influencing a target person in favor of an idea by utilizing sensor observations about the relationship types in the underlying social graph. The propagation cost is incurred by social and physical network dynamics such as propagation delay, frequency of interaction, the strength of friendship/foe ties or the impact factor of the propagating idea. We next extend this problem by incorporating the impact of message deterioration and ignorance, and by limiting the number of persons influenced against the idea before reaching the target. Second, we study the propagation problem while minimizing the number of negatively influenced persons on the path, and provide extensions to elaborate on the impact of network parameters. We demonstrate our results in both an artificially created network and the Epinions signed network topology. Our results show that judicious propagation schemes lead to a significant reduction in the average cost and complexity of network propagation compared to na{\"i}ve myopic algorithms.",
    author = "Basak Guler and Burak Varan and Kaya Tutuncuoglu and Mohamed Nafea and Zewail, {Ahmed A.} and Aylin Yener and Damien Octeau",
    year = "2015",
    month = "3",
    day = "1",
    doi = "10.1109/JSTSP.2014.2386792",
    language = "English (US)",
    volume = "9",
    pages = "360--373",
    journal = "IEEE Journal on Selected Topics in Signal Processing",
    issn = "1932-4553",
    publisher = "Institute of Electrical and Electronics Engineers Inc.",
    number = "2",

    }

    Using Social Sensors for Influence Propagation in Networks with Positive and Negative Relationships. / Guler, Basak; Varan, Burak; Tutuncuoglu, Kaya; Nafea, Mohamed; Zewail, Ahmed A.; Yener, Aylin; Octeau, Damien.

    In: IEEE Journal on Selected Topics in Signal Processing, Vol. 9, No. 2, 7001579, 01.03.2015, p. 360-373.

    Research output: Contribution to journalArticle

    TY - JOUR

    T1 - Using Social Sensors for Influence Propagation in Networks with Positive and Negative Relationships

    AU - Guler, Basak

    AU - Varan, Burak

    AU - Tutuncuoglu, Kaya

    AU - Nafea, Mohamed

    AU - Zewail, Ahmed A.

    AU - Yener, Aylin

    AU - Octeau, Damien

    PY - 2015/3/1

    Y1 - 2015/3/1

    N2 - Online social communities often exhibit complex relationship structures, ranging from close friends to political rivals. As a result, persons are influenced by their friends and foes differently. Future network applications can benefit from integrating these structural differences in propagation schemes through socially aware sensors. In this paper, we introduce a propagation model for such social sensor networks with positive and negative relationship types. We tackle two main scenarios based on this model. The first one is to minimize the end-to-end propagation cost of influencing a target person in favor of an idea by utilizing sensor observations about the relationship types in the underlying social graph. The propagation cost is incurred by social and physical network dynamics such as propagation delay, frequency of interaction, the strength of friendship/foe ties or the impact factor of the propagating idea. We next extend this problem by incorporating the impact of message deterioration and ignorance, and by limiting the number of persons influenced against the idea before reaching the target. Second, we study the propagation problem while minimizing the number of negatively influenced persons on the path, and provide extensions to elaborate on the impact of network parameters. We demonstrate our results in both an artificially created network and the Epinions signed network topology. Our results show that judicious propagation schemes lead to a significant reduction in the average cost and complexity of network propagation compared to naïve myopic algorithms.

    AB - Online social communities often exhibit complex relationship structures, ranging from close friends to political rivals. As a result, persons are influenced by their friends and foes differently. Future network applications can benefit from integrating these structural differences in propagation schemes through socially aware sensors. In this paper, we introduce a propagation model for such social sensor networks with positive and negative relationship types. We tackle two main scenarios based on this model. The first one is to minimize the end-to-end propagation cost of influencing a target person in favor of an idea by utilizing sensor observations about the relationship types in the underlying social graph. The propagation cost is incurred by social and physical network dynamics such as propagation delay, frequency of interaction, the strength of friendship/foe ties or the impact factor of the propagating idea. We next extend this problem by incorporating the impact of message deterioration and ignorance, and by limiting the number of persons influenced against the idea before reaching the target. Second, we study the propagation problem while minimizing the number of negatively influenced persons on the path, and provide extensions to elaborate on the impact of network parameters. We demonstrate our results in both an artificially created network and the Epinions signed network topology. Our results show that judicious propagation schemes lead to a significant reduction in the average cost and complexity of network propagation compared to naïve myopic algorithms.

    UR - http://www.scopus.com/inward/record.url?scp=84946914948&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=84946914948&partnerID=8YFLogxK

    U2 - 10.1109/JSTSP.2014.2386792

    DO - 10.1109/JSTSP.2014.2386792

    M3 - Article

    AN - SCOPUS:84946914948

    VL - 9

    SP - 360

    EP - 373

    JO - IEEE Journal on Selected Topics in Signal Processing

    JF - IEEE Journal on Selected Topics in Signal Processing

    SN - 1932-4553

    IS - 2

    M1 - 7001579

    ER -