Application of an improved K nearest neighbor algorithm in WiFi indoor positioning

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

Abstract

In this paper, K nearest neighbor algorithm is improved in fingerprint information matching in WiFi indoor positioning system. Because the original K nearest neighbor algorithm ignores the relationship between the neighboring points, it doesn’t improve matching accuracy, and its positioning accuracy is not better. There is no effective treatment group sample points, matching time is greatly increased. In this paper, we study a modified K nearest neighbor algorithm in the application of WiFi indoor positioning. Because K neighbor points are given different weights according to certain rules, the matching accuracy is improved before matching method.And because of using grouping pretreatment of the sample space, the time of position matching accuracy is reduced. Therefore the positioning precision is improved.

Cite

CITATION STYLE

APA

Fang, Y., Deng, Z., Xue, C., Jiao, J., Zeng, H., Zheng, R., & Lu, S. (2015). Application of an improved K nearest neighbor algorithm in WiFi indoor positioning. In Lecture Notes in Electrical Engineering (Vol. 342, pp. 517–524). Springer Verlag. https://doi.org/10.1007/978-3-662-46632-2_45

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