MétaCan
Menu
Back to cohort
Record W7055547716

Classification of high-dimensional mislabelled data and online algorithms for high-dimensional streaming data

2023· dissertation· en· W7055547716 on OpenAlexaff

Bibliographic record

VenueWhite Rose eTheses Online (University of Leeds, The University of Sheffield, University of York) · 2023
Typedissertation
Languageen
FieldEngineering
TopicParticle accelerators and beam dynamics
Canadian institutionsYork University
Fundersnot available
KeywordsResamplingNaive Bayes classifierBoosting (machine learning)Classifier (UML)Big dataRaw dataRandom forestProbabilistic classification
DOInot available

Abstract

fetched live from OpenAlex

Motivated by extensive discussions and applications of big data, we delve into the realm of sparse data, specifically high dimensional data characterised by a larger number of predictors than sample sizes. The advantages and challenges associated with high-dimensional data have been thoroughly discussed (Donoho et al., 2000). Our research primarily focuses on addressing the challenges on two prevalent domains: Classification with mislabelled data and Online algorithms for streaming data. To overcome these challenges, we incorporate regularisation methods and utilise Sure Independence Screening (SIS) and Iteratively Sure Independence Screening (ISIS) (Fan and Lv, 2008, Fan and Song, 2010). In Chapter 3, we introduce a two-step estimation method using resampling for classification with mislabelling, offering enhanced cost-effectiveness over conventional data cleansing. Simulations reveal that direct training on corrupted datasets leads classifiers like Logistic Regression (LR) to perform akin to random guessing. Our method greatly enhances LR classifier efficiency, matching the performance of classifiers on perfectly labelled datasets. Notably, our method aligns closely with the performance of the Bayes classifier in diverse contexts. Real data analysis, using a deliberately mislabelled Framingham Heart Study dataset, underscores our classifier’s superiority over one trained on raw data with mislabelling, comparable with one trained on impeccable data. In Chapter 4, we explore incremental algorithms for streaming data, focusing on Generalised Linear Models (GLMs). Our methodologies parallel offline techniques in both low and high-dimensional analyses but excel in computational efficiency. A highlight of our approach is the avoidance of storing specific data, optimising resources and boosting data security. Analysing data from the National Automotive Sampling System Crashworthiness Data System showcases our method’s superiority in estimation accuracy, variable selection, and model interpretation. Our technique significantly outperforms those neglecting variable selection and aligns with conventional offline methods.

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 distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesMeta-epidemiology (narrow)
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.613
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0000.001
Science and technology studies0.0000.001
Scholarly communication0.0000.000
Open science0.0020.001
Research integrity0.0010.000
Insufficient payload (model declined to judge)0.0000.000

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.049
GPT teacher head0.248
Teacher spread0.199 · 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 teacher head, not a consensus.

Study designSimulation or modeling
Domainnot available
GenreEmpirical

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
Published2023
Admission routes1
Has abstractyes

Explore more

Same venueWhite Rose eTheses Online (University of Leeds, The University of Sheffield, University of York)Same topicParticle accelerators and beam dynamicsFrench-language works237,207