Associative Memories to Accelerate Approximate Nearest Neighbor Search
Applied Sciences, 2018 Nearest neighbor search is a very active field in machine learning. It appears in many application cases, including classification and object retrieval.
Vincent Gripon +2 more
doaj +1 more source
Turbo similarity searching: effect of fingerprint and dataset on virtual-screening performance. [PDF]
, 2009 Turbo similarity searching uses information about the nearest neighbors in a conventional chemical similarity search to increase the effectiveness of virtual screening with a data fusion approach being used to combine the nearest-neighbor information.
Barker +34 more
core +1 more source
HDIdx: High-Dimensional Indexing for Efficient Approximate Nearest Neighbor Search [PDF]
, 2015 Fast Nearest Neighbor (NN) search is a fundamental challenge in large-scale data processing and analytics, particularly for analyzing multimedia contents which are often of high dimensionality. Instead of using exact NN search, extensive research efforts
Hoi, Steven C. H. +5 more
core +3 more sources
Approximate Nearest Neighbor Search in Metrics of Planar Graphs [PDF]
, 2015 We investigate the problem of approximate Nearest-Neighbor Search (NNS) in graphical metrics: The task is to preprocess an edge-weighted graph G=(V,E) on m vertices and a small "dataset" D subset V of size n
Abraham, Ittai +3 more
core +1 more source
Nearest Neighbor Search in the Metric Space of a Complex Network for Community Detection
Information, 2016 The objective of this article is to bridge the gap between two important research directions: (1) nearest neighbor search, which is a fundamental computational tool for large data analysis; and (2) complex network analysis, which deals with large real ...
Suman Saha, Satya P. Ghrera
doaj +1 more source
Complementary hashing for approximate nearest neighbor search [PDF]
2011 International Conference on Computer Vision, 2011 Recently, hashing based Approximate Nearest Neighbor (ANN) techniques have been attracting lots of attention in computer vision. The data-dependent hashing methods, e.g., Spectral Hashing, expects better performance than the data-blind counterparts, e.g., Locality Sensitive Hashing (LSH).
null Hao Xu +5 more
openaire +1 more source
A New Meta-Heuristic Algorithm Based on Tabu Search for the Job Scheduling Problem in a Fog-Cloud system [PDF]
مجله مدل سازی در مهندسی, 2020 Today, with the expansion of communications and the high volume of data, the need for processing them at a low time and high speed has increased. On the other hand, conducting this high volume of computing operations requires systems with high processing
Seydeh Samira Mohammadi, Mahmood Deypir
doaj +1 more source
Balancing clusters to reduce response time variability in large scale image search [PDF]
, 2010 Many algorithms for approximate nearest neighbor search in high-dimensional spaces partition the data into clusters. At query time, in order to avoid exhaustive search, an index selects the few (or a single) clusters nearest to the query point.
Amsaleg, Laurent +2 more
core +7 more sources
Binary Hashing for Approximate Nearest Neighbor Search on Big Data: A Survey
IEEE Access, 2018 Nearest neighbor search is a fundamental problem in various domains, such as computer vision, data mining, and machine learning. With the explosive growth of data on the Internet, many new data structures using spatial partitions and recursive hyperplane
Yuan Cao +6 more
doaj +1 more source
OPRCP: approximate nearest neighbor binary search algorithm for hybrid data over WMSN blockchain
EURASIP Journal on Wireless Communications and Networking, 2018 In order to prevent sensitive data tampering in the application of security monitoring, intelligent traffic, and other sensitive Internet of Things, the research on WMSN (wireless multimedia sensor networks) application system based on blockchain and ...
Huakun Liu +5 more
doaj +1 more source