Results 61 to 70 of about 29,958 (160)

Scalable and rapid nearest neighbor particle search using adaptive disk sector.

PLoS ONE
In this paper, we propose a framework for efficiently accelerating Nearest Neighbor Particle (NNP) calculations in a movable particle-based system by leveraging the dynamic changes in disk sectors.
Jong-Hyun Kim, Jung Lee
doaj   +1 more source

Efficient Data Stream Clustering With Sliding Windows Based on Locality-Sensitive Hashing

IEEE Access, 2018
Data stream clustering over sliding windows generates clusters as the window moves. However, iterative clustering using all data in a window is highly inefficient in terms of memory use and computational load.
Jonghem Youn, Junho Shim, Sang-Goo Lee
doaj   +1 more source

Medical Image Retrieval via Nearest Neighbor Search on Pre-trained Image Features. [PDF]

Knowl Based Syst, 2023
Gupta D, Loane R, Gayen S, Demner-Fushman D.   +3 more
europepmc   +1 more source

An AkNN Algorithm for High-Dimensional Big Data

Dianxin kexue, 2015
A new variant of k nearest neighbor queries，which called as all k-nearest neighbor queries（AkNN），is a process to search the k nearest neighbors of each object in a data set.An AkNN query algorithm for high-dimensional big data on the Hadoop system was ...
Zhongwei Wang, Yefang Chen, Siyou Xiao, Jiangbo Qian   +3 more
doaj   +2 more sources

Cover Tree-Optimized Spectral Clustering: Efficient Nearest Neighbor Search for Large-Scale Data Partitioning

Machine Learning and Knowledge Extraction
Spectral clustering has established itself as a powerful technique for data partitioning across various domains due to its ability to handle complex cluster structures.
Abderrafik Laakel Hemdanou, Youssef Achtoun, Sara Mouali, Mohammed Lamarti Sefian, Vesna Šešum Čavić, Stojan Radenović   +5 more
doaj   +1 more source

A probabilistic molecular fingerprint for big data settings

Journal of Cheminformatics, 2018
Background Among the various molecular fingerprints available to describe small organic molecules, extended connectivity fingerprint, up to four bonds (ECFP4) performs best in benchmarking drug analog recovery studies as it encodes substructures with a ...
Daniel Probst, Jean-Louis Reymond
doaj   +1 more source

Exploring Composite Indexes for Domain Adaptation in Neural Machine Translation

Vietnam Journal of Computer Science
Domain adaptation in neural machine translation (NMT) tasks often involves working with datasets that have a different distribution from the training data.
Nhan Vo Minh, Khue Nguyen Tran Minh, Long H. B. Nguyen, Dien Dinh   +3 more
doaj   +1 more source

Text intelligent classification model based on improved KNN algorithm in library service transformation

Systems and Soft Computing
With the development of the digital age, library services are facing the challenge of fast and accurate text classification. The traditional K-nearest neighbor algorithm is limited by low classification efficiency and high computational complexity when ...
Changjun Wang, Fengxia You, Yu Wang
doaj   +1 more source

Group k- Nearest Neighbor Query Method for Uncertainty Data in Obstructed Spaces

Journal of Harbin University of Science and Technology, 2019
To deal with the problem of group k nearest neighbor query method for uncertainty data in obstructed spaces, this paper presents the method of the PkOGNN（probabilistic k obstructed group nearest neighbor）query .The PkOGNN query method mainly includes ...
WAN Jing, TANG Bei-bei, SUN Jian, HE Yun-bin, LI Song   +4 more
doaj   +1 more source

Comparative analysis of edge-based fractal image compression using nearest neighbor technique in various frequency domains

Alexandria Engineering Journal, 2018
In this paper, edge based fractal image compression is proposed for various frequency domains. Range and domain blocks of similar edge property are mapped to lowest DCT coefficient in a vertical and horizontal direction into 2D coordinate System.
Richa Gupta, Deepti Mehrotra, Rajesh Kumar Tyagi   +2 more
doaj   +1 more source