[HTML][HTML] Survey on exact kNN queries over high-dimensional data space

N Ukey, Z Yang, B Li, G Zhang, Y Hu, W Zhang - Sensors, 2023 - mdpi.com
k nearest neighbours (kNN) queries are fundamental in many applications, ranging from
data mining, recommendation system and Internet of Things, to Industry 4.0 framework …

A meta-learning configuration framework for graph-based similarity search indexes

RS Oyamada, LC Shimomura, S Barbon Jr… - Information Systems, 2023 - Elsevier
Similarity searches retrieve elements in a dataset with similar characteristics to the input
query element. Recent works show that graph-based methods have outperformed others in …

[HTML][HTML] Efficient continuous kNN join over dynamic high-dimensional data

N Ukey, G Zhang, Z Yang, B Li, W Li, W Zhang - World Wide Web, 2023 - Springer
Given a user dataset U and an object dataset I, a kNN join query in high-dimensional space
returns the k nearest neighbors of each object in dataset U from the object dataset I. The …

kNN Join for Dynamic High-Dimensional Data: A Parallel Approach

N Ukey, Z Yang, W Yang, B Li, R Li - Australasian Database Conference, 2023 - Springer
The k nearest neighbor (kNN) join operation is a fundamental task that combines two high-
dimensional databases, enabling data points in the User dataset U to identify their k nearest …

A Simple, Fast Algorithm for Continual Learning from High-Dimensional Data

N Ashtekar, VG Honavar - 2023 - openreview.net
As an alternative to resource-intensive deep learning approaches to the continual learning
problem, we propose a simple, fast algorithm inspired by adaptive resonance theory (ART) …

[PDF][PDF] E cient Continuous kNN Join over Dynamic High-dimensional Data

N Ukey, G Zhang, Z Yang, B Li, W Li, W Zhang - scholar.archive.org
Given a user dataset U and an object dataset I, a kNN join query in high-dimensional space
returns the k nearest neighbors of each object in dataset U from the object dataset I. The …