MétaCan
Menu
Cohort builder

4,299,418 works, Canadian by any of four routes.

Every filter state is a URL; the URL is the query; the query is citable via /q/⟨hash⟩. The page, the API and the export parse the same parameters.

The current cohort, streamed from the database: every work column, the machine labels, the provisional scores, and the per-row validation status. Exports are capped at 100,000 rows. Mints a permanent /q/ link for this exact query. The same filters always produce the same link, whoever asks.

Search term
Year range
Sort
Language
Type
Field
Venue
Topic
Machine Learning and Algorithms
Retraction
Abstract
Evidence source
Study design
Label agreement
Label status

Direct Codex and Gemma labels are unvalidated and sparse. Distilled predictions cover the full frame and are also unvalidated. Choose the evidence source explicitly; absence of a direct label is never a negative label.

affaffiliation
fundfunder
venuejournal
aboutaboutness

The four routes compose: require the funder route and exclude affiliation to get the funder-only stratum no affiliation-based frame ever sees.

587 results · 1 filter active ·
Categories
Machine labels · sparse coverage
Evidence
An unlabeled work is unknown, not a negative. Label coverage is reported on every query.
587 works in the cohort · of 4,299,418page 1 of 12

Labels cover 1 of 587 works in this cohort. The rest are unlabeled, which is not a negative label: the label table is sparse today and grows as labeling rounds land.

Distilled predictions cover 587 of 587 works in this cohort. Predictions are machine_predicted_unvalidated teacher distillation outputs. Candidate is the union; consensus is the intersection.

affunlabeled
Deep Bayesian Active Learning with Image Data
2017· article· en· Oxford University Research Archive (ORA) (University of Oxford)· Computer Science
distilled prediction:candidate · metaepi_narrow+sts+open_scienceconsensus · open_science
435
citations
affunlabeled
XTRACT
2000· article· en· ACM SIGMOD Record· Computer Science
distilled prediction:candidate · insufficient_payloadconsensus · insufficient_payload
202
citations
affunlabeled
Artificial Intelligence
2017· book· en· Cambridge University Press eBooks· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
152
citations
affunlabeled
Active Preference Learning with Discrete Choice Data
2007· article· en· Oxford University Research Archive (ORA) (University of Oxford)· Computer Science
distilled prediction:candidate · metaepi_narrow+sts+open_scienceconsensus · none
131
citations
affunlabeled
The set covering machine
2003· article· en· ePrints Soton (University of Southampton)· Computer Science
distilled prediction:candidate · noneconsensus · none
112
citations
affunlabeled
XTRACT
2000· article· en· Computer Science
distilled prediction:candidate · insufficient_payloadconsensus · insufficient_payload
102
citations
affunlabeled
Agnostic Online Learning.
2009· article· en· Computer Science
distilled prediction:candidate · noneconsensus · none
93
citations
affunlabeled
Mine Classification With Imbalanced Data
2009· article· en· IEEE Geoscience and Remote Sensing Letters· Computer Science
distilled prediction:candidate · noneconsensus · none
89
citations
affno abstractunlabeled
Learnability can be undecidable
2018· article· en· Nature Machine Intelligence· Computer Science
distilled prediction:candidate · noneconsensus · none
73
citations
affunlabeled
Artificial Intelligence Review
2018· book-chapter· en· Advances in computer and electrical engineering book series· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
71
citations
affunlabeled
Learning Algorithms for Active Learning
2017· preprint· en· arXiv (Cornell University)· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
69
citations
afffundno abstractunlabeled
Covering Things with Things
2004· article· en· Discrete & Computational Geometry· Computer Science
distilled prediction:candidate · noneconsensus · none
65
citations
afffundno abstractunlabeled
Learning and Classifying Under Hard Budgets
2005· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
62
citations
afffundno abstractunlabeled
Decision Tree Instability and Active Learning
2007· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
61
citations
affunlabeled
Learning Algorithms for Active Learning
2017· preprint· en· arXiv (Cornell University)· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
53
citations
affunlabeled
Active model selection
2004· article· en· Computer Science
distilled prediction:candidate · noneconsensus · none
52
citations

How this was built: Screen · Findings · About