A multi-objective pigeon-inspired optimization approach to UAV distributed flocking among obstacles
H Qiu, H Duan - Information Sciences, 2020 - Elsevier
Unmanned aerial vehicle (UAV) flocking control with obstacle avoidance is a many-objective
optimization problem for centralized algorithms. A UAV flocking distributed optimization …
optimization problem for centralized algorithms. A UAV flocking distributed optimization …
Reverse nearest neighbors Bhattacharyya bound linear discriminant analysis for multimodal classification
Recently, an effective improvement of linear discriminant analysis (LDA) called L2-norm
linear discriminant analysis via the Bhattacharyya error bound estimation (L2BLDA) was …
linear discriminant analysis via the Bhattacharyya error bound estimation (L2BLDA) was …
A graph-based semi-supervised k nearest-neighbor method for nonlinear manifold distributed data classification
Abstract k nearest neighbors (kNN) is one of the most widely used supervised learning
algorithms to classify Gaussian distributed data, but it does not achieve good results when it …
algorithms to classify Gaussian distributed data, but it does not achieve good results when it …
Computing reverse nearest neighbourhood on road maps
A reverse nearest neighbour (RNN) query returns every object for which the query is its
nearest neighbour. Recently, a new useful variant of the RNN query has emerged, called …
nearest neighbour. Recently, a new useful variant of the RNN query has emerged, called …
A dynamic classification unit for online segmentation of big data via small data buffers
In many segmentation processes, we assign new cases according to a model that was built
on the basis of past cases. As long as the new cases are “similar enough” to the past cases …
on the basis of past cases. As long as the new cases are “similar enough” to the past cases …
On efficiently finding reverse k-nearest neighbors over uncertain graphs
Reverse k-nearest neighbor (R k NN R k NN) query on graphs returns the data objects that
take a specified query object q as one of their k-nearest neighbors. It has significant …
take a specified query object q as one of their k-nearest neighbors. It has significant …
Popularity-aware collective keyword queries in road networks
This paper addresses ap opularity-a ware c ollective k eyword (PAC-K) query in road
networks. Given a road network with POIs (Points of Interest), which is modeled as a road …
networks. Given a road network with POIs (Points of Interest), which is modeled as a road …
CSD-RkNN: reverse k nearest neighbors queries with conic section discriminances
The reverse k nearest neighbors (R k NN) query is a prominent yet time-consuming spatial
query used in facility siting, influential domain analysis, potential customer analysis, etc. Its …
query used in facility siting, influential domain analysis, potential customer analysis, etc. Its …
Multi-location visibility query processing using portion-based transactional modeling and pattern mining
Visibility computation is critical in spatial databases for realizing various interesting and
diverse applications such as defence-related surveillance, identifying interesting spots in …
diverse applications such as defence-related surveillance, identifying interesting spots in …
Finding the optimal location and keywords in obstructed and unobstructed space
The problem of optimal location selection based on reverse k nearest neighbor (R kk NN)
queries has been extensively studied in spatial databases. In this work, we present a related …
queries has been extensively studied in spatial databases. In this work, we present a related …