MétaCan
Menu
Back to cohort
Record W2770878427 · doi:10.1145/3110025.3110052

MCDA

2017· article· en· W2770878427 on OpenAlexaff
Oualid Boutemine, Mohamed Bouguessa

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldPhysics and Astronomy
TopicComplex Network Analysis Techniques
Canadian institutionsUniversité du Québec à Montréal
Fundersnot available
KeywordsMultiple-criteria decision analysisComputer scienceContext (archaeology)Constraint (computer-aided design)Set (abstract data type)Data miningArtificial intelligenceSelection (genetic algorithm)Machine learningMathematical optimizationMathematics

Abstract

fetched live from OpenAlex

This paper introduces a parameterless approach named MCDA: Multidimensional Communities Detection Algorithm. MCDA adopts a local search mechanism which is inspired from the label propagation principle. To this end, we design a novel propagation rule that exploits the most frequently used interaction dimensions among neighbors as an additional constraint for membership selections. The new propagation rule allows MCDA to automatically unfold the hidden communities in a multidimensional context. The detected communities are further processed for relevant dimensions selection using an inter-class inertia-based procedure. The proposed algorithm is fully automated and does not require any parameter to be set by the user to recover communities and their associated dimensions.

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.003
metaresearch head score (Gemma)0.015
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: none
GenreCandidate signal: Other · Consensus signal: none
Teacher disagreement score0.960
Threshold uncertainty score0.000

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0030.015
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.002
Bibliometrics0.0030.003
Science and technology studies0.0020.001
Scholarly communication0.0040.003
Open science0.0040.004
Research integrity0.0020.002
Insufficient payload (model declined to judge)0.0400.011

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.309
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

Citations2
Published2017
Admission routes1
Has abstractyes

Explore more

Same topicComplex Network Analysis TechniquesFrench-language works237,207