检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:赵佳楠 王友国[2] 柴允 ZHAO Jianan;WANG Youguo;CHAI Yun(College of Telecommunications&Information Engineering,Nanjing University of Posts and Telecommunications,Nanjing 210003;College of Science,Nanjing University of Posts and Telecommunications,Nanjing 210046)
机构地区:[1]南京邮电大学通信与信息工程学院,南京210003 [2]南京邮电大学理学院,南京210046
出 处:《计算机与数字工程》2024年第7期1950-1954,共5页Computer & Digital Engineering
摘 要:论文研究了在SIR模型基础上,通过有限的观测者定位谣言爆发来源的估计问题。出于对观测节点遍历性的考虑,论文利用贪婪算法求取图的最小支配集作为观测节点,通过观测节点记录感染信息,然后利用皮尔逊相关系数,计算每个候选节点到观测节点的最短路径和其感染时间序列之间的相关性,相关性最高的判定为源节点。最后在仿真实验中验证了算法的准确性。The estimation problem of locating the source of rumor outbreak through limited observers is studied based on SIR model.Considering the ergodicity of the observer nodes,greedy algorithm algorithm is used to obtain the minimum dominating set of the graph as the observer nodes,record the infection information through the observer nodes,and then the Pearson correlation coeffi⁃cient is used to calculate the correlation between the shortest path from each candidate node to the observer nodes and its infection time series.The node with the highest correlation is determined as the source node.Finally,the accuracy of the algorithm is verified in the simulation experiment.
分 类 号:TP391.9[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.222