• Title/Summary/Keyword: Nearest neighbor algorithm

Search Result 332, Processing Time 0.032 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.

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.

An Approximate k-Nearest Neighbor Search Algorithm for Content- Based Multimedia Information Retrieval (내용 기반 멀티미디어 정보 검색을 위한 근사 k-최근접 데이타 탐색 알고리즘)

  • Song, Kwang-Taek;Chang, Jae-Woo
    • Journal of KIISE:Databases
    • /
    • v.27 no.2
    • /
    • pp.199-208
    • /
    • 2000
  • The k-nearest neighbor search query based on similarity is very important for content-based multimedia information retrieval(MIR). The conventional exact k-nearest neighbor search algorithm is not efficient for the MIR application because multimedia data should be represented as high dimensional feature vectors. Thus, an approximate k-nearest neighbor search algorithm is required for the MIR applications because the performance increase may outweigh the drawback of receiving approximate results. For this, we propose a new approximate k-nearest neighbor search algorithm for high dimensional data. In addition, the comparison of the conventional algorithm with our approximate k-nearest neighbor search algorithm is performed in terms of retrieval performance. Results show that our algorithm is more efficient than the conventional ones.

  • PDF

A Method for k Nearest Neighbor Query of Line Segment in Obstructed Spaces

  • Zhang, Liping;Li, Song;Guo, Yingying;Hao, Xiaohong
    • Journal of Information Processing Systems
    • /
    • v.16 no.2
    • /
    • pp.406-420
    • /
    • 2020
  • In order to make up the deficiencies of the existing research results which cannot effectively deal with the nearest neighbor query based on the line segments in obstacle space, the k nearest neighbor query method of line segment in obstacle space is proposed and the STA_OLkNN algorithm under the circumstance of static obstacle data set is put forward. The query process is divided into two stages, including the filtering process and refining process. In the filtration process, according to the properties of the line segment Voronoi diagram, the corresponding pruning rules are proposed and the filtering algorithm is presented. In the refining process, according to the relationship of the position between the line segments, the corresponding distance expression method is put forward and the final result is obtained by comparing the distance. Theoretical research and experimental results show that the proposed algorithm can effectively deal with the problem of k nearest neighbor query of the line segment in the obstacle environment.

Nearest neighbor and validity-based clustering

  • Son, Seo H.;Seo, Suk T.;Kwon, Soon H.
    • International Journal of Fuzzy Logic and Intelligent Systems
    • /
    • v.4 no.3
    • /
    • pp.337-340
    • /
    • 2004
  • The clustering problem can be formulated as the problem to find the number of clusters and a partition matrix from a given data set using the iterative or non-iterative algorithms. The author proposes a nearest neighbor and validity-based clustering algorithm where each data point in the data set is linked with the nearest neighbor data point to form initial clusters and then a cluster in the initial clusters is linked with the nearest neighbor cluster to form a new cluster. The linking between clusters is continued until no more linking is possible. An optimal set of clusters is identified by using the conventional cluster validity index. Experimental results on well-known data sets are provided to show the effectiveness of the proposed clustering algorithm.

A Computer Programming for the Analysis of Crystal Structures (결정 구조들의 해석을 위한 컴퓨터 프로그래밍)

  • Kim, Jin-Hui
    • The Transactions of the Korea Information Processing Society
    • /
    • v.7 no.3
    • /
    • pp.872-878
    • /
    • 2000
  • In this paper a computer programming for the expression of nearest neighbor atoms in face-centered cubic (FCC) and body-centered cubic (BCC) crystals was suggested as one of the approaches to understand each of the crystal structure. By using this computer programming the distance values between a reference atom and the nearest neighbor atoms, and the numbers of the nearest neighbor atoms were calculated ane compared for the FCC and BCC crystals. In this algorithm, the positions of the atoms in a crystal were defined as two categories: the corner atoms and face- or body-centered atoms, and considered respectively. For the same order of nearest neighbor atoms except the second order ones the distance values form the reference atom were smaller in the FCC crystals than those in the BCC. Also, the numbers of he first and third nearest neighbor atoms n the FCC crystals were larger than those in the BCC. This difference was explained by the comparison of each atomic packing ratio of the FCC and BCC crystals. The algorithm used in this programming can also be expanded to the analysis of other crystal structures.

  • PDF

