MétaCan
Menu
Back to cohort
Record W2062486942 · doi:10.1109/glocom.2014.7036847

A feature scaling based k-nearest neighbor algorithm for indoor positioning system

2014· article· en· W2062486942 on OpenAlex
Dong Li, Baoxian Zhang, Yao Zheng, Cheng Li

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldEngineering
TopicIndoor and Outdoor Localization Technologies
Canadian institutionsMemorial University of Newfoundland
Fundersnot available
Keywordsk-nearest neighbors algorithmComputer scienceScalingFeature (linguistics)Pattern recognition (psychology)Best bin firstArtificial intelligenceAlgorithmMathematics

Abstract

fetched live from OpenAlex

With the increasing popularity of wireless local area network infrastructure, Wi-Fi fingerprint based indoor positioning systems have received considerable attention in recent years. In the literature, most existing work in this area focuses on techniques that match the vector of radio signal strength (RSS) values reported by a mobile device to the fingerprints collected at predetermined reference points (RPs) by comparing the similarity (measured based on RSS difference) between them. However, these existing techniques fail to consider the fact that equal RSS differences at different RSS levels may not mean equal distances in reality. To address this issue, in this paper, we propose a feature scaling based k-nearest neighbor algorithm (FS-kNN) for improved localization accuracy. In FS-kNN, we build a novel RSS-based feature scaling model, which introduces signal-level-scaled weights in the calculation of effective signal distance between signal vector reported by mobile device and existing fingerprints. Experimental results show that FS-kNN can achieve an average error distance as low as 1.93 meters, which is superior to previous work.

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.

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.868
Threshold uncertainty score0.548

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.000

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.

Opus teacher head0.004
GPT teacher head0.187
Teacher spread0.183 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it