Key result
A tree-based algorithm detected right leg lead-wire interchanges with 84-87% sensitivity and 99.9% specificity, achieving more than twice the positive predictive value of the Haisty algorithm (57% vs 24% at 0.2% prevalence).
Why the study?
Does a tree-based algorithm improve the detection of right leg ECG lead-wire interchanges compared to the Haisty algorithm?
Observational (n=1,717)
No
Does a tree-based algorithm improve the detection of right leg ECG lead-wire interchanges compared to the Haisty algorithm?
Absolute Event Rate: 57% vs 24%
A tree-based algorithm significantly improves the positive predictive value for detecting right leg ECG lead-wire interchanges compared to existing methods.
ECG lead-wire interchanges involving the right leg (RL) are not always detected. These RL lead-wire interchanges cannot be simulated in the same way as other lead-wire interchanges making database collection a necessity for algorithm development. Adult 12-lead ECGs from a single teaching hospital taken between January 2008 and July 2012 were reviewed for lead-wire interchanges by an expert electrocardiographer. Leadwire interchanges were confirmed by comparison of serial
No takes yet. Share an insight, caveat, or question.
Gregg et al. (2017) conducted an observational in ECG lead-wire interchange (n=1,717). Tree-based algorithm for RL lead-wire interchange detection vs. Haisty algorithm was evaluated on Positive predictive value (PPV) for RA-RL interchange at 0.2% prevalence. A tree-based algorithm detected right leg lead-wire interchanges with 84-87% sensitivity and 99.9% specificity, achieving more than twice the positive predictive value of the Haisty algorithm (57% vs 24% at 0.2% prevalence).
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: