MétaCan
Menu
Back to cohort
Record W2168238105 · doi:10.1109/waina.2008.43

Wireless Service Attributes Classification and Matching Mechanism Based on Decision Tree

2008· article· en· W2168238105 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

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicNetwork Packet Processing and Optimization
Canadian institutionsSt. Francis Xavier University
Fundersnot available
KeywordsDecision treeComputer scienceMatching (statistics)Tree (set theory)WirelessNode (physics)Service (business)Data miningWireless networkIncremental decision treeDecision tree learningBinary decision diagramDecision tree modelComputer networkDecision ruleArtificial intelligenceTheoretical computer scienceMathematicsStatisticsTelecommunicationsEngineering

Abstract

fetched live from OpenAlex

In this paper, SeviceCuts, a decision tree based model is proposed, considering the special attributes of wireless service and the normal need of users, helping service decision agent classify the wireless services adaptively. The decision tree is traversed based on some searching rule. A small number of matching rules are stored in the leaf node, which contain the most matching service strategies to users, and are linearly traversed to find the highest priority rule that matches the user's query requirement. The analysis of algorithm complication and performance shows that the efficiency of ServiceCuts decision tree model is better than traditional linear search structure and the normal binary decision tree structure.

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.903
Threshold uncertainty score0.350

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.032
GPT teacher head0.239
Teacher spread0.207 · 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