An Adaptive Sampling Scheme via Approximate Volume Sampling for Fingerprint-Based Indoor Localization
Bibliographic record
Abstract
In recent years Wi-Fi fingerprinting has attracted much attention in indoor localization because of the availability of high-quality signal and pervasive deployment of wireless LANs. For fingerprint-based localization, however, offline site survey is usually time-consuming and labor-intensive. Therefore, reducing the burden of offline site survey becomes an important issue for fingerprint-based indoor localization. In this paper, using a low-tubal-rank tensor to model Wi-Fi fingerprints of all reference points (RPs), we propose an adaptive sampling scheme via approximate volume sampling to improve reconstruction accuracy of radio map with reduced expenditure. We propose a rank-increasing strategy to effectively estimate the rank of the underlying fingerprint tensor to alleviate the computation burden for tensor completion. We provide a theoretical foundation to analyze the proposed scheme and derive the performance bounds in terms of sample complexity and reconstruction error. We prove that the proposed scheme can achieve a relative error guarantee. Finally, we validate the effectiveness of the proposed scheme through extensive simulations using both synthetic and real datasets. The simulation results demonstrate that the proposed scheme is able to not only reduce reconstruction error and improve localization accuracy but also reduce running time compared to the state-of-the-art schemes.
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.005 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.002 | 0.002 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 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".