Neighborhood classifiers

Q Hu, D Yu, Z Xie - Expert systems with applications, 2008 - Elsevier
K nearest neighbor classifier (K-NN) is widely discussed and applied in pattern recognition
and machine learning, however, as a similar lazy classifier using local information for …

Indexing metric spaces for exact similarity search

L Chen, Y Gao, X Song, Z Li, Y Zhu, X Miao… - ACM Computing …, 2022 - dl.acm.org
With the continued digitization of societal processes, we are seeing an explosion in
available data. This is referred to as big data. In a research setting, three aspects of the data …

A survey on big IoT data indexing: Potential solutions, recent advancements, and open issues

Z Kouahla, AE Benrazek, MA Ferrag, B Farou, H Seridi… - Future Internet, 2021 - mdpi.com
The past decade has been characterized by the growing volumes of data due to the
widespread use of the Internet of Things (IoT) applications, which introduced many …

Index-driven similarity search in metric spaces (survey article)

GR Hjaltason, H Samet - ACM Transactions on Database Systems …, 2003 - dl.acm.org
Similarity search is a very important operation in multimedia databases and other database
applications involving complex objects, and involves finding objects in a data set S similar to …

DITA: Distributed in-memory trajectory analytics

Z Shang, G Li, Z Bao - … of the 2018 International Conference on …, 2018 - dl.acm.org
Trajectory analytics can benefit many real-world applications, eg, frequent trajectory based
navigation systems, road planning, car pooling, and transportation optimizations. Existing …

Distributed trajectory similarity search

D Xie, F Li, JM Phillips - Proceedings of the VLDB Endowment, 2017 - dl.acm.org
Mobile and sensing devices have already become ubiquitous. They have made tracking
moving objects an easy task. As a result, mobile applications like Uber and many IoT …

Sampling-based A* algorithm for robot path-planning

SM Persson, I Sharf - The International Journal of Robotics …, 2014 - journals.sagepub.com
This paper presents a generalization of the classic A* algorithm to the domain of sampling-
based motion planning. The root assumptions of the A* algorithm are examined and …

Identifying similarities, periodicities and bursts for online search queries

M Vlachos, C Meek, Z Vagena… - Proceedings of the 2004 …, 2004 - dl.acm.org
We present several methods for mining knowledge from the query logs of the MSN search
engine. Using the query logs, we build a time series for each query word or phrase …

Scaling and time warping in time series querying

AWC Fu, E Keogh, LYH Lau, CA Ratanamahatana… - The VLDB Journal, 2008 - Springer
The last few years have seen an increasing understanding that dynamic time warping
(DTW), a technique that allows local flexibility in aligning time series, is superior to the …

Distributed in-memory trajectory similarity search and join on road network

H Yuan, G Li - 2019 IEEE 35th international conference on data …, 2019 - ieeexplore.ieee.org
Many applications, eg, Uber, collect large-scale trajectory data from moving vehicles on road
network. Trajectory data analytics can benefit many real-world applications, such as route …