MétaCan
Menu
Back to cohort
Record W4404308404 · doi:10.48550/arxiv.2410.17976

metasnf: Meta Clustering with Similarity Network Fusion in R

2024· preprint· en· W4404308404 on OpenAlexfundno aff
Prashanth S. Velayudhan, Xiaoqiao Xu, Prajkta Kallurkar, Ana Patricia Balbon, Maria T. Secara, Adam Taback, Denise Sabac, Nicholas Chan, Shihao Ma, Bo Wang, Daniel Felsky, Stephanie H. Ameis, Brian Cox, Colin Hawco, Lauren Erdman, Anne L. Wheeler

Bibliographic record

VenuearXiv (Cornell University) · 2024
Typepreprint
Languageen
FieldComputer Science
TopicAdvanced Clustering Algorithms Research
Canadian institutionsnot available
FundersCanadian Institutes of Health ResearchCampbell Family Mental Health Research InstituteUniversity of TorontoHospital for Sick ChildrenNatural Sciences and Engineering Research Council of CanadaFondation Brain CanadaCentre for Addiction and Mental Health FoundationCanada Research Chairs
KeywordsSimilarity (geometry)Cluster analysisArtificial intelligenceFusionComputer sciencePattern recognition (psychology)PhilosophyLinguistics

Abstract

fetched live from OpenAlex

metasnf is an R package that enables users to apply meta clustering, a method for efficiently searching a broad space of cluster solutions by clustering the solutions themselves, to clustering workflows based on similarity network fusion (SNF). SNF is a multi-modal data integration algorithm commonly used for biomedical subtype discovery. The package also contains functions to assist with cluster visualization, characterization, and validation. This package can help researchers identify SNF-derived cluster solutions that are guided by context-specific utility over context-agnostic measures of quality.

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.008
metaresearch head score (Gemma)0.035
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.071
Threshold uncertainty score0.239

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0080.035
Meta-epidemiology (narrow)0.0050.003
Meta-epidemiology (broad)0.0040.005
Bibliometrics0.0050.004
Science and technology studies0.0010.001
Scholarly communication0.0050.004
Open science0.0060.005
Research integrity0.0020.005
Insufficient payload (model declined to judge)0.0710.055

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.121
GPT teacher head0.230
Teacher spread0.109 · 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

Citations0
Published2024
Admission routes1
Has abstractyes

Explore more

Same venuearXiv (Cornell University)Same topicAdvanced Clustering Algorithms ResearchFrench-language works237,207