Earticle

초록

영어

Constrained k nearest neighbor query for uncertain object in the network is to find k uncertain objects which are the k nearest neighbors with range constraint of the query object in the network. For solving this problem, the uncertain object is modeled as the fuzzy object and the network α-distance between fuzzy objects in the network is defined. Base on them, the concept of constrained k nearest neighbor query for fuzzy object in the network is put forward, and according to the query sequence two query algorithms are proposed. One is by using minimum and maximum α-distance between fuzzy object and range constraint to reduce the search area. The other is by using that Euclidean distance can be computed easily and it is the lower bound of the network distance to decline the complexity. Experimental results show that two algorithms have different performance in different condition.

목차

Abstract
 1. Introduction
 2. Basic Concepts
 3. Storage of the Data
  3.1. Storage of the Network
  3.2. Storage of the Network Fuzzy Object
 4. Constrained Nearest Neighbor Query for Fuzzy Object in the Network
  4.1. The Method of NN-C
  4.2. The Method of C-NN
 5. Experimental Evaluation
 6. Conclusion
 References

키워드

저자

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

참고문헌

발행기관

간행물

표지보기 관심저널 등록

• 간행물명

  International Journal of Hybrid Information Technology

• 간기

  격월간

• pISSN

  1738-9968

• 수록기간

  2008~2016

• 십진분류

  KDC 505 DDC 605