Results 71 to 80 of about 29,958 (160)

Confirmation sampling for exact nearest neighbor search [PDF]

open access: yes, 2020
Locality-sensitive hashing (LSH), introduced by Indyk and Motwani in STOC ’98, has been an extremely influential framework for nearest neighbor search in high-dimensional data sets. While theoretical work has focused on the approximate nearest neighbor problem, in practice LSH data structures with suitably chosen parameters are used to solve the exact ...
Christiani, Tobias Lybecker   +2 more
openaire   +1 more source

NNG-Based Secure Approximate k-Nearest Neighbor Query for Large Language Models

open access: yesMathematics
Large language models (LLMs) have driven transformative progress in artificial intelligence, yet critical challenges persist in data management and privacy protection during model deployment and training.
Heng Zhou   +3 more
doaj   +1 more source

Approximate nearest neighbor hybrid query algorithm based on tolerance factor

open access: yes大数据
Approximate nearest neighbor search (ANNS) is an important technique in the field of computer science for efficient similarity search, enabling fast information retrieval in large-scale datasets.With the increasing demand for high-precision information ...
Guangfu HE   +5 more
doaj  

Nearest neighbor search algorithm for high dimensional data based on weighted self-taught hashing

open access: yesDianxin kexue, 2017
Because of efficiency in query and storage,learning hash is applied in solving the nearest neighbor search problem.The learning hash usually converts high-dimensional data into binary codes.In this way,the similarities between binary codes from two ...
Cong PENG   +3 more
doaj   +2 more sources

Bagging Nearest Neighbor and its Enhancement for Machinery Predictive Maintenance

open access: yesJournal of Applied Informatics and Computing
K-nearest Neighbor is a simple algorithm in Machine learning for such a prediction classification task which plays in valuable aspects of understanding big data.
Muhammad Irfan Arisani, Muljono Muljono
doaj   +1 more source

Improved Kd-tree Particle Nearest Neighbor Search Based on Automatic Termination Criterion

open access: yes工程科学与技术
Objective In large-scale motion simulation problems, the search efficiency for nearest neighbor points critically influences the overall operational efficiency.
Ting ZHANG   +3 more
doaj  

scSpecies: enhancement of network architecture alignment in comparative single-cell studies. [PDF]

open access: yesGenome Biol
Schächter C   +5 more
europepmc   +1 more source

Home - About - Disclaimer - Privacy