MétaCan
Menu
Back to cohort
Record W2138392784

Using the Omega Index for Evaluating Abstractive Community Detection

2012· article· en· W2138392784 on OpenAlexaff
Gabriel Murray, Giuseppe Carenini, Raymond T. Ng

Bibliographic record

VenueNorth American Chapter of the Association for Computational Linguistics · 2012
Typearticle
Languageen
FieldPhysics and Astronomy
TopicComplex Network Analysis Techniques
Canadian institutionsUniversity of British ColumbiaUniversity of the Fraser Valley
Fundersnot available
KeywordsAutomatic summarizationComputer scienceDisjoint setsSentenceArtificial intelligenceNatural language processingCluster analysisMetric (unit)GraphContrast (vision)Task (project management)Index (typography)Theoretical computer scienceMathematicsCombinatorics
DOInot available

Abstract

fetched live from OpenAlex

Numerous NLP tasks rely on clustering or community detection algorithms. For many of these tasks, the solutions are disjoint, and the relevant evaluation metrics assume nonoverlapping clusters. In contrast, the relatively recent task of abstractive community detection (ACD) results in overlapping clusters of sentences. ACD is a sub-task of an abstractive summarization system and represents a twostep process. In the first step, we classify sentence pairs according to whether the sentences should be realized by a common abstractive sentence. This results in an undirected graph with sentences as nodes and predicted abstractive links as edges. The second step is to identify communities within the graph, where each community corresponds to an abstractive sentence to be generated. In this paper, we describe how the Omega Index, a metric for comparing non-disjoint clustering solutions, can be used as a summarization evaluation metric for this task. We use the Omega Index to compare and contrast several community detection algorithms.

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.019
metaresearch head score (Gemma)0.090
Version: metacan-v3-hybrid-931329e0061cValidation 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.020
Threshold uncertainty score0.101

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0190.090
Meta-epidemiology (narrow)0.0020.000
Meta-epidemiology (broad)0.0020.001
Bibliometrics0.0200.009
Science and technology studies0.0020.001
Scholarly communication0.0040.008
Open science0.0020.003
Research integrity0.0030.002
Insufficient payload (model declined to judge)0.0020.001

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.062
GPT teacher head0.360
Teacher spread0.298 · 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 designSimulation or modeling
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

Citations26
Published2012
Admission routes1
Has abstractyes

Explore more

Same venueNorth American Chapter of the Association for Computational LinguisticsSame topicComplex Network Analysis TechniquesFrench-language works237,207