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.

목차

Abstract
 1. Introduction
 2. Basic Concepts
 3. Calculation of Credible Distance
 4. Query of the Credible k-nearest Neighbor
 5. Experimental Evaluation
 6. Conclusion
 Acknowledgements
 References

키워드

저자

• Gao Jun [ College of Computer Science and Technology, Harbin University of Science and Technology, Heilonjiang, China ]

참고문헌

발행기관

간행물

표지보기 관심저널 등록

• 간행물명

  International Journal of Grid and Distributed Computing

• 간기

  격월간

• pISSN

  2005-4262

• 수록기간

  2008~2016

• 십진분류

  KDC 505 DDC 605