Results 41 to 50 of about 29,958 (160)
Clustering-based Nearest Neighbor Searching
Journal of Computers, 2013 This paper proposes a Clustering-based Nearest Neighbor Search algorithm (CNNS) for high dimensional data. Different from existing approaches that are based on rigid-grid partition to develop data access structure, CNNS creates indexing structures according to data inherent distribution, with help of a progressive-styled clustering operation. The grids
Ping Ling +2 more
openaire +1 more source
Tongxin xuebao, 2014 A novel distributed near neighbor search algorithm that makes use of real-time traffic information is presented.The geographic information are stored in the nearest smart camera using Voronoi partition,and cameras are located in the intersection.The ...
Chen YE, Zhen-yu YANG, Jian YU, Qi LONG
doaj +2 more sources
Big Data and Cognitive Computing, 2022 Due to the ubiquitous nature of CCTV cameras that record continuously, there is a large amount of video data that are unstructured. Often, when these recordings have to be reviewed, it is to look for a specific person that fits a certain description ...
Sumeth Yuenyong +1 more
doaj +1 more source
Ranked Reverse Nearest Neighbor Search
IEEE Transactions on Knowledge and Data Engineering, 2008 Given a set of data points P and a query point q in a multidimensional space, reverse nearest neighbor (RNN) query finds data points in P whose nearest neighbors are q. Reverse k-nearest neighbor (RkNN) query (where k ges 1) generalizes RNN query to find data points whose kNNs include q.
LEE, Ken C. K. +2 more
openaire +3 more sources
Fast Adaptive Approximate Nearest Neighbor Search with Cluster-Shaped Indices
Big Data and Cognitive ComputingIn this study, we propose a novel adaptive algorithm for approximate nearest neighbor (ANN) search, based on the inverted file (IVF) index (cluster-based index) and online query complexity classification.
Vladimir Kazakovtsev +8 more
doaj +1 more source
Secure and efficient approximate nearest neighbors search [PDF]
Proceedings of the first ACM workshop on Information hiding and multimedia security, 2013 This paper presents a moderately secure but very efficient approximate nearest neighbors search. After detailing the threats pertaining to the "honest but curious" model, our approach starts from a state-of-the-art algorithm in the domain of approximate nearest neighbors search. We gradually develop mechanisms partially blocking the attacks threatening
Mathon, Benjamin +3 more
openaire +1 more source
Reference-Vector Removed Product Quantization for Approximate Nearest Neighbor Search
Applied SciencesThis paper proposes a decorrelation scheme based on product quantization, termed Reference-Vector Removed Product Quantization (RvRPQ), for approximate nearest neighbor (ANN) search.
Yang Wang, Ce Xu, Xueyi Wu
doaj +1 more source
Approximate k -flat Nearest Neighbor Search [PDF]
Proceedings of the forty-seventh annual ACM symposium on Theory of Computing, 2015 Let $k$ be a nonnegative integer. In the approximate $k$-flat nearest neighbor ($k$-ANN) problem, we are given a set $P \subset \mathbb{R}^d$ of $n$ points in $d$-dimensional space and a fixed approximation factor $c > 1$. Our goal is to preprocess $P$ so that we can efficiently answer approximate $k$-flat nearest neighbor queries: given a $k$-flat $
Mulzer, Wolfgang +3 more
openaire +2 more sources
LK-Index: A Learned Index for KNN Queries
IEEE AccessThe k-Nearest Neighbor (kNN) search is a crucial problem in database and data mining, especially in high-dimensional space. However, traditional kNN algorithms based on distance metrics and brute-force search often have low search efficiency and accuracy,
Yongxin Peng
doaj +1 more source
Reverse Nearest Neighbors Search in Ad Hoc Subspaces [PDF]
IEEE Transactions on Knowledge and Data Engineering, 2006 Udgivelsesdato ...
Yiu, ML, Mamoulis, N
openaire +7 more sources