MétaCan
Menu
Back to cohort
Record W3159017946 · doi:10.15173/sciential.v1i5.2537

The Value of Manifold Learning Algorithms in Simplifying Complex Datasets for More Efficacious Analysis

2020· article· en· W3159017946 on OpenAlexaffvenue
Muhammad Amjad

Bibliographic record

VenueSciential - McMaster Undergraduate Science Journal · 2020
Typearticle
Languageen
FieldComputer Science
TopicTopological and Geometric Data Analysis
Canadian institutionsMcMaster University
Fundersnot available
KeywordsNonlinear dimensionality reductionDimensionality reductionCurse of dimensionalityManifold (fluid mechanics)EmbeddingComputer scienceFilter (signal processing)Key (lock)Feature (linguistics)Space (punctuation)Clustering high-dimensional dataManifold alignmentArtificial intelligenceAlgorithmData miningPattern recognition (psychology)Cluster analysis

Abstract

fetched live from OpenAlex

Advances in manifold learning have proven to be of great benefit in reducing the dimensionality of large complex datasets. Elements in an intricate dataset will typically belong in high-dimensional space as the number of individual features or independent variables will be extensive. However, these elements can be integrated into a low-dimensional manifold with well-defined parameters. By constructing a low-dimensional manifold and embedding it into high-dimensional feature space, the dataset can be simplified for easier interpretation. In spite of this elemental dimensionality reduction, the dataset’s constituents do not lose any information, but rather filter it with the hopes of elucidating the appropriate knowledge. This paper will explore the importance of this method of data analysis, its applications, and its extensions into topological data analysis.

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.011
metaresearch head score (Gemma)0.051
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.011
Threshold uncertainty score0.060

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0110.051
Meta-epidemiology (narrow)0.0030.001
Meta-epidemiology (broad)0.0030.003
Bibliometrics0.0060.009
Science and technology studies0.0020.005
Scholarly communication0.0070.012
Open science0.0020.006
Research integrity0.0020.008
Insufficient payload (model declined to judge)0.0030.002

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.040
GPT teacher head0.308
Teacher spread0.268 · 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
Published2020
Admission routes2
Has abstractyes

Explore more

Same venueSciential - McMaster Undergraduate Science JournalSame topicTopological and Geometric Data AnalysisFrench-language works237,207