Evidence map›Paper›PMID 36281102›Full record

ArticleMedicine2022

Prediction of renal damage in children with IgA vasculitis based on machine learning.

Jinjuan Wang, Huimin Chu, Yueli Pan

Open access · goldAbstract read
In one paragraph

Article in Medicine, 2022. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 6 papers, 1 of them a synthesis that pooled it.

0numbers the graph read from it
0cells of the map it votes in
6citing papers in PubMed, 1 pooled it
0.9field-weighted citation impact, top 24% of its field
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

6 citing papers in PubMed, 1 synthesis or guideline pooled it, 7 citations in OpenAlex.

  1. Pooled it
  2. Article
  3. Article
  4. Review
  5. Review
  6. Article
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

3 authors at 1 institution in 2 countries.

Jinjuan WangShandong University of Traditional Chinese Medicine, Shandong, PR China.
Huimin Chu
Shandong University of Traditional Chinese Medicine · CN

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

This article is objected to explore the value of machine learning algorithm in predicting the risk of renal damage in children with IgA vasculitis by constructing a predictive model and analyzing the related risk factors of IgA vasculitis Nephritis in children. Case data of 288 hospitalized children with IgA vasculitis from November 2018 to October 2021 were collected. The data included 42 indicators such as demographic characteristics, clinical symptoms and laboratory tests, etc. Univariate feature selection was used for feature extraction, and logistic regression, support vector machine (SVM), decision tree and random forest (RF) algorithms were used separately for classification prediction. Lastly, the performance of four algorithms is compared using accuracy rate, recall rate and AUC. The accuracy rate, recall rate and AUC of the established RF model were 0.83, 0.86 and 0.91 respectively, which were higher than 0.74, 0.80 and 0.89 of the logistic regression model; higher than 0.70, 0.80 and 0.89 of SVM model; higher than 0.74, 0.80 and 0.81 of the decision tree model. The top 10 important features provided by RF model are: Persistent purpura ≥4 weeks, Cr, Clinic time, ALB, WBC, TC, Relapse, TG, Recurrent purpura and EB-DNA. The model based on RF algorithm has better performance in the prediction of children with IgA vasculitis renal damage, indicated by better classification accuracy, better classification effect and better generalization performance.

Indexed as

IgA VasculitisAlgorithmsChildHumansLogistic ModelsMachine LearningSupport Vector Machine

Identifiers

PMID36281102
PMCPMC9592501
OpenAlexW4307248594

What OpenQuestion holds

Textmetadata
LicenceCC BY-NC
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.