MétaCan
Menu
Back to cohort
Record W2156337551 · doi:10.3390/s140406584

Uncertain Data Clustering-Based Distance Estimation in Wireless Sensor Networks

2014· article· en· W2156337551 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

VenueSensors · 2014
Typearticle
Languageen
FieldComputer Science
TopicEnergy Efficient Wireless Sensor Networks
Canadian institutionsUniversity of Ottawa
FundersNational Natural Science Foundation of China
KeywordsCluster analysisWirelessWireless sensor networkLogarithmComputer scienceData miningInterval (graph theory)Real-time computingArtificial intelligenceMathematicsComputer networkTelecommunications

Abstract

fetched live from OpenAlex

For communication distance estimations in Wireless Sensor Networks (WSNs), the RSSI (Received Signal Strength Indicator) value is usually assumed to have a linear relationship with the logarithm of the communication distance. However, this is not always true in reality because there are always uncertainties in RSSI readings due to obstacles, wireless interferences, etc. In this paper, we specifically propose a novel RSSI-based communication distance estimation method based on the idea of interval data clustering. We first use interval data, combined with statistical information of RSSI values, to interpret the distribution characteristics of RSSI. We then use interval data hard clustering and soft clustering to overcome different levels of RSSI uncertainties, respectively. We have used real RSSI measurements to evaluate our communication distance estimation method in three representative wireless environments. Extensive experimental results show that our communication distance estimation method can effectively achieve promising estimation accuracy with high efficiency when compared to other state-of-art approaches.

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.001
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesMeta-epidemiology (narrow)
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.845
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.001
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0020.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.019
GPT teacher head0.252
Teacher spread0.233 · 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