查询结果:   黄冬梅,邓斌,赵丹枫.带权不确定图的K最近邻查询算法[J].计算机应用与软件,2016,33(2):212 - 216,263.
中文标题
带权不确定图的K最近邻查询算法
发表栏目
算法
摘要点击数
637
英文标题
K-NEAREST NEIGHBOURS QUERY IN WEIGHTED UNCERTAIN GRAPH
作 者
黄冬梅 邓斌 赵丹枫 Huang Dongmei Deng Bin Zhao Danfeng
作者单位
上海海洋大学信息学院 上海 201306     
英文单位
College of Information,Shanghai Ocean University,Shanghai 201306,China     
关键词
复杂网络 不确定数据 K最近邻查询 带权不确定图 子图
Keywords
Complex network Uncertain data K-nearest neighbours query Weighted uncertain graph Subgraph
基金项目
国家自然科学基金项目(61272098)
作者资料
黄冬梅,教授,主研领域:海洋大数据,WebGis等。邓斌,硕士生。赵丹枫,讲师。 。
文章摘要
社交、移动等复杂网络节点接入的不确定性给数据查询处理带来了新的挑战。K最近邻查询是社交、移动网络中经常用到的操作。已有的方法首先将网络映射为不确定图,然后,考虑边只含有概率信息的情况。讨论了K最近邻查询方法,没有考虑权重信息,具有局限性。针对这个问题,定义了带权不确定子图和ProWeiDist距离,兼顾权重和概率两个要素,提出了针对带权不确定图的K最近邻查询算法,并对算法进行优化。实验结果表明,SubDistK算法能有效地解决K最近邻查询问题。
Abstract
Uncertainty of nodes accessing in complex social and mobile networks brings new challenge to data query and processing. K-nearest neighbours query is an operation frequently used over these complex networks. Existing methods map the network to uncertain graph first, and they consider the situation of containing the probability information only.Discussing the K-nearest neighbours query method but do not consider the weight information, therefore have limitations. In view of this problem, we defined the weighted uncertain subgraph and ProWeiDist distance, and proposed a K-nearest neighbours query algorithm targeted at the weighted uncertain graph by incorporating both probability and weight, and further optimised the algorithm. Experimental results demonstrated that the SubDistK algorithm can effectively solve K-Nearest neighbours query problem.
下载PDF全文