Self-Stabilizing Selection of Influential Users in Social Networks

Selection of Influential Users is an essential task in influence propagation schemes in social networks. Considering the phenomenon of asymmetric influences between neigh boring users and different sensitivities of users to influences, we propose to select the users in the minimal weighted positive...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:2014 IEEE 17th International Conference on Computational Science and Engineering S. 1558 - 1565
Hauptverfasser: Yihua Ding, Wang, James Z., Srimani, Pradip K.
Format: Tagungsbericht
Sprache:Englisch
Veröffentlicht: IEEE 01.12.2014
Schlagworte:
Algorithm design and analysis
Computational modeling
Distributed Scheduler
Influential Users
Minimal Weighted Positive Influence Dominating Set
Network topology
Protocols
Self-Stabilizing Algorithms
Sensitivity
Social network services
Social Networks
Time complexity
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Abstract Selection of Influential Users is an essential task in influence propagation schemes in social networks. Considering the phenomenon of asymmetric influences between neigh boring users and different sensitivities of users to influences, we propose to select the users in the minimal weighted positive influence dominating set of a social network graph as the influential users to maximize the speed of the propagation. We present the first polynomial time self-stabilizing algorithm for minimal weighted positive influence dominating set in an arbitrary social network. Starting from an arbitrary initial state, the algorithm terminates in O(n 3 ) steps using a distributed scheduler, where n is the number of nodes in the graph. Space requirement at each node is O(log n) bits. Experiments are conducted to verify the correctness and efficiency of the proposed algorithm.
AbstractList Selection of Influential Users is an essential task in influence propagation schemes in social networks. Considering the phenomenon of asymmetric influences between neigh boring users and different sensitivities of users to influences, we propose to select the users in the minimal weighted positive influence dominating set of a social network graph as the influential users to maximize the speed of the propagation. We present the first polynomial time self-stabilizing algorithm for minimal weighted positive influence dominating set in an arbitrary social network. Starting from an arbitrary initial state, the algorithm terminates in O(n 3 ) steps using a distributed scheduler, where n is the number of nodes in the graph. Space requirement at each node is O(log n) bits. Experiments are conducted to verify the correctness and efficiency of the proposed algorithm.
Author Yihua Ding
Srimani, Pradip K.
Wang, James Z.
Author_xml – sequence: 1
  surname: Yihua Ding
  fullname: Yihua Ding
  email: yihuad@clemson.edu
  organization: Sch. of Comput., Clemson Univ., Clemson, SC, USA
– sequence: 2
  givenname: James Z.
  surname: Wang
  fullname: Wang, James Z.
  email: jzwang@clemson.edu
  organization: Sch. of Comput., Clemson Univ., Clemson, SC, USA
– sequence: 3
  givenname: Pradip K.
  surname: Srimani
  fullname: Srimani, Pradip K.
  email: srimani@clemson.edu
  organization: Sch. of Comput., Clemson Univ., Clemson, SC, USA
BookMark eNotjz1PwzAURY0EErR0Y2PxH0jwZ2yPEJVSqYIhdK7s9D1kEWwUByH49QTBdO89w5XOgpymnICQK85qzpm7abt1LRhXtbD2hCy4Ms4ZZ5k-J6tSYmCiMY1SxlyQuw4GrLrJhzjE75he6Aygn2JONCPdJhw-IE3RD3RfYCw0Jtrl_nc_wvSZx9dySc7QDwVW_7kk-_v1c_tQ7Z422_Z2V0XO9FRxAYIDtx4bzwJKe2ysEBAYOq3RMK2D8nM5goXZghntUOqACAqk641ckuu_3wgAh_cxvvnx62CYkLOe_AFkMUlj
CODEN IEEPAD
ContentType Conference Proceeding
DBID 6IE
6IL
CBEJK
RIE
RIL
DOI 10.1109/CSE.2014.288
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Xplore POP ALL
IEEE Xplore All Conference Proceedings
IEEE Electronic Library (IEL)
IEEE Proceedings Order Plans (POP All) 1998-Present
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
EISBN 1479979805
9781479979813
1479979813
9781479979806
EndPage 1565
ExternalDocumentID 7023799
Genre orig-research
GroupedDBID 6IE
6IL
ALMA_UNASSIGNED_HOLDINGS
CBEJK
RIB
RIC
RIE
RIL
ID FETCH-LOGICAL-i105t-12e21e18af6a0bf38d6822eb0f955f7055b4a5f7de8e1100759f35bffe4e39c73
IEDL.DBID RIE
ISICitedReferencesCount 5
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000380512100253&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
IngestDate Wed Dec 20 05:19:03 EST 2023
IsPeerReviewed false
IsScholarly false
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-i105t-12e21e18af6a0bf38d6822eb0f955f7055b4a5f7de8e1100759f35bffe4e39c73
PageCount 8
ParticipantIDs ieee_primary_7023799
PublicationCentury 2000
PublicationDate 2014-Dec.
PublicationDateYYYYMMDD 2014-12-01
PublicationDate_xml – month: 12
  year: 2014
  text: 2014-Dec.
