Multi-criteria optimization in GIS: Continuous K-nearest neighbor search in mobile navigation

1Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The generalization of existing spatial data for cartographic production can be expressed as optimizing both the amount of information to be presented, and the legibility/usability of the final map, while conserving data accuracy, geographic characteristics, and aesthetical quality. As an application of information system optimization, distributed wireless mobile network serves as the underlying infrastructure to digital ecosystems. It provides important applications to the digital ecosystems, one of which is mobile navigations and continuous mobile information services. Most information and query services in a mobile environment are continuous mobile query processing or continuous k nearest neighbor (CKNN), which finds the locations where interest points or interest objects change while mobile users are moving. In this paper, we propose a neural network based algorithm solution for continuous k nearest neighbor (CKNN) search in such a system which divides the query path into segments and improves the overall query process. © 2010 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Ahmadian, K., Gavrilova, M., & Taniar, D. (2010). Multi-criteria optimization in GIS: Continuous K-nearest neighbor search in mobile navigation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6016 LNCS, pp. 574–589). Springer Verlag. https://doi.org/10.1007/978-3-642-12156-2_43

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free