MétaCan
Menu
Back to cohort

Missing Data Inference for Crowdsourced Radio Map Construction: An Adversarial Auto-Encoder Method

2021· article· en· W3162789749 on OpenAlexaff
Aijin Zhang, Kun Zhu, Ran Wang, Changyan Yi

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldEngineering
TopicIndoor and Outdoor Localization Technologies
Canadian institutionsNovelis (Canada)
FundersNational Natural Science Foundation of China
KeywordsComputer scienceInferenceMissing dataCrowdsourcingScheme (mathematics)Data miningEncoderDeep learningArtificial intelligenceAdversarial systemMachine learningQuality (philosophy)Matrix completion

Abstract

fetched live from OpenAlex

Radio environment monitoring is crucial for many network engineering applications. Integrated with mobile crowdsourcing (MCS), radio map can be updated by mobile users in a low-cost manner. However, the crowdsourced measurement data may get quite sparse, and contain noises and errors. Therefore, how to efficiently infer missing data under low-quality measurements is critical in crowdsourced radio map construction. Existing inference methods like matrix completion require certain strict conditions, e.g. missing at completely random (MACR), which is impractical in the city-scale sensing. To address these issues, we propose a deep learning scheme based on adversarial auto-encoder (AAE) to handle measurements with large missing regions and complicated loss patterns. Specifically, this scheme applies variational auto-encoder (VAE) to infer missing data, and further utilizes the adversarial nets to play a min-max game with the VAE to improve recovery quality. Comprehensive experiments on three real datasets show that the proposed scheme can outperform state-of-the-art methods under large missing rates and low-quality measurements.

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 imitation

Not 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.

metaresearch head score (Codex)0.002
metaresearch head score (Gemma)0.007
Version: metacan-v3-hybrid-931329e0061cValidation 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: Methods · Consensus signal: Methods
Teacher disagreement score0.007
Threshold uncertainty score0.015

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0020.007
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0010.001
Science and technology studies0.0010.001
Scholarly communication0.0010.002
Open science0.0020.003
Research integrity0.0010.003
Insufficient payload (model declined to judge)0.0020.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.

Opus teacher head0.041
GPT teacher head0.312
Teacher spread0.272 · 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

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreMethods

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".

Quick stats

Citations7
Published2021
Admission routes1
Has abstractyes

Explore more

Same topicIndoor and Outdoor Localization TechnologiesFrench-language works237,207