Learning Reference Vectors by the Nearest Neighbor Network (최근점 이웃망에의한 참조벡터 학습)

  • Kim Baek Sep
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.31B no.7
    • /
    • pp.170-178
    • /
    • 1994
  • The nearest neighbor classification rule is widely used because it is not only simple but the error rate is asymptotically less than twice Bayes theoretical minimum error. But the method basically use the whole training patterns as the reference vectors. so that both storage and classification time increase as the number of training patterns increases. LVQ(Learning Vector Quantization) resolved this problem by training the reference vectors instead of just storing the whole training patterns. But it is a heuristic algorithm which has no theoretic background there is no terminating condition and it requires a lot of iterations to get to meaningful result. This paper is to propose a new training method of the reference vectors. which minimize the given error function. The nearest neighbor network,the network version of the nearest neighbor classification rule is proposed. The network is funtionally identical to the nearest neighbor classification rule is proposed. The network is funtionally identical to the nearest neighbor classification rule and the reference vectors are represented by the weights between the nodes. The network is trained to minimize the error function with respect to the weights by the steepest descent method. The learning algorithm is derived and it is shown that the proposed method can adjust more reference vectors than LVQ in each iteration. Experiment showed that the proposed method requires less iterations and the error rate is smaller than that of LVQ2.

  • PDF

A Distributed Nearest Neighbor Heuristic with Bounding Function (분기 함수를 적용한 분산 최근접 휴리스틱)

  • Kim, Jung-Sook
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.29 no.7
    • /
    • pp.377-383
    • /
    • 2002
  • The TSP(Traveling Salesman Problem) has been known as NP-complete, there have been various studies to find the near optimal solution. The nearest neighbor heuristic is more simple than the other algorithms which are to find the optimal solution. This paper designs and implements a new distributed nearest neighbor heuristic with bounding function for the TSP using the master/slave model of PVM(Parallel Virtual Machine). Distributed genetic algorithm obtains a near optimal solution and distributed nearest neighbor heuristic finds an optimal solution for the TSP using the near optimal value obtained by distributed genetic algorithm as the initial bounding value. Especially, we get more speedup using a new genetic operator in the genetic algorithm.

In-Route Nearest Neighbor Query Processing Algorithm with Time Constraint in Spatial Network Databases (공간 네트워크 데이터베이스에서 시간제약을 고려한 경로 내 최근접 질의처리 알고리즘)

  • Kim, Yong-Ki;Kim, Sang-Mi;Chang, Jae-Woo
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.14 no.2
    • /
    • pp.196-200
    • /
    • 2008
  • Recently, the query processing algorithm in spatial network database (SNDB) has attracted many interests. However, there is little research on route-based query processing algorithm in SNDB. Since the moving objects moves only in spatial networks, the route-based algorithm is very useful for LBS and Telematics applications. In this paper, we analyze In-Route Nearest Neighbor (IRNN) query, which is an typical one of route-based queries, and propose a new IRNN query processing algorithm with time constraint. In addition, we show from our performance analysis that our IRNN query processing algorithm with time constraint is better on retrieval performance than the existing IRNN query processing one.

In-Route Nearest Neighbor Query Processing Algorithm with Space-constraint in Spatial Network Databases (공간 네트워크 데이터베이스에서 공간 제약을 고려한 경로 내 최근접 질의처리 알고리즘)

  • Kim, Yong-Ki;Kim, Ah-Reum;Chang, Jae-Woo
    • Journal of Korea Spatial Information System Society
    • /
    • v.10 no.3
    • /
    • pp.19-30
    • /
    • 2008
  • Recently, the query processing algorithm in the field of spatial network database(SNDB) has been attracted by many Interests. But, there is little research on route-based queries. Since the moving objects move only in spatial networks, the efficient route-based query processing algorithms, like in-route nearest neighbor(IRNN), are essential for Location-based Service(LBS) and Telematics application. However, the existing IRNN query processing algorithm has a problem that it does not consider traffic jams in the road network. In this thesis, we propose an IRNN query processing algorithm which considers space restriction. Finally, we show that space-constrained IRNN query processing algorithm is efficient compared with the existing IRNN algorithm.

  • PDF