Classification of high-dimensional mislabelled data and online algorithms for high-dimensional streaming data
Bibliographic record
Abstract
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 machine prediction
Teacher imitationNot 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.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.006 | 0.029 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.002 | 0.001 |
| Bibliometrics | 0.001 | 0.002 |
| Science and technology studies | 0.001 | 0.002 |
| Scholarly communication | 0.002 | 0.004 |
| Open science | 0.004 | 0.003 |
| Research integrity | 0.003 | 0.004 |
| Insufficient payload (model declined to judge) | 0.002 | 0.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.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
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".