MétaCan
Menu
Back to cohort
Record W2003454829 · doi:10.1109/ccece.2013.6567826

Multilevel label placement for execution trace events

2013· article· en· W2003454829 on OpenAlex
Naser Ezzati‐Jivan, Alireza Shameli‐Sendi, Michel Dagenais

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
TopicData Visualization and Analytics
Canadian institutionsPolytechnique Montréal
Fundersnot available
KeywordsTRACE (psycholinguistics)Computer scienceVisualizationGraphData miningQuality (philosophy)Theoretical computer scienceData visualizationInformation retrievalMachine learning

Abstract

fetched live from OpenAlex

Automatic label assignment to graphical objects is an important problem in many applications such as cartography, online maps and graph drawings. In this paper, we present efficient algorithms for automatic label assignment to execution trace items (points or lines) in a trace visualization tool. The proposed label assignment algorithms aim to maximize the number of labeled items as well as increase the quality of assignments. The algorithms take into account both the topological and semantic relationships (e.g. level of details, repetitiveness, etc.) between the trace items in order to achieve assignments that are both quantitative and qualitative. The proposed method also supports assigning multiple labels to each trace item. The algorithms have been implemented and applied to different input traces. The experimental results show that considering the relationships between data items increases the labeling success rate and the quality.

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: Methods
Teacher disagreement score0.974
Threshold uncertainty score0.332

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.048
GPT teacher head0.328
Teacher spread0.280 · 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

Quick stats

Citations3
Published2013
Admission routes1
Has abstractyes

Explore more

Same topicData Visualization and AnalyticsFrench-language works237,207