earticle

영어

K-nearest-neighbor query is an important query in uncertain network, which is finding the k close nodes to a specific node. We first put forward the concept of the credible nearest neighbor query in uncertain network, and give credible k-nearest-neighbor query algorithm. Credible distance is used to describe the distance between nodes in uncertain network. Fuzzy simulation is adopted to decrease the problem difficulty. Network distance constraint is used to reduce the searching space. Priority queue is used to fast find k-nearest-neighbor query result. Theoretical analysis and experimental results show that our approximation algorithm can well solve k-nearest- neighbor query problem under the uncertain network.