文章基本信息

标题：Constrained k Nearest Neighbor Query for Uncertain Object in the Network
本地全文：下载
作者：Gao Jun
期刊名称：International Journal of Hybrid Information Technology
印刷版ISSN：1738-9968
出版年度：2014
卷号：7
期号：5
页码：33-42
DOI：10.14257/ijhit.2014.7.5.04
出版社：SERSC
摘要：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.
关键词：Nearest neighbor query; Range constraint; Network; uncertain object; ; . ; - ; distance