Efficient ϵ-Approximate k-Flexible Aggregate Nearest Neighbor Search for Arbitrary ϵ in Road Networks

Recently, complicated spatial search algorithms have emerged as spatial-information-based applications, such as location-based services (LBS), and have become very diverse and frequent. The aggregate nearest neighbor (ANN) search is an extension of the existing nearest neighbor (NN) search; it finds...

Full description

Saved in:
Bibliographic Details
Published in:Electronics (Basel) 2023-09, Vol.12 (17), p.3622
Main Authors: Kwon, Hyuk-Yoon, Yoo, Jaejun, Loh, Woong-Kee
Format: Article
Language:English
Subjects:
Algorithms
Euclidean space
Experiments
Location based services
Networks
Roads
Search algorithms
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Recently, complicated spatial search algorithms have emerged as spatial-information-based applications, such as location-based services (LBS), and have become very diverse and frequent. The aggregate nearest neighbor (ANN) search is an extension of the existing nearest neighbor (NN) search; it finds the object p* that minimizes G{d(p*,qi),qi∈Q} from a set Q of M (≥1) query objects, where G is an aggregate function and d() is the distance between two objects. The flexible aggregate nearest neighbor (FANN) search is an extension of the ANN search by introducing flexibility factor ϕ(0
ISSN:2079-9292
2079-9292
DOI:10.3390/electronics12173622