Top-k probabilistic mutual nearest neighbor query on uncertain data
Liang Yu · Jisuanji yingyong yanjiu · 2011
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 speed.