An observer deployment algorithm for information source positioning based on Naive Bayes

被引:3
作者
Zhang Hong [1 ,2 ,4 ]
Guo Bing [1 ]
Shen Yan [3 ]
Shen Yun-Cheng [1 ]
Duan Xu-Liang [1 ]
Dong Xiang-Qian [1 ]
机构
[1] Sichuan Univ, Coll Comp Sci, Chengdu 610065, Peoples R China
[2] Chengdu Univ, Coll Informat Sci & Engn, Chengdu 610106, Peoples R China
[3] Chengdu Univ Informat Technol, Sch Control Engn, Chengdu 610225, Peoples R China
[4] Chengdu Univ, Key Lab Pattern Recognit & Intelligent Informat P, Inst Higher Educ Sichuan Prov, Chengdu 610106, Peoples R China
来源
INTERNATIONAL JOURNAL OF MODERN PHYSICS C | 2020年 / 31卷 / 08期
基金
中国国家自然科学基金;
关键词
Personal information; observer deployment; location information source; Naive Bayes; NETWORK; COMPLEX;
D O I
10.1142/S0129183120501156
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
The accurate positioning of the propagation and diffusion source points of personal information is of great practical significance for the protection of personal information security. Currently, a popular method is to locate the data diffusion source point by deploying a certain number of observers and collecting the data propagation information from observers. In view of the deployment of observers, it was found that there is an important correlation between the observer deployment location and the data propagation time delay by analyzing the relationship between the positioning accuracy of information sources and the deployment location of observers, and then an optimal deployment strategy based on Naive Bayes model (NBM) was proposed. At last, it was verified that the proposed deployment strategy can significantly improve the positioning accuracy of information source by comparing the model network with the actual network, which is of great significance for the security control of personal information propagation.
引用
收藏
页数:19
相关论文
共 16 条
[1]   Emergence of scaling in random networks [J].
Barabási, AL ;
Albert, R .
SCIENCE, 1999, 286 (5439) :509-512
[2]   The Hidden Geometry of Complex, Network-Driven Contagion Phenomena [J].
Brockmann, Dirk ;
Helbing, Dirk .
SCIENCE, 2013, 342 (6164) :1337-1342
[3]   Identifying the starting point of a spreading process in complex networks [J].
Comin, Cesar Henrique ;
Costa, Luciano da Fontoura .
PHYSICAL REVIEW E, 2011, 84 (05)
[4]   SET OF MEASURES OF CENTRALITY BASED ON BETWEENNESS [J].
FREEMAN, LC .
SOCIOMETRY, 1977, 40 (01) :35-41
[5]  
Kitsak M, 2010, NAT PHYS, V6, P888, DOI [10.1038/nphys1746, 10.1038/NPHYS1746]
[6]  
Lü L, 2016, NAT COMMUN, V7, DOI [10.1038/ncomms11119, 10.1038/ncomms10168]
[7]   A measure of betweenness centrality based on random walks [J].
Newman, MEJ .
SOCIAL NETWORKS, 2005, 27 (01) :39-54
[8]   Locating the Source of Diffusion in Large-Scale Networks [J].
Pinto, Pedro C. ;
Thiran, Patrick ;
Vetterli, Martin .
PHYSICAL REVIEW LETTERS, 2012, 109 (06)
[9]   Node importance measurement based on neighborhood similarity in complex network [J].
Ruan Yi-Run ;
Lao Song-Yang ;
Wang Jun-De ;
Bai Liang ;
Chen Li-Dong .
ACTA PHYSICA SINICA, 2017, 66 (03)
[10]  
Seo E., 2012, P SPIE INT SOC OPT E, V40, P838911