FINDING A RESIDENCE WITH ALL FACILITIES USING NEAREST NEIGHBOR SEARCH
K. Padmapriya1 & Dr. S. Sridhar1 Show affiliations
- Sathyabama University, India
Journal of Computer Science, Volume 10, Issue 6, pp. 1045–1050 · doi.org/10.3844/jcssp.2014.1045.1050
Abstract
Nearest neighbor search is one of the most widely-used techniques and its applications including mobile communication, Geographic information systems, bioinformatics, computer vision and marketing. For example, four friends want to rent an apartment which should be nearer to their working places. Our paper discussed about the problems on finding the most appropriate location among a set of available places. The problem is defined as a top-k query which gives output of k points from a set of available places P along with the conveniences. We proposed algorithms based on R-trees to answer the query exactly. The efficiency of our proposed algorithms is verified through various experiments and found that it is better than existing algorithms use large scale real datasets.
Licence and reuse
Free to read. This article carries the publisher’s copyright, as printed on it: © 2014 Science Publications. It is free to read; ask us before reusing it.
How to reuse this articleResponses (0)
About this article
Padmapriya, K. & Sridhar, D. S. (2014). FINDING A RESIDENCE WITH ALL FACILITIES USING NEAREST NEIGHBOR SEARCH. Journal of Computer Science, 10(6), 1045–1050. https://doi.org/10.3844/jcssp.2014.1045.1050
- Licence
- © Science Publications
- Issue
- Volume 10, Issue 6
- Policies
- Editorial independenceUse of generative AIData availabilityAppeals and complaints
- Version
- Version of record
