基于不确定数据的top-k概率相互最近邻查询*

不确定数据上的概率相互最近邻查询具有重要的实际应用，针对目前关于这方面的研究尚少，提出了不确定数据上的概率相互最近邻的top-k查询算法。首先对问题进行描述与定义，其次总结可行的裁剪规则,从而裁剪查询对象中未计算的实例点。通过实验表明，该算法能有效地降低最近邻查询中的I/O开销，提高查询的响应速度。

Top-k probabilistic mutual nearest neighbor query on uncertain data

Probabilistic mutual nearest neighbors query has important practical applications,but there are few researches about this problem so far.This paper proposed an algorithm to find the top-k probabilistic mutual nearest neighbors on uncertain data.First,described and formalized the problem.Second,proposed some pruning rules to cut some instances that were not need to be accessed in the query object.As the experimental results show that this algorithm can reduce the I/O cost effectively,and improve the response...