CLC number:
On-line Access: 2025-04-17
Received: 2024-05-07
Revision Accepted: 2025-01-19
Crosschecked: 0000-00-00
Cited: 0
Clicked: 15
Yuting YANG1, Tao ZHANG1, Wu HUANG‡2. A dynamic K-nearest neighbor method based on strong access point credibility for indoor positioning[J]. Frontiers of Information Technology & Electronic Engineering, 1998, -1(-1): .
@article{title="A dynamic K-nearest neighbor method based on strong access point credibility for indoor positioning",
author="Yuting YANG1, Tao ZHANG1, Wu HUANG‡2",
journal="Frontiers of Information Technology & Electronic Engineering",
volume="-1",
number="-1",
pages="",
year="1998",
publisher="Zhejiang University Press & Springer",
doi="10.1631/FITEE.2400366"
}
%0 Journal Article
%T A dynamic K-nearest neighbor method based on strong access point credibility for indoor positioning
%A Yuting YANG1
%A Tao ZHANG1
%A Wu HUANG‡2
%J Journal of Zhejiang University SCIENCE C
%V -1
%N -1
%P
%@ 2095-9184
%D 1998
%I Zhejiang University Press & Springer
%DOI 10.1631/FITEE.2400366
TY - JOUR
T1 - A dynamic K-nearest neighbor method based on strong access point credibility for indoor positioning
A1 - Yuting YANG1
A1 - Tao ZHANG1
A1 - Wu HUANG‡2
J0 - Journal of Zhejiang University Science C
VL - -1
IS - -1
SP -
EP -
%@ 2095-9184
Y1 - 1998
PB - Zhejiang University Press & Springer
ER -
DOI - 10.1631/FITEE.2400366
Abstract: High-precision indoor positioning offers valuable information support for various services such as patient monitoring, equipment scheduling management, and laboratory safety. An traditional indoor positioning technology, fingerprint indoor positioning, often employs the K-nearest neighbors (KNN) algorithm to identify the closest K reference points (RPs) via received signal strength (RSS) for location prediction. However, RSS is susceptible to environmental interference, leading to the selection of RPs that are not physically the closest to the user. Moreover, using a fixed K value is not the optimal strategy. In this work, we propose a novel approach, the dynamic K-nearest neighbor method based on strong access point (AP) credibility (SAPC-DKNN), for indoor positioning. In SAPC-DKNN, we leverage prior knowledge of RSS path loss and employ the RSS fluctuation area to quantify the significance of different APs. We integrate the similarity of AP sets within the range of strong APs and formulate a weighted distance metric for RSS based on the credibility of strong APs. Additionally, we introduce a dynamic K value algorithm (ND-DKA) based on neighbor density for the automatic optimization of the K value for each test point. Experimental evaluations conducted on three datasets demonstrate that our method significantly reduces the average positioning error by 18.67%-66.48% compared to the state-of-the-art KNN methods.
Open peer comments: Debate/Discuss/Question/Opinion
<1>