MétaCan
Menu
Back to cohort
Record W2804503763 · doi:10.1145/3109761.3158412

ivga

2017· article· en· W2804503763 on OpenAlexfundno aff
Witold Dzwinel, Rafał Wcisło, Magdalena Strzoda

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldPhysics and Astronomy
TopicComplex Network Analysis Techniques
Canadian institutionsnot available
FundersNarodowe Centrum NaukiDalhousie University
KeywordsVisualizationComputer scienceGraph drawingHyperlinkGraphInteractive visualizationTheoretical computer scienceData visualizationInformation retrievalData scienceData miningWorld Wide WebWeb page

Abstract

fetched live from OpenAlex

There are many tools for the analysis of social networks such as the algorithms for community detection. However, visualization of these networks enables not only to recognize their important structural features and forms, such as clusters of vertices and their connectivity patterns, but also to assess their mutual relationships in terms of position, distance, shape and connection density. As we have demonstrated in our recent paper, a new method for interactive visualization of graphs (ivga) allows for instant visualization of large social networks, consisting of a few million of vertices and scores of million edges. Here, we estimate its visualization precision by investigating the network of historical events generated from English Wikipedia. The Wikipedia articles about historical events are the vertices of this graph while the hyperlinks to other articles represent its edges. We show that the network reveals a very distinct multi-scale structural properties. Its visual and interactive exploration allows for better understanding the casual relationships between both single historical events and their clusters.

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.001
metaresearch head score (Gemma)0.005
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesInsufficient payload (model declined to judge)
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Not applicable · Consensus signal: Not applicable
GenreCandidate signal: Other · Consensus signal: none
Teacher disagreement score0.879
Threshold uncertainty score0.000

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.005
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0020.002
Science and technology studies0.0010.000
Scholarly communication0.0030.002
Open science0.0020.003
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.1210.066

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.016
GPT teacher head0.310
Teacher spread0.293 · 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.

Study designNot applicable
Domainnot available
GenreOther

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

Citations4
Published2017
Admission routes1
Has abstractyes

Explore more

Same topicComplex Network Analysis TechniquesFrench-language works237,207