不确定网络条件可信近邻查询CredibleNearest-电子与信息学报.PDFVIP

第 38 卷第 4 期 电 子 与 信 息 学 报 Vol.38No.4 2016 年 4 月 Journal of Electronics Information Technology Apr. 2016 不确定网络条件可信近邻查询 郭长友*①② 郑雪峰① 高秀莲② ①(北京科技大学计算机与通信工程学院 北京 100083) ②(德州学院 德州 253000) 摘 要：不确定因素在现实世界中普遍存在，因此研究不确定网络条件可信近邻查询具有重要意义。该文给出一种 新的解决方法。将不确定网络建模为不确定赋权图，定义不确定图的样本图，样本图指数，基础网络，可达路径长 度及可达路径期望长度，并给出基于不确定理论的高效不确定图条件可信近邻查询算法。将不确定网络上的近邻查 询等价地转化为基础网络上的近临查询问题。理论分析和实验结果表明所提可信近邻查询算法能够从非确定角度解 决不确定网络环境下的近邻查询问题。 关键词：不确定网络；不确定图；样本图指数；可信距离；基础网络 中图分类号： TP309.5 文献标识码： A 文章编号：1009-5896(2016)04-0811-08 DOI: 10.11999/JEIT150748 Credible Nearest Neighbor Query in Uncertain Network ①② ① ② GUO Changyou ZHENG Xuefeng GAO Xiulian ① (School of Computer and Communication Engineering, University of Science and Technology Beijing, Beijing 100083, China) ② (Dezhou University, Dezhou 253000, China) Abstract: Uncertain factors are a common phenomenon in the real world; therefore, it is very meaningful to study on the trusted neighbor query under uncertain network conditions. This paper puts forwards a new solution. The uncertain network is modeled as uncertain weighed graph, and these definitions of the uncertain graph are given, such as sample graph, sample graph index, base network, length of feasible path and expected length of feasible path. Based on these the high-efficiency credible neighbor query algorithm for uncertain graph is put forward under constraint conditions. This algorithm is tr