Épuration de données et régression linéaire | Data Cleaning and Linear Regression
Bibliographic record
Abstract
Ce tutoriel est conçu pour optimiser la préparation des données pour l'apprentissage automatique, avec un focus spécifique sur la prédiction des schémas de circulation des vélos en fonction des conditions météorologiques. Il comprend un résumé des objectifs d'apprentissage, une section spécifique qui décrit les exigences nécessaires pour compléter le tutoriel, et une section sur les pratiques recommandées pour la gestion des données de recherche (GDR). Le tutoriel utilise la régression linéaire, un modèle d'apprentissage automatique simple, pour faire des prédictions basées sur les données d'entrée. Les données proviennent des données de comptage des vélos d'Ottawa et des données météorologiques historiques. This tutorial is designed to optimize data preparation for machine learning, with a specific focus on predicting bike traffic patterns based on weather conditions. It includes a summary of the learning goals, a specific section that outlines the necessary requirements for completing the tutorial, and a section on the recommended practices for Research Data Management (RDM). The tutorial employs Linear Regression, a straightforward machine learning model, to make predictions based on the input data. The data is sourced from Ottawa’s bike count data and historical weather data.
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.010 | 0.058 |
| Meta-epidemiology (narrow) | 0.002 | 0.002 |
| Meta-epidemiology (broad) | 0.002 | 0.003 |
| Bibliometrics | 0.003 | 0.005 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.008 | 0.006 |
| Open science | 0.005 | 0.005 |
| Research integrity | 0.002 | 0.005 |
| Insufficient payload (model declined to judge) | 0.042 | 0.030 |
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".