KMS Of Academy of mathematics and systems sciences, CAS
Information spreading with relative attributes on signed networks | |
Niu, Ya-Wei1; Qu, Cun-Quan1,2; Wang, Guang-Hui1,2; Wu, Jian-Liang1; Yan, Gui-Ying3,4![]() | |
2021-04-01 | |
Source Publication | INFORMATION SCIENCES
![]() |
ISSN | 0020-0255 |
Volume | 551Pages:54-66 |
Abstract | During the past years, network dynamics has been widely investigated in various disciplines. As a practical and convenient description for social networks, signed networks have also garnered significant attention. In this work, we study information spreading with relative attributes on signed networks, where edges are assigned positive or negative labels, describing friendly or hostile relationships. We define the attribute of information by a degree that can be either 'good' or `bad' and assume that the spreading willingness of the information receiver depends on not only its relation with others but also the attribute of information. A pair-wise potential relation identification algorithm is designed based on the shortest path approach and structural balance theory. Both simulations on randomly signed networks and empirical experiments on real datasets show that the proposed information spreading could be approximately investigated within a local 2-order neighborhood. In addition, the ratio of potential friendly nodes with a target node is consist with network content. Finally, the propagation speed of 'good' information would unexpectedly slow down when the ratio of positive edges is larger than an estimated threshold. The presented model could be referred to in real social scenarios, such as product promotion, advertisement media, and rumor mongering. (C) 2020 Published by Elsevier Inc. |
Keyword | Information spreading Relative attributes Signed networks Structural balance Positive edges Negative edges |
DOI | 10.1016/j.ins.2020.11.042 |
Indexed By | SCI |
Language | 英语 |
Funding Project | National Natural Science Foundation of China[11631014] ; National Natural Science Foundation of China[11871311] ; National Natural Science Foundation of China[12001324] ; program for the Outstanding PhD candidate of Shandong University ; China Scholarship Council ; China Postdoctoral Science Foundation[2019TQ0188] ; China Postdoctoral Science Foundation[2019M662315] ; Shandong University multidisciplinary research and innovation team of young scholars[2020QNQT017] |
WOS Research Area | Computer Science |
WOS Subject | Computer Science, Information Systems |
WOS ID | WOS:000612172900004 |
Publisher | ELSEVIER SCIENCE INC |
Citation statistics | |
Document Type | 期刊论文 |
Identifier | http://ir.amss.ac.cn/handle/2S8OKBNM/58132 |
Collection | 应用数学研究所 |
Corresponding Author | Qu, Cun-Quan; Wang, Guang-Hui |
Affiliation | 1.Shandong Univ, Sch Math, Jinan 250100, Peoples R China 2.Shandong Univ, Data Sci Inst, Jinan 250100, Peoples R China 3.Chinese Acad Sci, Acad Math & Syst Sci, Beijing 100190, Peoples R China 4.Univ Chinese Acad Sci, Beijing 100049, Peoples R China |
Recommended Citation GB/T 7714 | Niu, Ya-Wei,Qu, Cun-Quan,Wang, Guang-Hui,et al. Information spreading with relative attributes on signed networks[J]. INFORMATION SCIENCES,2021,551:54-66. |
APA | Niu, Ya-Wei,Qu, Cun-Quan,Wang, Guang-Hui,Wu, Jian-Liang,&Yan, Gui-Ying.(2021).Information spreading with relative attributes on signed networks.INFORMATION SCIENCES,551,54-66. |
MLA | Niu, Ya-Wei,et al."Information spreading with relative attributes on signed networks".INFORMATION SCIENCES 551(2021):54-66. |
Files in This Item: | There are no files associated with this item. |
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Edit Comment