Recurrent Neural Networks for Accurate RSSI Indoor Localization
Bibliographic record
Abstract
This article proposes recurrent neural networks (RNNs) for the WiFi fingerprinting indoor localization. Instead of locating a mobile user's position one at a time as in the cases of conventional algorithms, our RNN solution aims at the trajectory positioning and takes into account the correlation among the received signal strength indicator (RSSI) measurements in a trajectory. To enhance the accuracy among the temporal fluctuations of RSSI, a weighted average filter is proposed for both input RSSI data and sequential output locations. The results using different types of RNN, including vanilla RNN, long short-term memory (LSTM), gated recurrent unit (GRU), bidirectional RNN (BiRNN), bidirectional LSTM (BiLSTM), and bidirectional GRU (BiGRU) are presented. On-site experiments demonstrate that the proposed structure achieves an average localization error of 0.75 m with 80% of the errors under one meter, which outperforms K-nearest neighbors algorithms and probabilistic algorithms by approximately 30% under the same test environment.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 0.001 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".