不确定网络条件可信近邻查询  

Credible Nearest Neighbor Query in Uncertain Network

作　　者：郭长友[1,2] 郑雪峰[1] 高秀莲[2] 

机构地区：[1]北京科技大学计算机与通信工程学院,北京100083 [2]德州学院,德州253000

出　　处：《电子与信息学报》2016年第4期811-818,共8页Journal of Electronics & Information Technology

基　　金：国家自然科学基金(61163025);北京市重点实验室2012年度阶梯计划项目(Z121101002812005)~~

摘　　要：不确定因素在现实世界中普遍存在,因此研究不确定网络条件可信近邻查询具有重要意义。该文给出一种新的解决方法。将不确定网络建模为不确定赋权图,定义不确定图的样本图,样本图指数,基础网络,可达路径长度及可达路径期望长度,并给出基于不确定理论的高效不确定图条件可信近邻查询算法。将不确定网络上的近邻查询等价地转化为基础网络上的近临查询问题。理论分析和实验结果表明所提可信近邻查询算法能够从非确定角度解决不确定网络环境下的近邻查询问题。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 transforms the issue of neighbor query in the uncertain network equivalently to the issue of neighbor query in the base network. The theoretic analysis and experimental results show that the credible neighbor query algorithm proposed in the paper can solve the neighbor query problem in the environment of the uncertain network from non-deterministic perspective.

关 键 词：不确定网络 不确定图 样本图指数 可信距离 基础网络 

分 类 号：TP309.5[自动化与计算机技术—计算机系统结构]