PublicationDecade 2010
PublicationTitle 2014 IEEE 17th International Conference on Computational Science and Engineering
PublicationTitleAbbrev CSE
PublicationYear 2014
Publisher IEEE
Publisher_xml – name: IEEE
SSID ssib026764477
Score 1.5780196
Snippet Selection of Influential Users is an essential task in influence propagation schemes in social networks. Considering the phenomenon of asymmetric influences...
SourceID ieee
SourceType Publisher
StartPage 1558
SubjectTerms Algorithm design and analysis
Computational modeling
Distributed Scheduler
Influential Users
Minimal Weighted Positive Influence Dominating Set
Network topology
Protocols
Self-Stabilizing Algorithms
Sensitivity
Social network services
Social Networks
Time complexity
Title Self-Stabilizing Selection of Influential Users in Social Networks
URI https://ieeexplore.ieee.org/document/7023799
WOSCitedRecordID wos000380512100253&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1NSwMxEB3a4sGTSit-k4NH0252s_m4Wlr0Ugq10FvZJBMolK30w4O_3mS3rh68eAu5hJkkvCF5bx7AoyqUCyidUJ-rgnImHTXaMRrAj8ctDwjsK7MJOZmoxUJPW_DUaGEQsSKfYT8Oq798t7GH-FQ2kAFgpNZtaEspa63W99lJhQzILmXDbdeD4WwUqVu8n0ZblV_eKRV0jM_-t-g59H40eGTaoMsFtLDswvMM156GAjFSWj_DPJlVPjYhuWTjyWvtOBIu7ZrMo4ySrEpSC3DJpOZ773owH4_ehi_06IJAV6H22VOWYsqQqcKLIjE-U04EUEeTeJ3nPjbDMbwIA4cKY_83mWuf5cZ75JhpK7NL6JSbEq-AiMQqtJmVwjBumVUKk8Qpg1wUqRbuGrox_uV73ehieQz95u_pWziN6a25HXfQ2W8PeA8n9mO_2m0fqt35AgEHkXU
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1NSwMxEB1qFfSk0orf5uDRtJvd7Ca5WlparEuhLfRWdpMJFGQr_fDgrzfZrdWDF28hlzCThDck780DeJSZNA6lA2pjmVHOhKG5Mow68ON-yx0C29JsQqSpnM3UqAZPey0MIpbkM2z5YfmXb5Z665_K2sIBjFDqAA5jzkNWqbW-T0-YCIftQuzZ7ardGXc9eYu3Qm-s8ss9pQSP3un_lj2D5o8Kj4z2-HIONSwa8DzGN0tdiehJrZ9unoxLJxuXXrK0ZFB5jrhr-0amXkhJFgWpJLgkrRjf6yZMe91Jp093Pgh04aqfDWUhhgyZzGySBbmNpEkcrGMeWBXH1rfDyXnmBgYl-g5wIlY2inNrkWOktIguoF4sC7wEkgRaoo60SHLGNdNSYhAYmSNPslAl5goaPv75e9XqYr4L_frv6Qc47k9eh_PhIH25gROf6orpcQv1zWqLd3CkPzaL9eq-3KkvwjqUvA
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=2014+IEEE+17th+International+Conference+on+Computational+Science+and+Engineering&rft.atitle=Self-Stabilizing+Selection+of+Influential+Users+in+Social+Networks&rft.au=Yihua+Ding&rft.au=Wang%2C+James+Z.&rft.au=Srimani%2C+Pradip+K.&rft.date=2014-12-01&rft.pub=IEEE&rft.spage=1558&rft.epage=1565&rft_id=info:doi/10.1109%2FCSE.2014.288&rft.externalDocID=7023799