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
Author
Year range
Sort
Language
Type
Field
Venue
Topic
Rough Sets and Fuzzy Logic
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.

939 results · 1 filter active ·
Results by year
20002025
Publication date
Categories
Machine labels · sparse coverage
Evidence
Language
Type
Citations
An unlabeled work is unknown, not a negative. Label coverage is reported on every query.
939 works in the cohort · of 4,299,418page 17 of 19

Labels cover 1 of 939 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 939 of 939 works in this cohort. Predictions are machine_predicted_unvalidated. The Gemma side is a direct model label for every work (title-only); the Codex side is a distilled, calibrated classifier. Candidate is the union; consensus is the intersection.

affno abstractunlabeled
Approximation by Filter Functions
Ivo Düntsch, Günther Gediga, Hui Wang
2018· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Correction to: Transactions on Rough Sets XVIII
James F. Peters, Andrzej Skowron, Tianrui Li, Yan Yang, JingTao Yao, Hung Son Nguyen
2018· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Rough Sets
2023· book· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
fundno affunlabeled
Choix multiples et théorie des tests
Arthur Charpentier
2009· article· fr· OpenEdition (OpenEdition)· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affunlabeled
The Prominentness of Fuzzy GE-Filters in GE-Algebras
Sun Shin Ahn, R. A. Borzooei, Young Bae Jun
2023· article· en· International Journal of Analysis and Applications· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Metastructural facets of granular computing
Witold Pedrycz
2008· article· en· International Journal of Knowledge Engineering and Soft Data Paradigms· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Generalization bounds of incremental SVM
Jingjing Zeng, Bin Zou, Yimo Qin, Jie Xu
2024· article· en· International Journal of Wavelets Multiresolution and Information Processing· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Principles and Perspectives of Granular Computing
Jianchao Han, Nick Cercone
2023· book-chapter· en· Encyclopedia of complexity and systems science series· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations

How this was built: Screen · Findings · About