Spatial Network k-Nearest Neighbor: A Survey and Future Directives
Keywords:
k-Nearest Neighbor Search, Query Performance, Road Network, Spatial Network Database,Abstract
Nearest neighbor algorithms play many roles in our daily lives. From facial recognition to networking applications, many of these are constantly improved for faster processing time and reliable memory management. There are many types of nearest neighbor algorithms. One of them is called k-nearest neighbor (k-NN), a technique that helps to find number of k closest objects from a user location within a specified range of area. k-NN road network algorithm studies have been through various query performance discussions. Each algorithm is usually judged based on query time over few selected parameters which are; number of k, network density and network size. Many studies have claimed different opinions over their techniques and with many results to prove better query performance than others. However, among these techniques, which k-NN road network algorithm has the highest rate of query performance based on the selected parameters? In this paper, reviews on several k nearest neighbor algorithms were made through series of journal extractions and experimentation in order to identify the algorithm that achieves highest query performance. It was found that with the experimentation method, we can identify not only the algorithm’s performance, but also its design flaws and possible future improvement. All methods were tested with some parameters such as varying number of k, road network density and network size. With the results collected, Incremental Expansion Restriction – Pruned Highway Labeling method (IER-PHL) proves to have the best query performance than other methods for most cases.Downloads
Published
How to Cite
Issue
Section
License
TRANSFER OF COPYRIGHT AGREEMENT
The manuscript is herewith submitted for publication in the Journal of Telecommunication, Electronic and Computer Engineering (JTEC). It has not been published before, and it is not under consideration for publication in any other journals. It contains no material that is scandalous, obscene, libelous or otherwise contrary to law. When the manuscript is accepted for publication, I, as the author, hereby agree to transfer to JTEC, all rights including those pertaining to electronic forms and transmissions, under existing copyright laws, except for the following, which the author(s) specifically retain(s):
- All proprietary right other than copyright, such as patent rights
- The right to make further copies of all or part of the published article for my use in classroom teaching
- The right to reuse all or part of this manuscript in a compilation of my own works or in a textbook of which I am the author; and
- The right to make copies of the published work for internal distribution within the institution that employs me
I agree that copies made under these circumstances will continue to carry the copyright notice that appears in the original published work. I agree to inform my co-authors, if any, of the above terms. I certify that I have obtained written permission for the use of text, tables, and/or illustrations from any copyrighted source(s), and I agree to supply such written permission(s) to JTEC upon request.