MétaCan
Menu
Back to cohort

On Finding Hidden Relationship among Variables in WiFi using Machine Learning

2020· article· en· W3013201418 on OpenAlex

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

Venue2020 International Conference on Computing, Networking and Communications (ICNC) · 2020
Typearticle
Languageen
FieldEngineering
TopicMillimeter-Wave Propagation and Modeling
Canadian institutionsCarleton University
Fundersnot available
KeywordsThroughputRandom forestComputer scienceVariable (mathematics)VariablesLinear regressionRegression analysisVariation (astronomy)RegressionRandom variableMachine learningArtificial intelligenceStatisticsWirelessMathematicsTelecommunications

Abstract

fetched live from OpenAlex

By employing a publicly available WiFi dataset, we study the effect of variables in this dataset, including link speed, received signal strength, round-trip time (RTT), and number of available access points, on WiFi throughput. We aim to find the variable that most significantly affects WiFi throughput. We achieve this by employing machine learning to seek the variable that closely explains the variation in throughput as well as predicts throughput with higher accuracy. It is observed that the linear regression model is unable to find any hidden relationship between throughput and other variables. With the random forest model, RTT is found to be the variable that explains the variation in throughput more closely as well as predicts throughput more accurately compared to other variables.

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: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.264
Threshold uncertainty score0.952

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.0010.000
Research integrity0.0000.001
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.130
GPT teacher head0.294
Teacher spread0.164 · 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