• Title/Summary/Keyword: nearest neighbor

Search Result 830, Processing Time 0.026 seconds

The privacy protection algorithm of ciphertext nearest neighbor query based on the single Hilbert curve

  • Tan, Delin;Wang, Huajun
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.16 no.9
    • /
    • pp.3087-3103
    • /
    • 2022
  • Nearest neighbor query in location-based services has become a popular application. Aiming at the shortcomings of the privacy protection algorithms of traditional ciphertext nearest neighbor query having the high system overhead because of the usage of the double Hilbert curves and having the inaccurate query results in some special circumstances, a privacy protection algorithm of ciphertext nearest neighbor query which is based on the single Hilbert curve has been proposed. This algorithm uses a single Hilbert curve to transform the two-dimensional coordinates of the points of interest into Hilbert values, and then encrypts them by the order preserving encryption scheme to obtain the one-dimensional ciphertext data which can be compared in numerical size. Then stores the points of interest as elements composed of index value and the ciphertext of the other information about the points of interest on the server-side database. When the user needs to use the nearest neighbor query, firstly calls the approximate nearest neighbor query algorithm proposed in this paper to query on the server-side database, and then obtains the approximate nearest neighbor query results. After that, the accurate nearest neighbor query result can be obtained by calling the precision processing algorithm proposed in this paper. The experimental results show that this privacy protection algorithm of ciphertext nearest neighbor query which is based on the single Hilbert curve is not only feasible, but also optimizes the system overhead and the accuracy of ciphertext nearest neighbor query result.

A probabilistic nearest neighbor filter incorporating numbers of validated measurements

  • Sang J. Shin;Song, Taek-Lyul;Ahn, Jo-Young
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2002.10a
    • /
    • pp.82.1-82
    • /
    • 2002
  • $\textbullet$ Nearest neighbor filter $\textbullet$ Probabilistic nearest neighbor filter $\textbullet$ Probabilistic nearest neighbor filter incorporating numbers of validated measurements $\textbullet$ Probability density function of the NDS $\textbullet$ Simulation results in a clutter environment to verify the performances $\textbullet$ Sensitivity analysis for the unknown spatial clutter density

  • PDF

On the Use of Sequential Adaptive Nearest Neighbors for Missing Value Imputation (순차 적응 최근접 이웃을 활용한 결측값 대치법)

  • Park, So-Hyun;Bang, Sung-Wan;Jhun, Myoung-Shic
    • The Korean Journal of Applied Statistics
    • /
    • v.24 no.6
    • /
    • pp.1249-1257
    • /
    • 2011
  • In this paper, we propose a Sequential Adaptive Nearest Neighbor(SANN) imputation method that combines the Adaptive Nearest Neighbor(ANN) method and the Sequential k-Nearest Neighbor(SKNN) method. When choosing the nearest neighbors of missing observations, the proposed SANN method takes the local feature of the missing observations into account as well as reutilizes the imputed observations in a sequential manner. By using a Monte Carlo study and a real data example, we demonstrate the characteristics of the SANN method and its potential performance.

Locality-Sensitive Hashing Techniques for Nearest Neighbor Search

  • Lee, Keon Myung
    • International Journal of Fuzzy Logic and Intelligent Systems
    • /
    • v.12 no.4
    • /
    • pp.300-307
    • /
    • 2012
  • When the volume of data grows big, some simple tasks could become a significant concern. Nearest neighbor search is such a task which finds from a data set the k nearest data points to queries. Locality-sensitive hashing techniques have been developed for approximate but fast nearest neighbor search. This paper introduces the notion of locality-sensitive hashing and surveys the locality-sensitive hashing techniques. It categories them based on several criteria, presents their characteristics, and compares their performance.

Fuzzy Kernel K-Nearest Neighbor Algorithm for Image Segmentation (영상 분할을 위한 퍼지 커널 K-nearest neighbor 알고리즘)

  • Choi Byung-In;Rhee Chung-Hoon
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.15 no.7
    • /
    • pp.828-833
    • /
    • 2005
  • Kernel methods have shown to improve the performance of conventional linear classification algorithms for complex distributed data sets, as mapping the data in input space into a higher dimensional feature space(7). In this paper, we propose a fuzzy kernel K-nearest neighbor(fuzzy kernel K-NN) algorithm, which applies the distance measure in feature space based on kernel functions to the fuzzy K-nearest neighbor(fuzzy K-NN) algorithm. In doing so, the proposed algorithm can enhance the Performance of the conventional algorithm, by choosing an appropriate kernel function. Results on several data sets and segmentation results for real images are given to show the validity of our proposed algorithm.

The Processing Method of Nearest Neighbor Queries Considering a Circular Location Property of Object (객체의 순환적 위치속성을 고려한 최대근접질의의 처리방법)

  • Seon, Hwi-Joon
    • Journal of Korea Spatial Information System Society
    • /
    • v.11 no.4
    • /
    • pp.85-88
    • /
    • 2009
  • In multimedia database systems, the nearest neighbor Query occurs frequently and requires the processing cost higher than other spatial Queries do. It needs the measurement of search distance that the number of searched nodes and the computation time in an index can be minimized for optimizing the cost of processing the nearest neighbor query. The circular location property of objects is considered to accurately select the nodes which will be searched in the nearest neighbor query. In this paper, we propose the processing method of nearest neighbor queries be considered a circular location property of object where the search space consists of a circular domain and show its characteristics. The proposed method uses the circular minimum distance and the circular optimal distance, the search measurement for optimizing the processing cost of nearest neighbor queries.

  • PDF

