MétaCan
Menu
Back to cohort
Record W7135689794

Data cleaning; is it time to stop sweeping it under the carpet?:An example from the Dogslife project

2017· article· en· W7135689794 on OpenAlexaboutno aff
Charlotte S C; id_orcid 0000-0001-9176-8389 Woolley, Ian G. Handel, B. Mark C de Bronsvoort, Jeffrey J. Schoenebeck, Dylan N. Clements

Bibliographic record

VenueResearch Explorer (The University of Manchester) · 2017
Typearticle
Languageen
FieldDecision Sciences
TopicMeta-analysis and systematic reviews
Canadian institutionsnot available
Fundersnot available
KeywordsPipeline (software)Process (computing)SoftwarePopulationData qualityDecimalQuality (philosophy)
DOInot available

Abstract

fetched live from OpenAlex

Even with careful study design and extensive validation, large datasets are often heterogeneous and require cleaning prior to analysis to prevent losses in research validity, quality and statistical power. Many publications report that data was ‘cleaned’ but few studies document the process reproducibly and values identified as ‘outliers’ are commonly deleted without reporting the possible causes of error. Our aim was to develop a novel, automated data cleaning algorithm for growth (height and weight) that could be applied to large datasets. Dogslife is an internet-based, longitudinal cohort study of Kennel Club registered Labrador Retrievers living in the UK, which was launched in 2010 and has over 7500 registered dogs to date. The main objective of Dogslife is to identify risk factors for canine health and disease by collecting information from owners via regular questionnaires. In addition to questionnaire data, the study has collected DNA and faecal samples from subsets of the cohort, which has produced genomic and microbiome data. We developed our data cleaning pipeline in R software and used rule-based approaches, non-linear mixed-effects mathematical models and text analysis to identify common errors such as duplicate entries, typing, decimal point, unit, menu/option, intentional, website-generated and measurement errors. Individuals were permitted to differ from the population by making use of repeated measurements and alternative data sources. The method avoids the modification of unusual but biologically plausible values, prioritise data repair over removal and explicitly report the decision making process behind why a particular data entry is modified or deleted. We validated our cleaning algorithm for growth variables (weight and height) on three other independent data sources from studies with fundamentally different designs; veterinary consultation Labrador Retriever weight records from the SAVSNET (Small Animal Veterinary Surveillance Network), clinical Labrador Retriever weight records from a veterinary hospital network and a publically available (via the UK Data Service) human weight and height data from CLOSER (Cohort & Longitudinal Studies Enhancement Resources) with varying proportions of artificially simulated errors. We found that our algorithm could be reproducibly applied as an effective data cleaning method on all of the validation datasets. We also compared our method to uncleaned data and six different cleaning methods and found that our algorithm out-performed these with greater accuracy and fewer unnecessary data deletions. There is an increasing demand for data cleaning methodologies to be thoroughly reported so that they can be reproduced, tested and adapted by the wider research community. In the future, it is vital that data cleaning is considered an integral part of study design and should be considered as early as possible in order to ensure that the quality of the data is conserved. Our methods have broad applicability to longitudinal and cross-sectional growth data and we propose that they could be adapted for use in other breeds, species and fields.

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.173
metaresearch head score (Gemma)0.273
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesMetaresearch
Consensus categoriesnone
DomainCandidate signal: Methods · Consensus signal: none
Study designCandidate signal: Not applicable · Consensus signal: Not applicable
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.827
Threshold uncertainty score0.917

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.1730.273
Meta-epidemiology (narrow)0.0020.001
Meta-epidemiology (broad)0.0020.003
Bibliometrics0.0050.010
Science and technology studies0.0030.003
Scholarly communication0.0060.005
Open science0.0040.007
Research integrity0.0030.005
Insufficient payload (model declined to judge)0.0090.009

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.945
GPT teacher head0.571
Teacher spread0.374 · 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.

Study designNot applicable
DomainMethods
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
Published2017
Admission routes1
Has abstractyes

Explore more

Same venueResearch Explorer (The University of Manchester)Same topicMeta-analysis and systematic reviewsFrench-language works237,207