MétaCan
Menu
Back to cohort
Record W2080702463 · doi:10.1145/2396636.2396673

Branch-explore-merge

2012· article· en· W2080702463 on OpenAlexaff
Will McGrath, Brian R. Bowman, David McCallum, Juan David Hincapié-Ramos, Niklas Elmqvist, Pourang Irani

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicData Visualization and Analytics
Canadian institutionsUniversity of Manitoba
FundersNational Science Foundation
KeywordsMerge (version control)Computer scienceLeverage (statistics)Collaborative softwareMobile deviceHuman–computer interactionTask (project management)MultimediaWorld Wide WebInformation retrievalArtificial intelligence

Abstract

fetched live from OpenAlex

Collaborative work is characterized by participants seamlessly transitioning from working together (coupled) to working alone (decoupled). Groupware should therefore facilitate smoothly varying coupling throughout the entire collaborative session. Towards achieving such transitions for collaborative exploration and search, we propose a protocol based on managing revisions for each collaborator exploring a dataset. The protocol allows participants to diverge from the shared analysis path (branch), study the data independently (explore), and then contribute back their findings onto the shared display (merge). We apply this concept to collaborative search in multidimensional data, and propose an implementation where the public view is a tabletop display and the private views are embedded in handheld tablets. We then use this implementation to perform a qualitative user study involving a real estate dataset. Results show that participants leverage the BEM protocol, spend \ significant time using their private views (40% to 80% of total task time), and apply public view changes for consultation with collaborators.

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.004
metaresearch head score (Gemma)0.016
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.063
Threshold uncertainty score0.210

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0040.016
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0010.001
Science and technology studies0.0020.001
Scholarly communication0.0030.007
Open science0.0030.015
Research integrity0.0020.002
Insufficient payload (model declined to judge)0.0630.020

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.055
GPT teacher head0.320
Teacher spread0.265 · 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 designTheoretical or conceptual
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

Citations52
Published2012
Admission routes1
Has abstractyes

Explore more

Same topicData Visualization and AnalyticsFrench-language works237,207