The platform will undergo maintenance on Sep 14 at about 7:45 AM EST and will be unavailable for approximately 2 hours.
2023
DOI: 10.1109/jiot.2022.3230913
|View full text |Cite
|
Sign up to set email alerts
|

Scalable and Efficient Clustering for Fingerprint-Based Positioning

Abstract: Indoor positioning based on IEEE 802.11 wireless LAN (Wi-Fi) fingerprinting needs a reference data set, also known as a radio map, in order to match the incoming fingerprint in the operational phase with the most similar fingerprint in the data set and then estimate the device position indoors. Scalability problems may arise when the radio map is large, e.g., providing positioning in large geographical areas or involving crowdsourced data collection. Some researchers divide the radio map into smaller independe… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2023
2023
2024
2024

Publication Types

Select...
2
2
1
1

Relationship

0
6

Authors

Journals

citations
Cited by 11 publications
(3 citation statements)
references
References 62 publications
0
3
0
Order By: Relevance
“…where p os represents the estimated location, p os i represents the position at the i-th neighbor, and d i signifies the distance between the measured RSS value at BLE of a point of interest and the pre-recorded fingerprint of RSS at location i. (7) calculates the weights (w i ) assigned to each neighbor based on the inverse of their respective distances. Smaller distances are accorded relatively larger weights, ensuring that the nearest neighbors, selected based on the smallest Euclidean distance and highest similarity, correspond to both offline and online RPs.…”
Section: B Location Estimation With Weighted K-nearest Neighborsmentioning
confidence: 99%
See 1 more Smart Citation
“…where p os represents the estimated location, p os i represents the position at the i-th neighbor, and d i signifies the distance between the measured RSS value at BLE of a point of interest and the pre-recorded fingerprint of RSS at location i. (7) calculates the weights (w i ) assigned to each neighbor based on the inverse of their respective distances. Smaller distances are accorded relatively larger weights, ensuring that the nearest neighbors, selected based on the smallest Euclidean distance and highest similarity, correspond to both offline and online RPs.…”
Section: B Location Estimation With Weighted K-nearest Neighborsmentioning
confidence: 99%
“…As the area and RSS measurement time increase, the dataset size required for calibration increases. Despite the time-consuming and labor-intensive nature of site surveying, fingerprinting-based approaches continue to be popular owing to their applicability to IPSs [6], [7].…”
Section: Introductionmentioning
confidence: 99%
“…A variety of matching algorithms based on minimizing the squared fitting errors (under the assumption that the errors follow Gaussian distribution), including k-nearest neighbor (kNN) based on Euclidean distance 12 , Naive Bayes (NB) 13 , Gaussian process regression (GPR) 14 , k-means (k-Means) clustering algorithm 15 , Artificial Neural Network (ANN) 16 , and Support Vector Machine (SVM) 17 have been proposed in the literature. These algorithms are generally selected based on the initial radio map and frequently prioritize enhancing the localization accuracy in the online phase, resulting in the noise signal in the initial data being brought into the online phase.…”
Section: Introductionmentioning
confidence: 99%