MétaCan
Menu
Back to cohort
Record W2111094784 · doi:10.1109/iccit.2008.210

Social Network Analysis on Name Disambiguation and More

2008· article· en· W2111094784 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
FieldDecision Sciences
TopicData Quality and Management
Canadian institutionsUniversity of British Columbia
Fundersnot available
KeywordsComputer scienceDisk formattingString metricSocial network analysisInformation retrievalSimilarity (geometry)String (physics)Correct nameSocial network (sociolinguistics)Natural language processingGraphWorld Wide WebArtificial intelligenceString searching algorithmSocial mediaTheoretical computer sciencePattern matchingMathematics

Abstract

fetched live from OpenAlex

Name variants are ubiquitous in real world due typographical errors (e.g., "Forschungszentrum Julich" vs. "Forschungszentrum Julich"), abbreviated, imcomplete, or missing information (e.g., "R. E. Ellis" vs. "Randy E. Ellis"), lack of standard name formatting convention (e.g., "Spike Jonze" vs. "Jones, Spike"), and their combinations. In this paper, we project this name disambiguation problem to graph representation, and then analyze graphs using social network analysis. In particular, we used real duplicate name entities that we manually verifed from ACM digital library. Then, using various string similarity metrics and additional information (i.e., co-author names, titles, and venues), we analyze the effectiveness of string similarity metrics and additional information based on social network analysis. Through our experimental validation, name disambiguation problem can be analyzed in graphical, visual manner.

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 categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Observational · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.775
Threshold uncertainty score0.557

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.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0010.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.218
GPT teacher head0.443
Teacher spread0.225 · 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

Citations6
Published2008
Admission routes1
Has abstractyes

Explore more

Same topicData Quality and ManagementFrench-language works237,207