首页    期刊浏览 2024年10月06日 星期日
登录注册

文章基本信息

  • 标题:Credible Nearest Neighbor Query in Uncertain Network
  • 本地全文:下载
  • 作者:Gao Jun
  • 期刊名称:International Journal of Grid and Distributed Computing
  • 印刷版ISSN:2005-4262
  • 出版年度:2014
  • 卷号:7
  • 期号:1
  • 页码:13-20
  • 出版社:SERSC
  • 摘要: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
  • 关键词:Credible k-nearest-neighbor; Uncertain network; Credible distance; Fuzzy ;simulation; Priority queue
国家哲学社会科学文献中心版权所有