Performance Improvement of Information Retrieval System using Fuzzy K-Nearest Neighbor (퍼지 K-Nearest Neighbor에 의한 정보검색시스템의 성능 향상)

  • Hyun Woo-Seok
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 2005.04a
    • /
    • pp.367-369
    • /
    • 2005
  • 현대인들이 계속 쏟아지는 정보로부터 자신에게 필요한 정보만을 제한된 시간 안에 검색하는 일은 쉬운 일이 아니다. 컴퓨터를 이용하여 제한된 시간 내에 원하는 정보를 검색하고자 하는 정보검색 분야에서는 성능을 향상시키기 위한 연구가 활발히 진행되어 오고 있다. 본 논문에서는 정보검색 시스템의 성능을 향상시키고자 퍼지 K-Nearest Neighbor에 의한 정보검색시스템(IRS-FKNN: Information Retrieval System using Fuzzy K-Nearest Neighbor)을 제안한다. 제안하는 시스템은 기존의 시스템과 비교했을 때 검색결과의 신뢰성을 높이게 되어 시스템의 성능을 향상시키게 되었다.

  • PDF

An Interval Type-2 Fuzzy K-Nearest Neighbor (Interval 제2종 퍼지 K-Nearest Neighbor)

  • 황철;이정훈
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 2002.12a
    • /
    • pp.271-274
    • /
    • 2002
  • 본 논문은 (1)에 기술된 퍼지 K-nearest neighbor(NN) 알고리즘의 확장인 interval 제2종 퍼지 K-NN을 제안한다. 제안된 방법에서는, 각 패턴벡터의 멤버쉽 값들에 불확실성(Uncertainty)을 할당하는 것에 의해 interval 제2종 퍼지 멤버쉽으로의 확장을 시도한다. 이러한 확장은, K의 결정에 존재하는 불확실성은 다루고, 조정할 수 있게 한다.

The Method to Process Nearest Neighbor Queries Using an Optimal Search Distance (최적탐색거리를 이용한 최근접질의의 처리 방법)

  • Seon, Hwi-Joon;Hwang, Bu-Hyun;Ryu, Keun-Ho
    • The Transactions of the Korea Information Processing Society
    • /
    • v.4 no.9
    • /
    • pp.2173-2184
    • /
    • 1997
  • Among spatial queries handled in spatial database systems, nearest neighbor queries to find the nearest spatial object from the given locaion occur frequently. The number of searched nodes in an index must be minimized in order to increase the performance of nearest neighbor queries. An Existing approach considered only the processing of an nearest neighbor query in a two-dimensional search space and could not optimize the number of searched nodes accurately. In this paper, we propose the optimal search distance and prove its properties. The proposed optimal search distance is the measurement of a new search distance for accurately selecting the nodes which will be searched in processing nearest neighbor queries. We present an algorithm for processing the nearest neighbor query by applying the optimal search distance to R-trees and prove that the result of query processing is correcter than the existing approach.

  • PDF

k-Nearest Neighbor Classifier using Local Values of k (지역적 k값을 사용한 k-Nearest Neighbor Classifier)

  • 이상훈;오경환
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2003.10a
    • /
    • pp.193-195
    • /
    • 2003
  • 본 논문에서는 k-Nearest Neighbor(k-NN) 알고리즘을 최적화하기 위해 지역적으로 다른 k(고려할 neighbor의 개수)를 사용하는 새로운 방법을 제안한다. 인스턴스 공간(instance space)에서 노이즈(noise)의 분포가 지역적(local)으로 다를 경우, 각 지점에서 고려해야 할 최적의 이웃 인스턴스(neighbor)의 수는 해당 지점에서의 국부적인 노이즈 분포에 따라 다르다. 그러나 기존의 방법은 전체 인스턴스 공간에 대해 동일한 k를 사용하기 때문에 이러한 인스턴스 공간의 지역적인 특성을 고려하지 못한다. 따라서 본 논문에서는 지역적으로 분포가 다른 노이즈 문제를 해결하기 위해 인스턴스 공간을 여러 개의 부분으로 나누고, 각 부분에 최적화된 k의 값을 사용하여 kNN을 수행하는 새로운 방법인 Local-k Nearest Neighbor 알고리즘(LkNN Algorithm)을 제안한다. LkNN을 통해 생성된 k의 집합은 인스턴스 공간의 각 부분을 대표하는 값으로, 해당 지역의 인스턴스가 고려해야 할 이웃(neighbor)의 수를 결정지어준다. 제안한 알고리즘에 적합한 데이터의 도메인(domain)과 그것의 향상된 성능은 UCI ML Data Repository 데이터를 사용한 실험을 통해 검증하였다.

  • PDF