检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:赵宇[1,2] 汤红波 李丹浓[3] ZHAO Yu;TANG Hongbo;LI Dannong(National Digital Switching System Engineering and Technological R&D Center, Zhengzhou 450002, China;National Engineering Laboratory for Mobile Network Security, Beijing 100876, China;Information Engineering University, Zhengzhou 450001, China)
机构地区:[1]国家数字交换系统工程技术研究中心,河南郑州450002 [2]移动互联网安全技术国家工程实验室,北京100876 [3]信息工程大学,河南郑州450001
出 处:《信息工程大学学报》2018年第4期404-409,共6页Journal of Information Engineering University
基 金:国家自然科学基金资助项目(61521003);国家863计划资助项目(2015AA01A706)
摘 要:针对在线社会网络中多源点定位问题,当源点数量不确定时,定位准确率有待提高。采用设置探查节点的方式,基于探查节点接收时刻序列分布与网络空间结构具有相似性的特点,提出一种基于时空相似性的多源点定位方法。首先,分析多次接收信息节点的源点指向性,采用重启式随机游走算法确定源点备选集;然后,以非多次接收信息节点与备选源点的时空相似性为基础,将定位问题转化为聚类问题;最后,采用改进的近邻传播算法确定源点数量和位置。实验分析表明,相对于其他算法,该算法可提升源点定位的准确性,减少误差跳数。The accuracy of locating uncertain number of sources is to be promoted in social network. In this paper we study the diffusion sources locating problem by learning from information diffusion data collected from only a small subset of network nodes. A method for detecting multi-sources based on similarity between time and space in social network (DeMSS) is proposed . First, the directivity of detecting nodes which receive more than one message is analyzed, and potential source nodes set is selected by random walk with restart. Then, according to the similarity between potential source nodes and detecting nodes which receive no more than one message, sources locating is converted to clustering. Finally the sources are located using affinity propagation algorithm. We test and compare the DeMSS using real-world networks to demonstrate its better performance.
关 键 词:在线社会网络 源点定位 不确定源点数量 近邻传播算法
分 类 号:TN915.81[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.43