<?xml version="1.0" encoding="utf-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.1d3 20150301//EN" "http://jats.nlm.nih.gov/publishing/1.1d3/JATS-journalpublishing1.dtd">
<article article-type="review-article" dtd-version="1.1d3" xml:lang="en" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">
<front>
<journal-meta>
<journal-id journal-id-type="nlm-ta">PLOS Digit Health</journal-id>
<journal-id journal-id-type="publisher-id">plos</journal-id>
<journal-id journal-id-type="pmc">plosdh</journal-id>
<journal-title-group>
<journal-title>PLOS Digital Health</journal-title>
</journal-title-group>
<issn pub-type="epub">2767-3170</issn>
<publisher>
<publisher-name>Public Library of Science</publisher-name>
<publisher-loc>San Francisco, CA USA</publisher-loc>
</publisher>
</journal-meta>
<article-meta>
<article-id pub-id-type="publisher-id">PDIG-D-23-00131</article-id>
<article-id pub-id-type="doi">10.1371/journal.pdig.0000324</article-id>
<article-categories>
<subj-group subj-group-type="heading">
<subject>Review</subject>
</subj-group>
<subj-group subj-group-type="Discipline-v3">
<subject>Physical sciences</subject><subj-group><subject>Mathematics</subject><subj-group><subject>Applied mathematics</subject><subj-group><subject>Algorithms</subject></subj-group></subj-group></subj-group></subj-group><subj-group subj-group-type="Discipline-v3">
<subject>Research and analysis methods</subject><subj-group><subject>Simulation and modeling</subject><subj-group><subject>Algorithms</subject></subj-group></subj-group></subj-group><subj-group subj-group-type="Discipline-v3">
<subject>Biology and life sciences</subject><subj-group><subject>Anatomy</subject><subj-group><subject>Cardiovascular anatomy</subject><subj-group><subject>Heart</subject></subj-group></subj-group></subj-group></subj-group><subj-group subj-group-type="Discipline-v3">
<subject>Medicine and health sciences</subject><subj-group><subject>Anatomy</subject><subj-group><subject>Cardiovascular anatomy</subject><subj-group><subject>Heart</subject></subj-group></subj-group></subj-group></subj-group><subj-group subj-group-type="Discipline-v3">
<subject>Biology and life sciences</subject><subj-group><subject>Physiology</subject><subj-group><subject>Cardiovascular physiology</subject></subj-group></subj-group></subj-group><subj-group subj-group-type="Discipline-v3">
<subject>Medicine and health sciences</subject><subj-group><subject>Diagnostic medicine</subject><subj-group><subject>Auscultation</subject></subj-group></subj-group></subj-group><subj-group subj-group-type="Discipline-v3">
<subject>Physical sciences</subject><subj-group><subject>Mathematics</subject><subj-group><subject>Applied mathematics</subject><subj-group><subject>Algorithms</subject><subj-group><subject>Machine learning algorithms</subject></subj-group></subj-group></subj-group></subj-group></subj-group><subj-group subj-group-type="Discipline-v3">
<subject>Research and analysis methods</subject><subj-group><subject>Simulation and modeling</subject><subj-group><subject>Algorithms</subject><subj-group><subject>Machine learning algorithms</subject></subj-group></subj-group></subj-group></subj-group><subj-group subj-group-type="Discipline-v3">
<subject>Computer and information sciences</subject><subj-group><subject>Artificial intelligence</subject><subj-group><subject>Machine learning</subject><subj-group><subject>Machine learning algorithms</subject></subj-group></subj-group></subj-group></subj-group><subj-group subj-group-type="Discipline-v3">
<subject>Medicine and health sciences</subject><subj-group><subject>Women's health</subject><subj-group><subject>Maternal health</subject><subj-group><subject>Pregnancy</subject></subj-group></subj-group></subj-group></subj-group><subj-group subj-group-type="Discipline-v3">
<subject>Medicine and health sciences</subject><subj-group><subject>Women's health</subject><subj-group><subject>Obstetrics and gynecology</subject><subj-group><subject>Pregnancy</subject></subj-group></subj-group></subj-group></subj-group><subj-group subj-group-type="Discipline-v3">
<subject>Medicine and health sciences</subject><subj-group><subject>Pediatrics</subject></subj-group></subj-group><subj-group subj-group-type="Discipline-v3">
<subject>Medicine and health sciences</subject><subj-group><subject>Diagnostic medicine</subject></subj-group></subj-group></article-categories>
<title-group>
<article-title>Heart murmur detection from phonocardiogram recordings: The George B. Moody PhysioNet Challenge 2022</article-title>
<alt-title alt-title-type="running-head">PhysioNet Challenge 2022</alt-title>
</title-group>
<contrib-group>
<contrib contrib-type="author" corresp="yes" xlink:type="simple">
<contrib-id authenticated="true" contrib-id-type="orcid">https://orcid.org/0000-0003-4688-7965</contrib-id>
<name name-style="western">
<surname>Reyna</surname> <given-names>Matthew A.</given-names></name>
<role content-type="http://credit.niso.org/contributor-roles/conceptualization/">Conceptualization</role>
<role content-type="http://credit.niso.org/contributor-roles/data-curation/">Data curation</role>
<role content-type="http://credit.niso.org/contributor-roles/formal-analysis/">Formal analysis</role>
<role content-type="http://credit.niso.org/contributor-roles/funding-acquisition/">Funding acquisition</role>
<role content-type="http://credit.niso.org/contributor-roles/investigation/">Investigation</role>
<role content-type="http://credit.niso.org/contributor-roles/methodology/">Methodology</role>
<role content-type="http://credit.niso.org/contributor-roles/project-administration/">Project administration</role>
<role content-type="http://credit.niso.org/contributor-roles/resources/">Resources</role>
<role content-type="http://credit.niso.org/contributor-roles/software/">Software</role>
<role content-type="http://credit.niso.org/contributor-roles/supervision/">Supervision</role>
<role content-type="http://credit.niso.org/contributor-roles/validation/">Validation</role>
<role content-type="http://credit.niso.org/contributor-roles/visualization/">Visualization</role>
<role content-type="http://credit.niso.org/contributor-roles/writing-original-draft/">Writing – original draft</role>
<role content-type="http://credit.niso.org/contributor-roles/writing-review-editing/">Writing – review &amp; editing</role>
<xref ref-type="aff" rid="aff001"><sup>1</sup></xref>
<xref ref-type="corresp" rid="cor001">*</xref>
</contrib>
<contrib contrib-type="author" xlink:type="simple">
<name name-style="western">
<surname>Kiarashi</surname> <given-names>Yashar</given-names></name>
<role content-type="http://credit.niso.org/contributor-roles/formal-analysis/">Formal analysis</role>
<role content-type="http://credit.niso.org/contributor-roles/investigation/">Investigation</role>
<role content-type="http://credit.niso.org/contributor-roles/methodology/">Methodology</role>
<role content-type="http://credit.niso.org/contributor-roles/writing-original-draft/">Writing – original draft</role>
<role content-type="http://credit.niso.org/contributor-roles/writing-review-editing/">Writing – review &amp; editing</role>
<xref ref-type="aff" rid="aff001"><sup>1</sup></xref>
</contrib>
<contrib contrib-type="author" xlink:type="simple">
<name name-style="western">
<surname>Elola</surname> <given-names>Andoni</given-names></name>
<role content-type="http://credit.niso.org/contributor-roles/conceptualization/">Conceptualization</role>
<role content-type="http://credit.niso.org/contributor-roles/data-curation/">Data curation</role>
<role content-type="http://credit.niso.org/contributor-roles/formal-analysis/">Formal analysis</role>
<role content-type="http://credit.niso.org/contributor-roles/methodology/">Methodology</role>
<role content-type="http://credit.niso.org/contributor-roles/software/">Software</role>
<role content-type="http://credit.niso.org/contributor-roles/visualization/">Visualization</role>
<role content-type="http://credit.niso.org/contributor-roles/writing-original-draft/">Writing – original draft</role>
<role content-type="http://credit.niso.org/contributor-roles/writing-review-editing/">Writing – review &amp; editing</role>
<xref ref-type="aff" rid="aff002"><sup>2</sup></xref>
</contrib>
<contrib contrib-type="author" xlink:type="simple">
<name name-style="western">
<surname>Oliveira</surname> <given-names>Jorge</given-names></name>
<role content-type="http://credit.niso.org/contributor-roles/conceptualization/">Conceptualization</role>
<role content-type="http://credit.niso.org/contributor-roles/data-curation/">Data curation</role>
<role content-type="http://credit.niso.org/contributor-roles/methodology/">Methodology</role>
<role content-type="http://credit.niso.org/contributor-roles/resources/">Resources</role>
<role content-type="http://credit.niso.org/contributor-roles/writing-original-draft/">Writing – original draft</role>
<role content-type="http://credit.niso.org/contributor-roles/writing-review-editing/">Writing – review &amp; editing</role>
<xref ref-type="aff" rid="aff003"><sup>3</sup></xref>
</contrib>
<contrib contrib-type="author" xlink:type="simple">
<name name-style="western">
<surname>Renna</surname> <given-names>Francesco</given-names></name>
<role content-type="http://credit.niso.org/contributor-roles/conceptualization/">Conceptualization</role>
<role content-type="http://credit.niso.org/contributor-roles/data-curation/">Data curation</role>
<role content-type="http://credit.niso.org/contributor-roles/formal-analysis/">Formal analysis</role>
<role content-type="http://credit.niso.org/contributor-roles/methodology/">Methodology</role>
<role content-type="http://credit.niso.org/contributor-roles/resources/">Resources</role>
<role content-type="http://credit.niso.org/contributor-roles/writing-original-draft/">Writing – original draft</role>
<role content-type="http://credit.niso.org/contributor-roles/writing-review-editing/">Writing – review &amp; editing</role>
<xref ref-type="aff" rid="aff004"><sup>4</sup></xref>
</contrib>
<contrib contrib-type="author" xlink:type="simple">
<name name-style="western">
<surname>Gu</surname> <given-names>Annie</given-names></name>
<role content-type="http://credit.niso.org/contributor-roles/resources/">Resources</role>
<role content-type="http://credit.niso.org/contributor-roles/software/">Software</role>
<xref ref-type="aff" rid="aff001"><sup>1</sup></xref>
</contrib>
<contrib contrib-type="author" xlink:type="simple">
<name name-style="western">
<surname>Perez Alday</surname> <given-names>Erick A.</given-names></name>
<role content-type="http://credit.niso.org/contributor-roles/resources/">Resources</role>
<xref ref-type="aff" rid="aff001"><sup>1</sup></xref>
</contrib>
<contrib contrib-type="author" xlink:type="simple">
<name name-style="western">
<surname>Sadr</surname> <given-names>Nadi</given-names></name>
<role content-type="http://credit.niso.org/contributor-roles/resources/">Resources</role>
<xref ref-type="aff" rid="aff001"><sup>1</sup></xref>
<xref ref-type="aff" rid="aff005"><sup>5</sup></xref>
</contrib>
<contrib contrib-type="author" deceased="yes" xlink:type="simple">
<name name-style="western">
<surname>Sharma</surname> <given-names>Ashish</given-names></name>
<role content-type="http://credit.niso.org/contributor-roles/resources/">Resources</role>
<xref ref-type="aff" rid="aff001"><sup>1</sup></xref></contrib>
<contrib contrib-type="author" xlink:type="simple">
<name name-style="western">
<surname>Kpodonu</surname> <given-names>Jacques</given-names></name>
<role content-type="http://credit.niso.org/contributor-roles/writing-review-editing/">Writing – review &amp; editing</role>
<xref ref-type="aff" rid="aff006"><sup>6</sup></xref>
</contrib>
<contrib contrib-type="author" xlink:type="simple">
<name name-style="western">
<surname>Mattos</surname> <given-names>Sandra</given-names></name>
<role content-type="http://credit.niso.org/contributor-roles/conceptualization/">Conceptualization</role>
<role content-type="http://credit.niso.org/contributor-roles/data-curation/">Data curation</role>
<role content-type="http://credit.niso.org/contributor-roles/funding-acquisition/">Funding acquisition</role>
<role content-type="http://credit.niso.org/contributor-roles/investigation/">Investigation</role>
<role content-type="http://credit.niso.org/contributor-roles/project-administration/">Project administration</role>
<role content-type="http://credit.niso.org/contributor-roles/resources/">Resources</role>
<role content-type="http://credit.niso.org/contributor-roles/supervision/">Supervision</role>
<xref ref-type="aff" rid="aff007"><sup>7</sup></xref>
</contrib>
<contrib contrib-type="author" xlink:type="simple">
<contrib-id authenticated="true" contrib-id-type="orcid">https://orcid.org/0000-0001-7501-6523</contrib-id>
<name name-style="western">
<surname>Coimbra</surname> <given-names>Miguel T.</given-names></name>
<role content-type="http://credit.niso.org/contributor-roles/conceptualization/">Conceptualization</role>
<role content-type="http://credit.niso.org/contributor-roles/data-curation/">Data curation</role>
<role content-type="http://credit.niso.org/contributor-roles/funding-acquisition/">Funding acquisition</role>
<role content-type="http://credit.niso.org/contributor-roles/investigation/">Investigation</role>
<role content-type="http://credit.niso.org/contributor-roles/project-administration/">Project administration</role>
<role content-type="http://credit.niso.org/contributor-roles/resources/">Resources</role>
<role content-type="http://credit.niso.org/contributor-roles/supervision/">Supervision</role>
<xref ref-type="aff" rid="aff004"><sup>4</sup></xref>
</contrib>
<contrib contrib-type="author" xlink:type="simple">
<contrib-id authenticated="true" contrib-id-type="orcid">https://orcid.org/0000-0003-4913-6825</contrib-id>
<name name-style="western">
<surname>Sameni</surname> <given-names>Reza</given-names></name>
<role content-type="http://credit.niso.org/contributor-roles/conceptualization/">Conceptualization</role>
<role content-type="http://credit.niso.org/contributor-roles/data-curation/">Data curation</role>
<role content-type="http://credit.niso.org/contributor-roles/formal-analysis/">Formal analysis</role>
<role content-type="http://credit.niso.org/contributor-roles/funding-acquisition/">Funding acquisition</role>
<role content-type="http://credit.niso.org/contributor-roles/investigation/">Investigation</role>
<role content-type="http://credit.niso.org/contributor-roles/methodology/">Methodology</role>
<role content-type="http://credit.niso.org/contributor-roles/project-administration/">Project administration</role>
<role content-type="http://credit.niso.org/contributor-roles/resources/">Resources</role>
<role content-type="http://credit.niso.org/contributor-roles/software/">Software</role>
<role content-type="http://credit.niso.org/contributor-roles/supervision/">Supervision</role>
<role content-type="http://credit.niso.org/contributor-roles/validation/">Validation</role>
<role content-type="http://credit.niso.org/contributor-roles/visualization/">Visualization</role>
<role content-type="http://credit.niso.org/contributor-roles/writing-original-draft/">Writing – original draft</role>
<role content-type="http://credit.niso.org/contributor-roles/writing-review-editing/">Writing – review &amp; editing</role>
<xref ref-type="aff" rid="aff001"><sup>1</sup></xref>
</contrib>
<contrib contrib-type="author" xlink:type="simple">
<name name-style="western">
<surname>Rad</surname> <given-names>Ali Bahrami</given-names></name>
<role content-type="http://credit.niso.org/contributor-roles/conceptualization/">Conceptualization</role>
<role content-type="http://credit.niso.org/contributor-roles/data-curation/">Data curation</role>
<role content-type="http://credit.niso.org/contributor-roles/formal-analysis/">Formal analysis</role>
<role content-type="http://credit.niso.org/contributor-roles/investigation/">Investigation</role>
<role content-type="http://credit.niso.org/contributor-roles/methodology/">Methodology</role>
<role content-type="http://credit.niso.org/contributor-roles/project-administration/">Project administration</role>
<role content-type="http://credit.niso.org/contributor-roles/resources/">Resources</role>
<role content-type="http://credit.niso.org/contributor-roles/software/">Software</role>
<role content-type="http://credit.niso.org/contributor-roles/supervision/">Supervision</role>
<role content-type="http://credit.niso.org/contributor-roles/writing-original-draft/">Writing – original draft</role>
<role content-type="http://credit.niso.org/contributor-roles/writing-review-editing/">Writing – review &amp; editing</role>
<xref ref-type="aff" rid="aff001"><sup>1</sup></xref>
</contrib>
<contrib contrib-type="author" xlink:type="simple">
<name name-style="western">
<surname>Clifford</surname> <given-names>Gari D.</given-names></name>
<role content-type="http://credit.niso.org/contributor-roles/conceptualization/">Conceptualization</role>
<role content-type="http://credit.niso.org/contributor-roles/data-curation/">Data curation</role>
<role content-type="http://credit.niso.org/contributor-roles/formal-analysis/">Formal analysis</role>
<role content-type="http://credit.niso.org/contributor-roles/funding-acquisition/">Funding acquisition</role>
<role content-type="http://credit.niso.org/contributor-roles/investigation/">Investigation</role>
<role content-type="http://credit.niso.org/contributor-roles/methodology/">Methodology</role>
<role content-type="http://credit.niso.org/contributor-roles/project-administration/">Project administration</role>
<role content-type="http://credit.niso.org/contributor-roles/resources/">Resources</role>
<role content-type="http://credit.niso.org/contributor-roles/software/">Software</role>
<role content-type="http://credit.niso.org/contributor-roles/supervision/">Supervision</role>
<role content-type="http://credit.niso.org/contributor-roles/validation/">Validation</role>
<role content-type="http://credit.niso.org/contributor-roles/visualization/">Visualization</role>
<role content-type="http://credit.niso.org/contributor-roles/writing-original-draft/">Writing – original draft</role>
<role content-type="http://credit.niso.org/contributor-roles/writing-review-editing/">Writing – review &amp; editing</role>
<xref ref-type="aff" rid="aff001"><sup>1</sup></xref>
<xref ref-type="aff" rid="aff008"><sup>8</sup></xref>
</contrib>
</contrib-group>
<aff id="aff001">
<label>1</label>
<addr-line>Department of Biomedical Informatics, Emory University, Atlanta, Georgia, United States of America</addr-line>
</aff>
<aff id="aff002">
<label>2</label>
<addr-line>Department of Electronic Technology, University of the Basque Country UPV/EHU, Eibar, Spain</addr-line>
</aff>
<aff id="aff003">
<label>3</label>
<addr-line>REMIT, Universidade Portucalense, Porto, Portugal</addr-line>
</aff>
<aff id="aff004">
<label>4</label>
<addr-line>INESC TEC, Faculdade de Ciências, Universidade do Porto, Porto, Portugal</addr-line>
</aff>
<aff id="aff005">
<label>5</label>
<addr-line>ResMed, Sydney, Australia</addr-line>
</aff>
<aff id="aff006">
<label>6</label>
<addr-line>Division of Cardiac Surgery, Beth Israel Deaconess Medical Center, Harvard Medical School, Boston, Massachusetts, United States of America</addr-line>
</aff>
<aff id="aff007">
<label>7</label>
<addr-line>Unidade de Cardiologia e Medicina Fetal, Real Hospital Português, Recife, Brazil</addr-line>
</aff>
<aff id="aff008">
<label>8</label>
<addr-line>Department of Biomedical Engineering, Emory University and the Georgia Institute of Technology, Atlanta, Georgia, United States of America</addr-line>
</aff>
<contrib-group>
<contrib contrib-type="editor" xlink:type="simple">
<name name-style="western">
<surname>Celi</surname> <given-names>Leo Anthony</given-names></name>
<role>Editor</role>
<xref ref-type="aff" rid="edit1"/>
</contrib>
</contrib-group>
<aff id="edit1">
<addr-line>Massachusetts Institute of Technology, UNITED STATES</addr-line>
</aff>
<author-notes>
<fn fn-type="conflict" id="coi001">
<p>I have read the journal’s policy and the authors of this manuscript have the following competing interests: AE receives financial support through grant PID2021-122727OB-I00 funded by MCIN/AEI/10.13039/501100011033 and "ERDF A way of making Europe" and by the Basque Government under Grant IT1717-22. FR and MC receive financial support by National Funds through the Portuguese funding agency, FCT - Fundação para a Ciência e a Tecnologia, within project UIDB/50014/2020. GC has financial interests in AliveCor, LifeBell AI and Mindchild Medical. GC also holds a board position in LifeBell AI and Mindchild Medical.</p>
</fn>
<fn fn-type="current-aff" id="currentaff001">
<p>¤ Current address: Department of Biomedical Informatics, Emory University, Atlanta, Georgia, United States</p>
</fn>
<corresp id="cor001">* E-mail: <email xlink:type="simple">matthew.a.reyna@emory.edu</email></corresp>
</author-notes>
<pub-date pub-type="collection">
<month>9</month>
<year>2023</year>
</pub-date>
<pub-date pub-type="epub">
<day>11</day>
<month>9</month>
<year>2023</year>
</pub-date>
<volume>2</volume>
<issue>9</issue>
<elocation-id>e0000324</elocation-id>
<history>
<date date-type="received">
<day>7</day>
<month>4</month>
<year>2023</year>
</date>
<date date-type="accepted">
<day>3</day>
<month>7</month>
<year>2023</year>
</date>
</history>
<permissions>
<copyright-year>2023</copyright-year>
<copyright-holder>Reyna et al</copyright-holder>
<license xlink:href="http://creativecommons.org/licenses/by/4.0/" xlink:type="simple">
<license-p>This is an open access article distributed under the terms of the <ext-link ext-link-type="uri" xlink:href="http://creativecommons.org/licenses/by/4.0/" xlink:type="simple">Creative Commons Attribution License</ext-link>, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.</license-p>
</license>
</permissions>
<self-uri content-type="pdf" xlink:href="info:doi/10.1371/journal.pdig.0000324"/>
<abstract>
<p>Cardiac auscultation is an accessible diagnostic screening tool that can help to identify patients with heart murmurs, who may need follow-up diagnostic screening and treatment for abnormal cardiac function. However, experts are needed to interpret the heart sounds, limiting the accessibility of cardiac auscultation in resource-constrained environments. Therefore, the George B. Moody PhysioNet Challenge 2022 invited teams to develop algorithmic approaches for detecting heart murmurs and abnormal cardiac function from phonocardiogram (PCG) recordings of heart sounds. For the Challenge, we sourced 5272 PCG recordings from 1452 primarily pediatric patients in rural Brazil, and we invited teams to implement diagnostic screening algorithms for detecting heart murmurs and abnormal cardiac function from the recordings. We required the participants to submit the complete training and inference code for their algorithms, improving the transparency, reproducibility, and utility of their work. We also devised an evaluation metric that considered the costs of screening, diagnosis, misdiagnosis, and treatment, allowing us to investigate the benefits of algorithmic diagnostic screening and facilitate the development of more clinically relevant algorithms. We received 779 algorithms from 87 teams during the Challenge, resulting in 53 working codebases for detecting heart murmurs and abnormal cardiac function from PCG recordings. These algorithms represent a diversity of approaches from both academia and industry, including methods that use more traditional machine learning techniques with engineered clinical and statistical features as well as methods that rely primarily on deep learning models to discover informative features. The use of heart sound recordings for identifying heart murmurs and abnormal cardiac function allowed us to explore the potential of algorithmic approaches for providing more accessible diagnostic screening in resource-constrained environments. The submission of working, open-source algorithms and the use of novel evaluation metrics supported the reproducibility, generalizability, and clinical relevance of the research from the Challenge.</p>
</abstract>
<abstract abstract-type="summary">
<title>Author summary</title>
<p>Cardiac auscultation is an accessible diagnostic screening tool for identifying heart murmurs. However, experts are needed to interpret heart sounds, limiting the accessibility of auscultation. Therefore, the George B. Moody PhysioNet Challenge 2022 invited teams to develop algorithms for detecting heart murmurs and abnormal cardiac function from phonocardiogram (PCG) recordings of heart sounds. For the Challenge, we sourced 5272 PCG recordings from 1452 primarily pediatric patients in rural Brazil. We required the participants to submit the complete code for their algorithms, improving the transparency, reproducibility, and utility of their work. We also devised an evaluation metric that considered the costs of screening, diagnosis, misdiagnosis, and treatment, allowing us to investigate the benefits of algorithmic diagnostic screening and facilitate the development of more clinically relevant algorithms. We received 779 algorithms from 87 teams during the Challenge, resulting in 53 working codebases and publications that represent a diversity of algorithmic approaches to detecting heart murmurs and identifying clinical outcomes from heart sound recordings.</p>
</abstract>
<funding-group>
<award-group id="award001">
<funding-source>
<institution-wrap>
<institution-id institution-id-type="funder-id">http://dx.doi.org/10.13039/100000057</institution-id>
<institution>National Institute of General Medical Sciences</institution>
</institution-wrap>
</funding-source>
<award-id>2R01GM104987-09</award-id>
<principal-award-recipient>
<name name-style="western">
<surname>Clifford</surname> <given-names>Gari D.</given-names></name>
</principal-award-recipient>
</award-group>
<award-group id="award002">
<funding-source>
<institution-wrap>
<institution-id institution-id-type="funder-id">http://dx.doi.org/10.13039/100000070</institution-id>
<institution>National Institute of Biomedical Imaging and Bioengineering</institution>
</institution-wrap>
</funding-source>
<award-id>R01EB030362</award-id>
<principal-award-recipient>
<name name-style="western">
<surname>Clifford</surname> <given-names>Gari D.</given-names></name>
</principal-award-recipient>
</award-group>
<award-group id="award003">
<funding-source>
<institution-wrap>
<institution-id institution-id-type="funder-id">http://dx.doi.org/10.13039/100006108</institution-id>
<institution>National Center for Advancing Translational Sciences</institution>
</institution-wrap>
</funding-source>
<award-id>UL1TR002378</award-id>
<principal-award-recipient>
<name name-style="western">
<surname>Clifford</surname> <given-names>Gari D.</given-names></name>
</principal-award-recipient>
</award-group>
<award-group id="award004">
<funding-source>
<institution-wrap>
<institution-id institution-id-type="funder-id">http://dx.doi.org/10.13039/100000936</institution-id>
<institution>Gordon and Betty Moore Foundation</institution>
</institution-wrap>
</funding-source>
<principal-award-recipient>
<name name-style="western">
<surname>Clifford</surname> <given-names>Gari D.</given-names></name>
</principal-award-recipient>
</award-group>
<award-group id="award005">
<funding-source>
<institution-wrap>
<institution-id institution-id-type="funder-id">http://dx.doi.org/10.13039/100014600</institution-id>
<institution>MathWorks</institution>
</institution-wrap>
</funding-source>
<principal-award-recipient>
<name name-style="western">
<surname>Clifford</surname> <given-names>Gari D.</given-names></name>
</principal-award-recipient>
</award-group>
<award-group id="award006">
<funding-source>
<institution>ERDF A way of making Europe</institution>
</funding-source>
<award-id>IT1717-22</award-id>
<principal-award-recipient>
<name name-style="western">
<surname>Elola</surname> <given-names>Andoni</given-names></name>
</principal-award-recipient>
</award-group>
<award-group id="award007">
<funding-source>
<institution-wrap>
<institution-id institution-id-type="funder-id">http://dx.doi.org/10.13039/501100005856</institution-id>
<institution>Faculdade de Ciências e Tecnologia, Universidade Nova de Lisboa</institution>
</institution-wrap>
</funding-source>
<award-id>UIDB/50014/2020</award-id>
<principal-award-recipient>
<name name-style="western">
<surname>Oliveira</surname> <given-names>Jorge</given-names></name>
</principal-award-recipient>
</award-group>
<award-group id="award008">
<funding-source>
<institution-wrap>
<institution-id institution-id-type="funder-id">http://dx.doi.org/10.13039/501100005856</institution-id>
<institution>Faculdade de Ciências e Tecnologia, Universidade Nova de Lisboa</institution>
</institution-wrap>
</funding-source>
<award-id>UIDB/50014/2020</award-id>
<principal-award-recipient>
<name name-style="western">
<surname>Renna</surname> <given-names>Francesco</given-names></name>
</principal-award-recipient>
</award-group>
<award-group id="award009">
<funding-source>
<institution-wrap>
<institution-id institution-id-type="funder-id">http://dx.doi.org/10.13039/100014600</institution-id>
<institution>MathWorks</institution>
</institution-wrap>
</funding-source>
<principal-award-recipient>
<contrib-id authenticated="true" contrib-id-type="orcid">https://orcid.org/0000-0003-4688-7965</contrib-id>
<name name-style="western">
<surname>Reyna</surname> <given-names>Matthew A.</given-names></name>
</principal-award-recipient>
</award-group>
<award-group id="award010">
<funding-source>
<institution-wrap>
<institution-id institution-id-type="funder-id">http://dx.doi.org/10.13039/100000936</institution-id>
<institution>Gordon and Betty Moore Foundation</institution>
</institution-wrap>
</funding-source>
<principal-award-recipient>
<contrib-id authenticated="true" contrib-id-type="orcid">https://orcid.org/0000-0003-4688-7965</contrib-id>
<name name-style="western">
<surname>Reyna</surname> <given-names>Matthew A.</given-names></name>
</principal-award-recipient>
</award-group>
<award-group id="award011">
<funding-source>
<institution-wrap>
<institution-id institution-id-type="funder-id">http://dx.doi.org/10.13039/100000057</institution-id>
<institution>National Institute of General Medical Sciences</institution>
</institution-wrap>
</funding-source>
<award-id>2R01GM104987-09</award-id>
<principal-award-recipient>
<contrib-id authenticated="true" contrib-id-type="orcid">https://orcid.org/0000-0003-4688-7965</contrib-id>
<name name-style="western">
<surname>Reyna</surname> <given-names>Matthew A.</given-names></name>
</principal-award-recipient>
</award-group>
<award-group id="award012">
<funding-source>
<institution-wrap>
<institution-id institution-id-type="funder-id">http://dx.doi.org/10.13039/100000070</institution-id>
<institution>National Institute of Biomedical Imaging and Bioengineering</institution>
</institution-wrap>
</funding-source>
<award-id>R01EB030362</award-id>
<principal-award-recipient>
<contrib-id authenticated="true" contrib-id-type="orcid">https://orcid.org/0000-0003-4688-7965</contrib-id>
<name name-style="western">
<surname>Reyna</surname> <given-names>Matthew A.</given-names></name>
</principal-award-recipient>
</award-group>
<award-group id="award013">
<funding-source>
<institution-wrap>
<institution-id institution-id-type="funder-id">http://dx.doi.org/10.13039/100006108</institution-id>
<institution>National Center for Advancing Translational Sciences</institution>
</institution-wrap>
</funding-source>
<award-id>UL1TR002378</award-id>
<principal-award-recipient>
<contrib-id authenticated="true" contrib-id-type="orcid">https://orcid.org/0000-0003-4688-7965</contrib-id>
<name name-style="western">
<surname>Reyna</surname> <given-names>Matthew A.</given-names></name>
</principal-award-recipient>
</award-group>
<funding-statement>This research is supported by the National Institute of General Medical Sciences (NIGMS) and the National Institute of Biomedical Imaging and Bioengineering (NIBIB) under NIH grant numbers 2R01GM104987-09 and R01EB030362 respectively, the National Center for Advancing Translational Sciences of the National Institutes of Health under Award Number UL1TR002378, as well as the Gordon and Betty Moore Foundation and MathWorks under unrestricted gifts. AE receives financial support through grant PID2021-122727OB-I00 funded by MCIN/AEI/10.13039/501100011033 and "ERDF A way of making Europe" and by the Basque Government under Grant IT1717-22. FR and MC receive financial support by National Funds through the Portuguese funding agency, FCT - Fundação para a Ciência e a Tecnologia, within project UIDB/50014/2020. None of the aforementioned entities influenced the design of the Challenge or provided data for the Challenge. The funders had no role in study design, data collection and analysis, decision to publish, or preparation of the manuscript.</funding-statement>
</funding-group>
<counts>
<fig-count count="7"/>
<table-count count="6"/>
<page-count count="22"/>
</counts>
<custom-meta-group>
<custom-meta id="data-availability">
<meta-name>Data Availability</meta-name>
<meta-value>J. H. Oliveira, F. Renna, P. Costa, D. Nogueira, C. Oliveira, C. Ferreira, A. Jorge, S. Mattos, T. Hatem, T. Tavares, A. Elola, A. Rad, R. Sameni, G. D. Clifford, &amp; M. T. Coimbra (2021). The CirCor DigiScope Dataset: From Murmur Detection to Murmur Classification. IEEE Journal of Biomedical and Health Informatics, <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1109/JBHI.2021.3137048" xlink:type="simple">https://doi.org/10.1109/JBHI.2021.3137048</ext-link>. The Challenge data can be downloaded from Oliveira, J., Renna, F., Costa, P., Nogueira, M., Oliveira, A. C., Elola, A., Ferreira, C., Jorge, A., Bahrami Rad, A., Reyna, M., Sameni, R., Clifford, G., &amp; Coimbra, M. (2022). The CirCor DigiScope Phonocardiogram Dataset (version 1.0.3). PhysioNet. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.13026/tshs-mw03" xlink:type="simple">https://doi.org/10.13026/tshs-mw03</ext-link>.</meta-value>
</custom-meta>
</custom-meta-group>
</article-meta>
</front>
<body>
<sec id="sec001" sec-type="intro">
<title>Introduction</title>
<p>Cardiac auscultation via stethoscopes remains the most common and the most cost-effective tool for cardiac pre-screening. However, despite its popularity, cardiac auscultation has limited diagnostic sensitivity and accuracy because the interpretation of heart sounds from stethoscopes requires many years of experience and skill, leading to significant disagreement between medical personnel [<xref ref-type="bibr" rid="pdig.0000324.ref001">1</xref>, <xref ref-type="bibr" rid="pdig.0000324.ref002">2</xref>, <xref ref-type="bibr" rid="pdig.0000324.ref003">3</xref>, <xref ref-type="bibr" rid="pdig.0000324.ref004">4</xref>]. Digital phonocardiography has emerged as a more objective alternative to traditional cardiac auscultation. The phonocardiogram (PCG) can be acquired by a combination of high-fidelity stethoscope front-ends and high-resolution digital sampling circuitry, which enable the registration of heart sounds as a discrete-time signal and enable the use of algorithmic methods for heart sound analysis and diagnosis [<xref ref-type="bibr" rid="pdig.0000324.ref005">5</xref>].</p>
<p>As acoustic signals, heart sounds are mainly generated by the vibrations of cardiac valves as they open and close during the cardiac cycle. Turbulent blood flow may cause vibrations around the cardiac valves that create audible heart sounds and abnormal waveforms in the PCG, which are called <italic>murmurs</italic>. Different kinds of murmurs exist, and they are characterized in various ways, including location, timing, duration, shape, intensity, and pitch. The identification and analysis of murmurs can provide valuable information about cardiovascular pathologies.</p>
<p>However, while cardiac auscultation itself is relatively accessible, experts are needed to interpret heart sounds and PCGs, limiting the accessibility of auscultation for cardiac disease management, especially in resource-constrained environments, where limited access to clinical experts and infrastructure prevents widespread screening. The ability to correctly interpret PCGs for detecting murmurs and identifying different pathologies requires time and broad clinical experience. Therefore, the objective interpretation of the PCG remains a difficult skill to acquire.</p>
<p>The 2022 George B. Moody PhysioNet Challenge (formerly the PhysioNet/Computing in Cardiology Challenge) provided an opportunity to address these issues by inviting teams to develop automated approaches for detecting heart murmurs and abnormal cardiac function from PCG recordings. We sourced and shared PCGs from a largely pediatric population in Brazil, and we asked teams to use the PCGs to identify both heart murmurs and the clinical outcomes of a full diagnostic screening. The Challenge explored the potential of algorithmic approaches for interpreting heart sound recordings as part of diagnostic screening for more accessible cardiac care.</p>
</sec>
<sec id="sec002" sec-type="materials|methods">
<title>Methods</title>
<sec id="sec003">
<title>Challenge data</title>
<p>The CirCor DigiScope dataset [<xref ref-type="bibr" rid="pdig.0000324.ref006">6</xref>] was used for the George B. Moody PhysioNet Challenge 2022. This dataset consists of 5268 PCG recordings from one or more auscultation locations during 1568 patient encounters with 1452 distinct patients. The patient population was primarily pediatric, ranging from neonates to adolescents, but it also included pregnant adults; no recordings were collected from fetuses. The dataset was collected during two screening campaigns in Paraíba, Brazil from July 2014 to August 2014 and from June 2015 to July 2015. The study protocol was approved by the 5192-Complexo Hospitalar HUOC/PROCAPE Institutional Review Board under the request of the Real Hospital Português de Beneficiência em Pernambuco. A detailed description of the dataset can be found in [<xref ref-type="bibr" rid="pdig.0000324.ref006">6</xref>].</p>
<p>During the data collection sessions, each participant answered a sociodemographic questionnaire, followed by a clinical examination (anamnesis and physical examination), a nursing assessment (physiological measurements), and cardiac investigations (cardiac auscultation, chest radiography, electrocardiogram, and echocardiogram). The collected data were then analyzed by an expert pediatric cardiologist. The expert could re-auscultate the participant and/or request complementary tests. At the end of a session, the pediatric cardiologist either directed the participant for a follow-up appointment, referred the participant to cardiac catheterization or heart surgery, or discharged the participant.</p>
<p>The PCGs were recorded using an electronic auscultation device, the Littmann 3200 stethoscope, from up to four auscultation locations on the body; see <xref ref-type="fig" rid="pdig.0000324.g001">Fig 1</xref>:</p>
<list list-type="bullet">
<list-item>
<p>Aortic valve: second intercostal space, right sternal border;</p>
</list-item>
<list-item>
<p>Pulmonic valve: second intercostal space, left sternal border;</p>
</list-item>
<list-item>
<p>Tricuspid valve: lower left sternal border; and</p>
</list-item>
<list-item>
<p>Mitral valve: fifth intercostal space, midclavicular line (cardiac apex).</p>
</list-item>
</list>
<fig id="pdig.0000324.g001" position="float">
<object-id pub-id-type="doi">10.1371/journal.pdig.0000324.g001</object-id>
<label>Fig 1</label>
<caption>
<title>Auscultation locations for the CirCor DigiScope dataset [<xref ref-type="bibr" rid="pdig.0000324.ref006">6</xref>], which was used for the Challenge: Pulmonary valve (PV), aortic valve (AV), mitral valve (MV), and tricuspid valve (TV).</title>
</caption>
<graphic mimetype="image" position="float" xlink:href="info:doi/10.1371/journal.pdig.0000324.g001" xlink:type="simple"/>
</fig>
<p>The choice of locations, the number of recordings at each location, and the duration of the PCGs varied between patients. The PCGs were recorded by multiple operators, but the PCGs for each patient encounter were recorded by a single operator, and they were recorded in a sequential manner, i.e., not simultaneously. The PCGs were also inspected for signal quality and semi-automatically segmented using the three algorithms proposed in [<xref ref-type="bibr" rid="pdig.0000324.ref007">7</xref>], [<xref ref-type="bibr" rid="pdig.0000324.ref008">8</xref>], and [<xref ref-type="bibr" rid="pdig.0000324.ref009">9</xref>] and then corrected, as deemed necessary, by a cardiac physiologist.</p>
<p>Each patient’s PCGs and clinical notes were also annotated for murmurs and abnormal cardiac function (described below). These annotations served as the labels for the Challenge.</p>
<p>The murmur annotations and characteristics (location, timing, shape, pitch, quality, and grade) were manually identified by a single cardiac physiologist independently of the available clinical notes and PCG segmentation. The cardiac physiologist annotated the PCGs by listening to the audio recordings and by visually inspecting the corresponding waveforms. The murmur annotations indicated whether the annotator could detect the presence or absence of a murmur in a patient from the PCG recordings for the patient or whether the annotator was unsure about the presence or absence of a murmur. The murmur annotations did not indicate whether a murmur was pathological or innocent.</p>
<p>The clinical outcome annotations were determined by cardiac physiologists using all available clinical notes, including the socio-demographic questionnaire, clinical examination, nursing assessment, and cardiac investigations. In particular, these notes include reports from an echocardiogram, which is a standard diagnostic tool for characterizing cardiac function. The clinical outcome annotations indicated whether the expert annotator identified normal or abnormal cardiac function. The clinical outcome annotations were performed by different experts, and these experts were different from the expert who performed the murmur annotations.</p>
<p>In total, the Challenge dataset consisted of 5272 annotated PCG recordings from 1568 patient encounters with 1452 patients. We released 60% of the recordings in a public training set and retained 10% of the recordings in a private validation set and 30% of the recordings in a private test set. The training, validation, and test sets were matched to approximately preserve the univariate distributions of the variables in the data. Data from patients who participated in multiple screening campaigns belonged to only one of the training, validation, or test sets to prevent data leakage. We shared the training set at the beginning of the Challenge to allow the participants to develop their algorithms, and we sequestered the validation and test sets during the Challenge to evaluate the submitted the algorithms.</p>
<p>
<xref ref-type="table" rid="pdig.0000324.t001">Table 1</xref> summarizes the variables provided in the training, validation, and test sets of the Challenge data. <xref ref-type="table" rid="pdig.0000324.t002">Table 2</xref> summarizes the distributions of the variables provided with the data.</p>
<table-wrap id="pdig.0000324.t001" position="float">
<object-id pub-id-type="doi">10.1371/journal.pdig.0000324.t001</object-id>
<label>Table 1</label>
<caption>
<title>Demographic, murmur, and clinical outcome information in the Challenge training, validation, and/or test sets; <monospace specific-use="no-wrap">nan</monospace> values indicate unknown or missing values.</title>
</caption>
<alternatives>
<graphic id="pdig.0000324.t001g" mimetype="image" position="float" xlink:href="info:doi/10.1371/journal.pdig.0000324.t001" xlink:type="simple"/>
<table border="0" frame="box" rules="all">
<colgroup>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
</colgroup>
<thead>
<tr>
<th align="left">Variable</th>
<th align="left">Description</th>
<th align="left">Possible values</th>
<th align="left">Dataset splits</th>
</tr>
</thead>
<tbody>
<tr>
<td align="left">Age</td>
<td align="left">Reported age</td>
<td align="left">Neonate (birth to 27 days), Infant (28 days to 1 year), Child (1 to 11 years), Adolescent (12 to 18 years), <monospace specific-use="no-wrap">nan</monospace> (unknown)</td>
<td align="left">Training, validation, test</td>
</tr>
<tr>
<td align="left">Sex</td>
<td align="left">Reported sex</td>
<td align="left">Female, Male</td>
<td align="left">Training, validation, test</td>
</tr>
<tr>
<td align="left">Height</td>
<td align="left">Height in centimeters</td>
<td align="left">Positive number or <monospace specific-use="no-wrap">nan</monospace> (unknown)</td>
<td align="left">Training, validation, test</td>
</tr>
<tr>
<td align="left">Weight</td>
<td align="left">Weight in kilograms</td>
<td align="left">Positive number or <monospace specific-use="no-wrap">nan</monospace> (unknown)</td>
<td align="left">Training, validation, test</td>
</tr>
<tr>
<td align="left">Pregnancy status</td>
<td align="left">Reported pregnancy status</td>
<td align="left">True, False</td>
<td align="left">Training, validation, test</td>
</tr>
<tr>
<td align="left">Murmur</td>
<td align="left">Indicates if a murmur is present, absent, or unidentifiable or unknown for the annotator; a Challenge label</td>
<td align="left">Present, Absent, Unknown</td>
<td align="left">Training</td>
</tr>
<tr>
<td align="left">Murmur locations</td>
<td align="left">Auscultation locations for observed murmurs</td>
<td align="left">PV, TV, AV, MV, Phc, <monospace specific-use="no-wrap">nan</monospace> (unknown); concatenated with <monospace specific-use="no-wrap">+</monospace></td>
<td align="left">Training</td>
</tr>
<tr>
<td align="left">Most audible location</td>
<td align="left">Auscultation location where murmurs sounded most intense</td>
<td align="left">PV, TV, AV, MV, Phc, <monospace specific-use="no-wrap">nan</monospace> (unknown)</td>
<td align="left">Training</td>
</tr>
<tr>
<td align="left">Systolic murmur timing</td>
<td align="left">Timing of the murmur within the systolic period</td>
<td align="left">Early-systolic, Mid-systolic, Late-systolic, Holosystolic, <monospace specific-use="no-wrap">nan</monospace> (unknown)</td>
<td align="left">Training</td>
</tr>
<tr>
<td align="left">Systolic murmur shape</td>
<td align="left">Shape of the murmur in the systolic period</td>
<td align="left">Crescendo, Decrescendo, Diamond, Plateau, <monospace specific-use="no-wrap">nan</monospace> (unknown)</td>
<td align="left">Training</td>
</tr>
<tr>
<td align="left">Systolic murmur pitch</td>
<td align="left">Pitch of the murmur in the systolic period</td>
<td align="left">Low, Medium, High, <monospace specific-use="no-wrap">nan</monospace> (unknown)</td>
<td align="left">Training</td>
</tr>
<tr>
<td align="left">Systolic murmur grading</td>
<td align="left">Grading of the murmur in the systolic period according to a modified Levine scale [<xref ref-type="bibr" rid="pdig.0000324.ref010">10</xref>]</td>
<td align="left">I/VI, II/VI, III/VI, <monospace specific-use="no-wrap">nan</monospace> (unknown)</td>
<td align="left">Training</td>
</tr>
<tr>
<td align="left">Systolic murmur quality</td>
<td align="left">Quality of the murmur in the systolic period</td>
<td align="left">Blowing, Harsh, Musical, <monospace specific-use="no-wrap">nan</monospace> (unknown)</td>
<td align="left">Training</td>
</tr>
<tr>
<td align="left">Diastolic murmur timing</td>
<td align="left">Timing of the murmur within the diastolic period</td>
<td align="left">Early-diastolic, Mid-diastolic, Holodiastolic, <monospace specific-use="no-wrap">nan</monospace> (unknown)</td>
<td align="left">Training</td>
</tr>
<tr>
<td align="left">Diastolic murmur shape</td>
<td align="left">Shape of the murmur in the diastolic period</td>
<td align="left">Decrescendo, Plateau, <monospace specific-use="no-wrap">nan</monospace> (unknown)</td>
<td align="left">Training</td>
</tr>
<tr>
<td align="left">Diastolic murmur pitch</td>
<td align="left">Pitch of the murmur in the diastolic period</td>
<td align="left">Low, Medium, High, <monospace specific-use="no-wrap">nan</monospace> (unknown)</td>
<td align="left">Training</td>
</tr>
<tr>
<td align="left">Diastolic murmur grading</td>
<td align="left">Grading of the murmur in the diastolic period</td>
<td align="left">I/IV, II/IV, III/IV, <monospace specific-use="no-wrap">nan</monospace> (unknown)</td>
<td align="left">Training</td>
</tr>
<tr>
<td align="left">Diastolic murmur quality</td>
<td align="left">Quality of the murmur in the diastolic period</td>
<td align="left">Blowing, Harsh, <monospace specific-use="no-wrap">nan</monospace> (unknown)</td>
<td align="left">Training</td>
</tr>
<tr>
<td align="left">Outcome</td>
<td align="left">Indicates a normal or abnormal clinical outcome as diagnosed by the medical expert; a Challenge label</td>
<td align="left">Normal, Abnormal</td>
<td align="left">Training</td>
</tr>
<tr>
<td align="left">Campaign</td>
<td align="left">Screening campaign attended by the patient</td>
<td align="left">CC2014, CC2015</td>
<td align="left">Training</td>
</tr>
<tr>
<td align="left">Additional ID</td>
<td align="left">Other patient identifier for patients who attended both screening campaigns</td>
<td align="left">Patient identifier</td>
<td align="left">Training</td>
</tr>
</tbody>
</table>
</alternatives>
</table-wrap>
<table-wrap id="pdig.0000324.t002" position="float">
<object-id pub-id-type="doi">10.1371/journal.pdig.0000324.t002</object-id>
<label>Table 2</label>
<caption>
<title>Demographic, murmur, and clinical outcome distributions across the Challenge training, validation, and test data.</title>
<p>For categorical variables, the entries of the table denote the fraction of the dataset with each possible value. For numerical variables, the entries of the table denote the median and first and third quartiles, respectively, of the values in the dataset, i.e., median [Q1, Q3].</p>
</caption>
<alternatives>
<graphic id="pdig.0000324.t002g" mimetype="image" position="float" xlink:href="info:doi/10.1371/journal.pdig.0000324.t002" xlink:type="simple"/>
<table border="0" frame="box" rules="all">
<colgroup>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
</colgroup>
<thead>
<tr>
<th align="left">Variable</th>
<th align="right">Training set</th>
<th align="right">Validation set</th>
<th align="right">Test set</th>
<th align="right">Entire dataset</th>
</tr>
</thead>
<tbody>
<tr>
<td align="left">Age</td>
<td align="right"/>
<td align="right"/>
<td align="right"/>
<td align="right"/>
</tr>
<tr>
<td align="left">- Neonate</td>
<td align="right">0.006</td>
<td align="right">0.007</td>
<td align="right">0.006</td>
<td align="right">0.006</td>
</tr>
<tr>
<td align="left">- Infant</td>
<td align="right">0.134</td>
<td align="right">0.101</td>
<td align="right">0.107</td>
<td align="right">0.122</td>
</tr>
<tr>
<td align="left">- Child</td>
<td align="right">0.705</td>
<td align="right">0.678</td>
<td align="right">0.723</td>
<td align="right">0.708</td>
</tr>
<tr>
<td align="left">- Adolescent</td>
<td align="right">0.076</td>
<td align="right">0.094</td>
<td align="right">0.099</td>
<td align="right">0.085</td>
</tr>
<tr>
<td align="left">- <monospace specific-use="no-wrap">nan</monospace></td>
<td align="right">0.079</td>
<td align="right">0.121</td>
<td align="right">0.065</td>
<td align="right">0.078</td>
</tr>
<tr>
<td align="left">Sex</td>
<td align="right"/>
<td align="right"/>
<td align="right"/>
<td align="right"/>
</tr>
<tr>
<td align="left">- Female</td>
<td align="right">0.516</td>
<td align="right">0.530</td>
<td align="right">0.453</td>
<td align="right">0.498</td>
</tr>
<tr>
<td align="left">- Male</td>
<td align="right">0.484</td>
<td align="right">0.470</td>
<td align="right">0.547</td>
<td align="right">0.502</td>
</tr>
<tr>
<td align="left">Height</td>
<td align="right">115 [89, 133] cm</td>
<td align="right">116 [89, 136] cm</td>
<td align="right">113 [92, 135] cm</td>
<td align="right">115 [89, 134] cm</td>
</tr>
<tr>
<td align="left">Weight</td>
<td align="right">20.4 [12.5, 31.2] kg</td>
<td align="right">20.9 [12.9, 34.6] kg</td>
<td align="right">21.0 [13.4, 32.7] kg</td>
<td align="right">20.6 [12.7, 32.0] kg</td>
</tr>
<tr>
<td align="left">Pregnancy status</td>
<td align="right"/>
<td align="right"/>
<td align="right"/>
<td align="right"/>
</tr>
<tr>
<td align="left">- False</td>
<td align="right">0.926</td>
<td align="right">0.899</td>
<td align="right">0.948</td>
<td align="right">0.930</td>
</tr>
<tr>
<td align="left">- True</td>
<td align="right">0.074</td>
<td align="right">0.101</td>
<td align="right">0.052</td>
<td align="right">0.070</td>
</tr>
<tr>
<td align="left">Murmur</td>
<td align="right"/>
<td align="right"/>
<td align="right"/>
<td align="right"/>
</tr>
<tr>
<td align="left">- Absent</td>
<td align="right">0.738</td>
<td align="right">0.711</td>
<td align="right">0.719</td>
<td align="right">0.730</td>
</tr>
<tr>
<td align="left">- Unknown</td>
<td align="right">0.072</td>
<td align="right">0.107</td>
<td align="right">0.073</td>
<td align="right">0.076</td>
</tr>
<tr>
<td align="left">- Present</td>
<td align="right">0.190</td>
<td align="right">0.181</td>
<td align="right">0.208</td>
<td align="right">0.195</td>
</tr>
<tr>
<td align="left">Outcome</td>
<td align="right"/>
<td align="right"/>
<td align="right"/>
<td align="right"/>
</tr>
<tr>
<td align="left">- Normal</td>
<td align="right">0.516</td>
<td align="right">0.617</td>
<td align="right">0.493</td>
<td align="right">0.518</td>
</tr>
<tr>
<td align="left">- Abnormal</td>
<td align="right">0.484</td>
<td align="right">0.383</td>
<td align="right">0.507</td>
<td align="right">0.482</td>
</tr>
<tr>
<td align="left">Campaign</td>
<td align="right"/>
<td align="right"/>
<td align="right"/>
<td align="right"/>
</tr>
<tr>
<td align="left">- CC2014</td>
<td align="right">0.409</td>
<td align="right">0.403</td>
<td align="right">0.436</td>
<td align="right">0.416</td>
</tr>
<tr>
<td align="left">- CC2015</td>
<td align="right">0.591</td>
<td align="right">0.597</td>
<td align="right">0.564</td>
<td align="right">0.584</td>
</tr>
</tbody>
</table>
</alternatives>
</table-wrap>
</sec>
<sec id="sec004">
<title>Challenge objective</title>
<p>We designed the Challenge to explore the potential for algorithmic pre-screening of heart murmurs and abnormal heart function, especially in resource-constrained environments [<xref ref-type="bibr" rid="pdig.0000324.ref018">18</xref>]. We asked the Challenge participants to design working, open-source algorithms for detecting heart murmurs and abnormal cardiac function from PCG recordings. For each patient encounter, each algorithm interpreted the PCG recordings and/or demographic data.</p>
<sec id="sec005">
<title>Challenge timeline</title>
<p>The George B./ Moody PhysioNet Challenge 2022 was the 23<sup>rd</sup> George B. Moody PhysioNet Challenge [<xref ref-type="bibr" rid="pdig.0000324.ref011">11</xref>, <xref ref-type="bibr" rid="pdig.0000324.ref018">18</xref>]. As with previous Challenges, the 2022 Challenge had an unofficial phase and an official phase.</p>
<p>The unofficial phase (February 1, 2022 to April 8, 2022) introduced the teams to the Challenge. We publicly shared the Challenge objective, training data, example algorithms, and evaluation metrics at the beginning of the unofficial phase. At this time, we only had access to the patients’ murmur annotations, so we only asked the teams to detect murmurs. We invited the teams to submit the entries with the code for their algorithms for evaluation, and we scored at most 5 entries from each team on the hidden validation set during the unofficial phase.</p>
<p>Between the unofficial phase and official phase, we took a hiatus (April 9, 2022 to April 30, 2022) to improve the Challenge in response to feedback from the teams, the broader community, and our collaborators. During this time, we added the patients’ clinical outcomes for abnormal cardiac function to the CirCor DigiScope dataset [<xref ref-type="bibr" rid="pdig.0000324.ref006">6</xref>].</p>
<p>The official phase (May 1, 2022 to August 15, 2022) allowed the teams to refine their approaches for the Challenge. We updated the Challenge objectives, data, example algorithms, and evaluation metric at the beginning of the official phase. At this time, we had access to both the patients’ murmur annotation and clinical outcomes, so we asked the teams to detect murmurs and abnormal cardiac function. We again invited the teams to submit their entries for evaluation, and we scored at most 10 entries from each team on the hidden validation set during the official phase.</p>
<p>After the end of the official phase, we asked each team to choose a single entry from their team for evaluation on the test set. We allowed the teams to choose any successful model from the official phase, but most teams chose their best-scoring entries. We only evaluated one entry from each team to prevent sequential training on the test set. The winners of the Challenge were the teams with the best scores on the test set. We announced the winners at the end of the Computing in Cardiology (CinC) 2022 conference.</p>
<p>The teams presented and defended their work at CinC 2022, which was held in Tampere, Finland. As described in the next section, the teams wrote four-page conference proceeding paper describing their work, which we reviewed for accuracy and coherence. The code for their algorithms will be publicly released after the end of the Challenge and the publication of the papers on the Challenge website.</p>
</sec>
<sec id="sec006">
<title>Challenge rules and expectations</title>
<p>We encouraged the teams to ask questions, pose concerns, and discuss the Challenge in a public forum, but we prohibited them from discussing or sharing their work during the unofficial phase, hiatus, or official phase of the Challenge to preserve the diversity and uniqueness of their approaches.</p>
<p>For both phases of the Challenge, we required the teams to submit the complete code for their algorithms, including their preprocessing, training, and inference steps. We first ran each team’s training code on the public training set to train the models. We then ran the trained models on the hidden validation and test sets to label the data; we ran the trained models on each patient sequentially to reflect the sequential nature of the screening process. We then scored the outputs from the models using the expert annotations on hidden validation and test sets.</p>
<p>We allowed the teams to submit either MATLAB or Python code; other programming languages were considered upon request, but there were no requests for other programming languages. Participants containerized their code in Docker and submitted it by sharing private GitHub or Gitlab repositories with their code. We downloaded their code and ran it in containerized environments on Google Cloud. We described the computational architecture of these environments more fully in [<xref ref-type="bibr" rid="pdig.0000324.ref012">12</xref>].</p>
<p>Each entry had access to 8 virtual CPUs, 52 GB RAM, 50 GB local storage, and an optional NVIDIA T4 Tensor Core GPU (driver version 470.82.01) with 16 GB VRAM. We imposed a 72-hour time limit for training each entry on the training set without a GPU, a 48-hour time limit for training each entry on the training set with a GPU, and a 24-hour time limit for running each trained entry on either the validation or test set either with or without a GPU.</p>
<p>To aid the teams, we shared example MATLAB and Python entries. These examples used random forest classifiers with the age group, sex, height, weight, pregnancy status of the patient as well as the presence, mean, variance, and skewness of the numerical values in each PCG recording as features. We did not design these example entries to perform well. Instead, we designed them to provide minimal working examples of how to read the Challenge data and write the model outputs.</p>
</sec>
<sec id="sec007">
<title>Challenge evaluation</title>
<p>To capture the focus of the 2022 Challenge on algorithmic screening for heart murmurs and abnormal cardiac function, we developed novel scoring metrics for each of the two Challenge tasks: detecting heart murmurs and identifying clinical outcomes for abnormal or normal heart function.</p>
<p>As described above, the murmurs were directly observable from the PCG recordings, but the clinical outcomes were determined by a more comprehensive diagnostic screening, including the interpretation of an echocardiogram. However, despite these differences, we asked the teams to perform both tasks using only the PCGs and routine demographic data, which allowed us to explore the diagnostic potential of algorithmic approaches for the interpretation of relatively easily accessible PCGs.</p>
<p>The algorithms for both of these tasks effectively pre-screened patients for expert referral. Under this paradigm, if an algorithm inferred potentially abnormal cardiac function, i.e., the model outputs were murmur present, murmur unknown, or outcome abnormal, then the algorithm would refer the patient to a human expert for a confirmatory diagnosis and potential treatment. If the algorithm inferred normal cardiac function, i.e., if the model outputs were murmur absent or outcome normal, then the algorithm would not refer the patient to an expert and the patient would not receive treatment. <xref ref-type="fig" rid="pdig.0000324.g002">Fig 2</xref> illustrates this algorithmic pre-screening process as part of a larger diagnostic pipeline.</p>
<fig id="pdig.0000324.g002" position="float">
<object-id pub-id-type="doi">10.1371/journal.pdig.0000324.g002</object-id>
<label>Fig 2</label>
<caption>
<title>Screening and diagnosis pipeline for the Challenge.</title>
<p>All patients would receive algorithmic pre-screening, and patients with positive results from algorithmic pre-screening would receive confirmatory expert screening and diagnosis. (i) Patients with positive results from algorithmic pre-screening and expert annotators would receive treatment; they are true positive cases. Patients with positive results from algorithmic pre-screening and negative results from expert annotators would not receive treatment; they are false positive cases or false alarms. Patients with negative results from algorithmic pre-screening who would have received positive results from the expert annotators would have missed or delayed treatment; they are false negative cases. Patients with negative results from algorithmic pre-screening who would have also received negative results from expert annotators also would not receive treatment; they are true negative cases.</p>
</caption>
<graphic mimetype="image" position="float" xlink:href="info:doi/10.1371/journal.pdig.0000324.g002" xlink:type="simple"/>
</fig>
<p>For the murmur detection task, we introduced a weighted accuracy metric that assessed the ability of an algorithm to reproduce the results of a skilled human annotator. For the clinical outcome identification task, we introduced a cost-based scoring metric that reflected the cost of expert diagnostic screening as well as the costs of timely, missed, and delayed treatment for abnormal cardiac function. The team with the highest weighted accuracy metric won the murmur detection task, and the team with the lowest cost-based evaluation metric won the clinical outcome identification task.</p>
<p>We formulated versions of both of these evaluation metrics for both tasks to allow for more direct comparisons; see <xref ref-type="supplementary-material" rid="pdig.0000324.s001">S1 Appendix</xref> for the additional metrics. We also calculated several traditional evaluation metrics to provide additional context to the performance of the models.</p>
<p>Cost-based scoring is controversial, in part, because healthcare costs are an imperfect proxy for health needs [<xref ref-type="bibr" rid="pdig.0000324.ref013">13</xref>, <xref ref-type="bibr" rid="pdig.0000324.ref014">14</xref>]; we reflect on this important issue in the Discussion section. However, screening costs necessarily limit the ability to perform screening, especially in more resource-constrained environments, so we considered costs as an imperfect proxy for improving access to cardiac screening.</p>
</sec>
<sec id="sec008">
<title>Weighted accuracy metric</title>
<p>We introduced a weighted accuracy metric to evaluate the murmur detection algorithms. This metric assessed the ability of the algorithms to reproduce the decisions of the expert annotator. This weighted accuracy metric is similar to the traditional accuracy metric, but it assigned more weight to patients that had or potentially had murmurs than to patients that did not have murmurs. These weights reflect the rationale that, in general, a missed diagnosis is more harmful than a false alarm.</p>
<p>We defined the weighted accuracy metric for the murmur detection task as
<disp-formula id="pdig.0000324.e001"><alternatives><graphic id="pdig.0000324.e001g" mimetype="image" position="anchor" xlink:href="info:doi/10.1371/journal.pdig.0000324.e001" xlink:type="simple"/><mml:math display="block" id="M1"><mml:mtable displaystyle="true"><mml:mtr><mml:mtd columnalign="right"><mml:mrow><mml:msub><mml:mi>a</mml:mi> <mml:mtext>murmur</mml:mtext></mml:msub> <mml:mo>=</mml:mo> <mml:mfrac><mml:mrow><mml:mn>5</mml:mn> <mml:msub><mml:mi>m</mml:mi> <mml:mtext>PP</mml:mtext></mml:msub> <mml:mo>+</mml:mo> <mml:mn>3</mml:mn> <mml:msub><mml:mi>m</mml:mi> <mml:mtext>UU</mml:mtext></mml:msub> <mml:mo>+</mml:mo> <mml:msub><mml:mi>m</mml:mi> <mml:mtext>AA</mml:mtext></mml:msub></mml:mrow> <mml:mrow><mml:mn>5</mml:mn> <mml:mrow><mml:mo>(</mml:mo> <mml:msub><mml:mi>m</mml:mi> <mml:mtext>PP</mml:mtext></mml:msub> <mml:mo>+</mml:mo> <mml:msub><mml:mi>m</mml:mi> <mml:mtext>UP</mml:mtext></mml:msub> <mml:mo>+</mml:mo> <mml:msub><mml:mi>m</mml:mi> <mml:mtext>AP</mml:mtext></mml:msub> <mml:mo>)</mml:mo></mml:mrow> <mml:mo>+</mml:mo> <mml:mn>3</mml:mn> <mml:mrow><mml:mo>(</mml:mo> <mml:msub><mml:mi>m</mml:mi> <mml:mtext>PU</mml:mtext></mml:msub> <mml:mo>+</mml:mo> <mml:msub><mml:mi>m</mml:mi> <mml:mtext>UU</mml:mtext></mml:msub> <mml:mo>+</mml:mo> <mml:msub><mml:mi>m</mml:mi> <mml:mtext>AU</mml:mtext></mml:msub> <mml:mo>)</mml:mo></mml:mrow> <mml:mo>+</mml:mo> <mml:mrow><mml:mo>(</mml:mo> <mml:msub><mml:mi>m</mml:mi> <mml:mtext>PA</mml:mtext></mml:msub> <mml:mo>+</mml:mo> <mml:msub><mml:mi>m</mml:mi> <mml:mtext>UA</mml:mtext></mml:msub> <mml:mo>+</mml:mo> <mml:msub><mml:mi>m</mml:mi> <mml:mtext>AA</mml:mtext></mml:msub> <mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:mfrac> <mml:mo>,</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math></alternatives> <label>(1)</label></disp-formula>
where <xref ref-type="table" rid="pdig.0000324.t003">Table 3</xref> defines a three-by-three confusion matrix <italic>M</italic> = [<italic>m</italic><sub><italic>ij</italic></sub>] for the murmur present, murmur unknown, and murmur absent classes.</p>
<table-wrap id="pdig.0000324.t003" position="float">
<object-id pub-id-type="doi">10.1371/journal.pdig.0000324.t003</object-id>
<label>Table 3</label>
<caption>
<title>Confusion matrix <italic>M</italic> for murmur detection with three classes: Murmur present, murmur unknown, and murmur absent.</title>
<p>The columns are the ground truth labels from the human annotator, and the rows are the model outputs. The entries of the confusion matrix provide the number of patients with each model output for each ground truth class.</p>
</caption>
<alternatives>
<graphic id="pdig.0000324.t003g" mimetype="image" position="float" xlink:href="info:doi/10.1371/journal.pdig.0000324.t003" xlink:type="simple"/>
<table border="0" frame="box" rules="all">
<colgroup>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
</colgroup>
<thead>
<tr>
<th align="center" colspan="2" rowspan="2"/>
<th align="center" colspan="3">Murmur Expert</th>
</tr>
<tr>
<th align="center">Present</th>
<th align="center">Unknown</th>
<th align="center">Absent</th>
</tr>
</thead>
<tbody>
<tr>
<td align="left" rowspan="3">Murmur Classifier</td>
<td align="center">Present</td>
<td align="center"><italic>m</italic><sub>PP</sub></td>
<td align="center"><italic>m</italic><sub>PU</sub></td>
<td align="center"><italic>m</italic><sub>PA</sub></td>
</tr>
<tr>
<td align="center">Unknown</td>
<td align="center"><italic>m</italic><sub>UP</sub></td>
<td align="center"><italic>m</italic><sub>UU</sub></td>
<td align="center"><italic>m</italic><sub>UA</sub></td>
</tr>
<tr>
<td align="center">Absent</td>
<td align="center"><italic>m</italic><sub>AP</sub></td>
<td align="center"><italic>m</italic><sub>AU</sub></td>
<td align="center"><italic>m</italic><sub>AA</sub></td>
</tr>
</tbody>
</table>
</alternatives>
</table-wrap>
<p>These coefficients were chosen to reflect the trade-off between false positives and false negatives, where clinicians may tolerate multiple false alarms to avoid a single missed diagnosis. In (<xref ref-type="disp-formula" rid="pdig.0000324.e001">1</xref>), murmur present cases have five times the weight of murmur absent cases, and the murmur unknown cases have three times the weight of murmur absent cases, to reflect a tolerance of five false alarms for every one false positive.</p>
<p>Like the traditional accuracy metric, this metric only rewarded algorithms for correctly labeling patients, but it provided the highest reward for correctly classifying patients with murmurs and the lowest reward for correctly classifying patients without murmurs. It provided an intermediate reward for correctly classifying patients of unknown murmur status to reflect the difficulty and importance of indicating when the recordings are not adequate for diagnosis.</p>
<p>We used (<xref ref-type="disp-formula" rid="pdig.0000324.e001">1</xref>) to rank the Challenge algorithms for the murmur detection task. The team with the highest value of (<xref ref-type="disp-formula" rid="pdig.0000324.e001">1</xref>) won this task.</p>
</sec>
<sec id="sec009">
<title>Cost-based evaluation metric</title>
<p>We introduced a cost-based evaluation metric to evaluate the clinical outcome algorithms for abnormal or normal heart function. This metric considered the ability of the algorithms to reduce the costs associated with diagnosing and treating patients, primarily by having experts screen fewer patients with normal cardiac function. We again emphasize that healthcare costs are an imperfect surrogate for health needs [<xref ref-type="bibr" rid="pdig.0000324.ref013">13</xref>, <xref ref-type="bibr" rid="pdig.0000324.ref014">14</xref>]. However, costs remain a practical consideration for resource-constrained environments.</p>
<p>For each patient encounter, the algorithm interpreted the PCG recordings and demographic data for the encounter. Under this paradigm, if an algorithm inferred abnormal cardiac function, then it would refer the patient to a human expert for a confirmatory diagnosis. If the expert confirmed the diagnosis, then the patient would receive treatment, and if the expert did not confirm the diagnosis, then the patient would not receive treatment. Alternatively, if the algorithm inferred normal cardiac function, then it would not refer the patient to an expert, and the patient would not receive treatment, even if the patient had abnormal cardiac function that would have been detected by a human expert.</p>
<p>We associated each of these steps with a cost: the cost of algorithmic pre-screening, the cost of expert screening, the cost of timely treatment, and the cost of delayed or missed treatment.</p>
<p>For simplicity, we assumed that algorithmic pre-screening had a relatively small cost that depended linearly on the number of algorithmic pre-screenings. We also assumed that both timely treatments and delayed or missed treatments had relatively large costs that, on average, depended linearly on the number of patients with delayed or missed treatment. Given our focus on the ability of algorithmic pre-screening to reduce human screening of patients with normal cardiac function, we assumed that expert screening had an intermediate cost that depended non-linearly on the number of screenings as well on as the infrastructure and capacity of the healthcare system. Of course, treatment costs are also non-linear in the number of treated patients for similar reasons, but non-urgent treatments can arguably utilize the capacity of the broader healthcare system. Screening far below the capacity of the healthcare system was inefficient and incurred a low total cost but high average cost. Screening above the capacity of the healthcare system was also inefficient and incurred both a high average cost and a high total cost.</p>
<p>Therefore, we introduced the following cost-based evaluation metric for identifying clinical outcomes. We defined the total cost of diagnosis and treatment with algorithmic pre-screening as
<disp-formula id="pdig.0000324.e002"><alternatives><graphic id="pdig.0000324.e002g" mimetype="image" position="anchor" xlink:href="info:doi/10.1371/journal.pdig.0000324.e002" xlink:type="simple"/><mml:math display="block" id="M2"><mml:mtable displaystyle="true"><mml:mtr><mml:mtd columnalign="right"><mml:mtable displaystyle="true"><mml:mtr><mml:mtd columnalign="right"><mml:mrow><mml:msubsup><mml:mi>c</mml:mi> <mml:mtext>outcome</mml:mtext> <mml:mtext>total</mml:mtext></mml:msubsup> <mml:mo>=</mml:mo></mml:mrow></mml:mtd> <mml:mtd columnalign="left"><mml:mrow><mml:mspace width="0.222222em"/><mml:msub><mml:mi>f</mml:mi> <mml:mtext>algorithm</mml:mtext></mml:msub> <mml:mrow><mml:mo>(</mml:mo> <mml:msub><mml:mi>n</mml:mi> <mml:mtext>patients</mml:mtext></mml:msub> <mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:mtd></mml:mtr> <mml:mtr><mml:mtd/><mml:mtd columnalign="left"><mml:mrow><mml:mo>+</mml:mo> <mml:msub><mml:mi>f</mml:mi> <mml:mtext>expert</mml:mtext></mml:msub> <mml:mrow><mml:mo>(</mml:mo> <mml:msub><mml:mi>n</mml:mi> <mml:mtext>TP</mml:mtext></mml:msub> <mml:mo>+</mml:mo> <mml:msub><mml:mi>n</mml:mi> <mml:mtext>FP</mml:mtext></mml:msub> <mml:mo>,</mml:mo> <mml:mspace width="0.222222em"/><mml:msub><mml:mi>n</mml:mi> <mml:mtext>patients</mml:mtext></mml:msub> <mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:mtd></mml:mtr> <mml:mtr><mml:mtd/><mml:mtd columnalign="left"><mml:mrow><mml:mo>+</mml:mo> <mml:msub><mml:mi>f</mml:mi> <mml:mtext>treatment</mml:mtext></mml:msub> <mml:mrow><mml:mo>(</mml:mo> <mml:msub><mml:mi>n</mml:mi> <mml:mtext>TP</mml:mtext></mml:msub> <mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:mtd></mml:mtr> <mml:mtr><mml:mtd/><mml:mtd columnalign="left"><mml:mrow><mml:mo>+</mml:mo> <mml:msub><mml:mi>f</mml:mi> <mml:mtext>error</mml:mtext></mml:msub> <mml:mrow><mml:mo>(</mml:mo> <mml:msub><mml:mi>n</mml:mi> <mml:mtext>FN</mml:mtext></mml:msub> <mml:mo>)</mml:mo></mml:mrow> <mml:mo>,</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:mtd></mml:mtr></mml:mtable></mml:math></alternatives> <label>(2)</label></disp-formula>
where <xref ref-type="table" rid="pdig.0000324.t004">Table 4</xref> defines a two-by-two confusion matrix <italic>N</italic> = [<italic>n</italic><sub><italic>ij</italic></sub>] for the classes for abnormal and normal cardiac function, <italic>n</italic><sub>patients</sub> = <italic>n</italic><sub>TP</sub> + <italic>n</italic><sub>FP</sub> + <italic>n</italic><sub>FN</sub> + <italic>n</italic><sub>TN</sub> is the total number of patient encounters, and <italic>f</italic><sub>algorithm</sub>, <italic>f</italic><sub>expert</sub>, <italic>f</italic><sub>treatment</sub>, <italic>f</italic><sub>error</sub> are defined below.</p>
<table-wrap id="pdig.0000324.t004" position="float">
<object-id pub-id-type="doi">10.1371/journal.pdig.0000324.t004</object-id>
<label>Table 4</label>
<caption>
<title>Confusion matrix <italic>N</italic> for clinical outcome detection with two classes: Clinical outcome abnormal and clinical outcome normal.</title>
<p>The columns are the ground truth labels from the human annotator, and the rows are the classifier outputs. The entries of the confusion matrix provide the number of patients with each classifier output for each ground truth class.</p>
</caption>
<alternatives>
<graphic id="pdig.0000324.t004g" mimetype="image" position="float" xlink:href="info:doi/10.1371/journal.pdig.0000324.t004" xlink:type="simple"/>
<table border="0" frame="box" rules="all">
<colgroup>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
</colgroup>
<thead>
<tr>
<th align="center" colspan="2" rowspan="2"/>
<th align="center" colspan="2">Clinical Outcome Expert</th>
</tr>
<tr>
<th align="center">Abnormal</th>
<th align="center">Normal</th>
</tr>
</thead>
<tbody>
<tr>
<td align="left" rowspan="2">Clinical Outcome Classifier</td>
<td align="center">Abnormal</td>
<td align="center"><italic>n</italic><sub>TP</sub></td>
<td align="center"><italic>n</italic><sub>FP</sub></td>
</tr>
<tr>
<td align="center">Normal</td>
<td align="center"><italic>n</italic><sub>FN</sub></td>
<td align="center"><italic>n</italic><sub>TN</sub></td>
</tr>
</tbody>
</table>
</alternatives>
</table-wrap>
<p>Again, for simplicity, we assumed that the costs for algorithmic pre-screening, timely treatments, and missed or late treatments were linear. We defined
<disp-formula id="pdig.0000324.e003"><alternatives><graphic id="pdig.0000324.e003g" mimetype="image" position="anchor" xlink:href="info:doi/10.1371/journal.pdig.0000324.e003" xlink:type="simple"/><mml:math display="block" id="M3"><mml:mtable displaystyle="true"><mml:mtr><mml:mtd columnalign="right"><mml:mrow><mml:msub><mml:mi>f</mml:mi> <mml:mtext>algorithm</mml:mtext></mml:msub> <mml:mrow><mml:mo>(</mml:mo> <mml:mi>s</mml:mi> <mml:mo>)</mml:mo></mml:mrow> <mml:mo>=</mml:mo> <mml:mn>10</mml:mn> <mml:mi>s</mml:mi></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math></alternatives> <label>(3)</label></disp-formula>
as the total cost of <italic>s</italic> pre-screenings by an algorithm,
<disp-formula id="pdig.0000324.e004"><alternatives><graphic id="pdig.0000324.e004g" mimetype="image" position="anchor" xlink:href="info:doi/10.1371/journal.pdig.0000324.e004" xlink:type="simple"/><mml:math display="block" id="M4"><mml:mtable displaystyle="true"><mml:mtr><mml:mtd columnalign="right"><mml:mrow><mml:msub><mml:mi>f</mml:mi> <mml:mtext>treatment</mml:mtext></mml:msub> <mml:mrow><mml:mo>(</mml:mo> <mml:mi>s</mml:mi> <mml:mo>)</mml:mo></mml:mrow> <mml:mo>=</mml:mo> <mml:mn>10000</mml:mn> <mml:mi>s</mml:mi></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math></alternatives> <label>(4)</label></disp-formula>
as the total cost of <italic>s</italic> treatments, and
<disp-formula id="pdig.0000324.e005"><alternatives><graphic id="pdig.0000324.e005g" mimetype="image" position="anchor" xlink:href="info:doi/10.1371/journal.pdig.0000324.e005" xlink:type="simple"/><mml:math display="block" id="M5"><mml:mtable displaystyle="true"><mml:mtr><mml:mtd columnalign="right"><mml:mrow><mml:msub><mml:mi>f</mml:mi> <mml:mtext>error</mml:mtext></mml:msub> <mml:mrow><mml:mo>(</mml:mo> <mml:mi>s</mml:mi> <mml:mo>)</mml:mo></mml:mrow> <mml:mo>=</mml:mo> <mml:mn>50000</mml:mn> <mml:mi>s</mml:mi></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math></alternatives> <label>(5)</label></disp-formula>
as the total cost of <italic>s</italic> missed or delayed treatments.</p>
<p>Conversely, to better capture the potential benefits of algorithmic pre-screening, we assumed that the cost for expert screening was non-linear. We defined
<disp-formula id="pdig.0000324.e006"><alternatives><graphic id="pdig.0000324.e006g" mimetype="image" position="anchor" xlink:href="info:doi/10.1371/journal.pdig.0000324.e006" xlink:type="simple"/><mml:math display="block" id="M6"><mml:mtable displaystyle="true"><mml:mtr><mml:mtd columnalign="right"><mml:mrow><mml:msub><mml:mi>f</mml:mi> <mml:mtext>expert</mml:mtext></mml:msub> <mml:mrow><mml:mo>(</mml:mo> <mml:mi>s</mml:mi> <mml:mo>,</mml:mo> <mml:mi>t</mml:mi> <mml:mo>)</mml:mo></mml:mrow> <mml:mo>=</mml:mo> <mml:mo>(</mml:mo> <mml:mn>25</mml:mn> <mml:mo>+</mml:mo> <mml:mn>397</mml:mn> <mml:mfrac><mml:mi>s</mml:mi> <mml:mi>t</mml:mi></mml:mfrac> <mml:mo>-</mml:mo> <mml:mn>1718</mml:mn> <mml:mfrac><mml:msup><mml:mi>s</mml:mi> <mml:mn>2</mml:mn></mml:msup> <mml:msup><mml:mi>t</mml:mi> <mml:mn>2</mml:mn></mml:msup></mml:mfrac> <mml:mo>+</mml:mo> <mml:mn>11296</mml:mn> <mml:mfrac><mml:msup><mml:mi>s</mml:mi> <mml:mn>4</mml:mn></mml:msup> <mml:msup><mml:mi>t</mml:mi> <mml:mn>4</mml:mn></mml:msup></mml:mfrac> <mml:mo>)</mml:mo> <mml:mi>t</mml:mi></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math></alternatives> <label>(6)</label></disp-formula>
as the total cost of <italic>s</italic> screenings by a human expert out of a population of <italic>t</italic> patient encounters so that
<disp-formula id="pdig.0000324.e007"><alternatives><graphic id="pdig.0000324.e007g" mimetype="image" position="anchor" xlink:href="info:doi/10.1371/journal.pdig.0000324.e007" xlink:type="simple"/><mml:math display="block" id="M7"><mml:mtable displaystyle="true"><mml:mtr><mml:mtd columnalign="right"><mml:mrow><mml:msub><mml:mi>g</mml:mi> <mml:mtext>expert</mml:mtext></mml:msub> <mml:mrow><mml:mo>(</mml:mo> <mml:mi>x</mml:mi> <mml:mo>)</mml:mo></mml:mrow> <mml:mo>=</mml:mo> <mml:mn>25</mml:mn> <mml:mo>+</mml:mo> <mml:mn>397</mml:mn> <mml:mi>x</mml:mi> <mml:mo>-</mml:mo> <mml:mn>1718</mml:mn> <mml:msup><mml:mi>x</mml:mi> <mml:mn>2</mml:mn></mml:msup> <mml:mo>+</mml:mo> <mml:mn>11296</mml:mn> <mml:msup><mml:mi>x</mml:mi> <mml:mn>4</mml:mn></mml:msup></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math></alternatives> <label>(7)</label></disp-formula>
was the mean cost of screening a fraction <italic>x</italic> = <italic>s</italic>/<italic>t</italic> of the patient cohort by an expert; this reparameterization of (<xref ref-type="disp-formula" rid="pdig.0000324.e006">6</xref>) allowed us to compare algorithms on datasets with different numbers of patients. We designed (<xref ref-type="disp-formula" rid="pdig.0000324.e006">6</xref>) and (<xref ref-type="disp-formula" rid="pdig.0000324.e007">7</xref>) so that the mean cost of expert screening was lowest when only 25% of the patient cohort received an expert screening to reflect the optimal capacity of the screening system. Figs <xref ref-type="fig" rid="pdig.0000324.g003">3</xref> and <xref ref-type="fig" rid="pdig.0000324.g004">4</xref> show these costs across different patient cohort and screening sizes, and <xref ref-type="supplementary-material" rid="pdig.0000324.s002">S2 Appendix</xref> provides a fuller derivation of (<xref ref-type="disp-formula" rid="pdig.0000324.e006">6</xref>) and (<xref ref-type="disp-formula" rid="pdig.0000324.e007">7</xref>).</p>
<fig id="pdig.0000324.g003" position="float">
<object-id pub-id-type="doi">10.1371/journal.pdig.0000324.g003</object-id>
<label>Fig 3</label>
<caption>
<title>The expert screening cost <italic>g</italic><sub>expert</sub>(<italic>x</italic>) defined for the Challenge: Mean cost for screening a fraction <italic>x</italic> of a patient cohort for cardiac abnormalities.</title>
<p>Mean <bold>per-patient</bold> expert screening cost <italic>g</italic><sub>expert</sub>(<italic>x</italic>), i.e., the total expert screening cost for a patient cohort divided by the number of patients in the cohort.</p>
</caption>
<graphic mimetype="image" position="float" xlink:href="info:doi/10.1371/journal.pdig.0000324.g003" xlink:type="simple"/>
</fig>
<fig id="pdig.0000324.g004" position="float">
<object-id pub-id-type="doi">10.1371/journal.pdig.0000324.g004</object-id>
<label>Fig 4</label>
<caption>
<title>The expert screening cost <italic>g</italic><sub>expert</sub>(<italic>x</italic>) defined for the Challenge: Mean cost for screening a fraction <italic>x</italic> of a patient cohort for cardiac abnormalities.</title>
<p>Mean <bold>per-screening</bold> expert screening cost <italic>g</italic><sub>expert</sub>(<italic>x</italic>)/<italic>x</italic>, i.e., the total expert screening cost for a patient cohort divided by the number of patients in the cohort and the fraction of expert screenings for the cohort.</p>
</caption>
<graphic mimetype="image" position="float" xlink:href="info:doi/10.1371/journal.pdig.0000324.g004" xlink:type="simple"/>
</fig>
<p>To more easily compare costs across databases with different numbers of patients, e.g., the training, validation, and test sets, we defined the mean per-patient cost of diagnosis and treatment with algorithmic pre-screening as
<disp-formula id="pdig.0000324.e008"><alternatives><graphic id="pdig.0000324.e008g" mimetype="image" position="anchor" xlink:href="info:doi/10.1371/journal.pdig.0000324.e008" xlink:type="simple"/><mml:math display="block" id="M8"><mml:mtable displaystyle="true"><mml:mtr><mml:mtd columnalign="right"><mml:mrow><mml:msub><mml:mi>c</mml:mi> <mml:mtext>outcome</mml:mtext></mml:msub> <mml:mo>=</mml:mo> <mml:mfrac><mml:msubsup><mml:mi>c</mml:mi> <mml:mtext>outcome</mml:mtext> <mml:mtext>total</mml:mtext></mml:msubsup> <mml:msub><mml:mi>n</mml:mi> <mml:mtext>patients</mml:mtext></mml:msub></mml:mfrac> <mml:mo>.</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math></alternatives> <label>(8)</label></disp-formula></p>
<p>We used (<xref ref-type="disp-formula" rid="pdig.0000324.e008">8</xref>) to rank the Challenge algorithms for the murmur detection task. The team with the lowest value of (<xref ref-type="disp-formula" rid="pdig.0000324.e008">8</xref>) won this task.</p>
</sec>
</sec>
</sec>
<sec id="sec010">
<title>Challenge results</title>
<sec id="sec011">
<title>Challenge entries</title>
<p>We received 779 entries from 87 teams throughout the course of the 2022 PhysioNet Challenge, resulting in 77 submitted CinC abstracts, 62 accepted CinC abstracts, 43 published CinC proceedings papers, and 53 final entries with working code from 53 different teams.</p>
<p>These entries represent a diversity of approaches to the Challenge. A total of 81 teams submitted 293 entries during the unofficial phase of the Challenge, and a total of 63 teams submitted 486 entries during the official phase of the Challenge. Of the 779 total entries, we received 652 entries from 75 teams that were implemented in Python, and 127 entries from 17 teams that were implemented in MATLAB. We received 519 entries from 60 teams that requested a graphics processing unit (GPU) for their entries, and 260 entries from 49 teams requested only a central processing unit (CPU), i.e., no GPU. In total, we received 473 successful entries that we were able to train on the public training set and evaluate on the hidden validation set, and 306 entries that we were unable to train on the training set and/or evaluate on the validation set due to various errors in the submitted code.</p>
<p>We allowed each team with a successful entry during the official phase to select a single entry for evaluation on the test set. A total of 58 teams had a successful entry during the official phase that we were able to train on the training set and evaluate on the validation set. Most of these teams chose their best-scoring entry from the official phase, but some teams selected their most recent entry or another entry, often because they thought that another entry with a lower score on the validation set would better generalize to the test set.</p>
<p>In some cases, a team’s best-scoring entry for the murmur detection task was different from the team’s best-scoring entry for the clinical outcome identification task because of the differences between the tasks and the evaluation metrics for grading them; in these cases, we chose a different entry for each task. However, since the teams could implement different approaches for each task, and since they could have submitted these different approaches as part of the same entry, we did not distinguish between teams and entries that submitted their best scoring entries in the same code submission or in different code submissions. We will share the best scoring entries for both whether they were part of the same or different code submissions.</p>
<p>Of the 58 teams with a successful entry during the official phase, 53 teams had code that we were able to score on the training, validation, and test sets for both the murmur detection and clinical outcome identification tasks, resulting in 53 working entries to the Challenge.</p>
<p>
<xref ref-type="fig" rid="pdig.0000324.g005">Fig 5</xref> compares the performance of the working Challenge entries on the murmur detection and clinical outcome identification tasks. Figs <xref ref-type="fig" rid="pdig.0000324.g006">6</xref> and <xref ref-type="fig" rid="pdig.0000324.g007">7</xref> compare the Challenge weighted accuracy and cost metrics, respectively, with traditional scoring metrics, including area under the receiver operating characteristic curve (AUROC), the area under the precision-recall curve (AUPRC), the macro-averaged <italic>F</italic>-measure, and the traditional accuracy metric.</p>
<fig id="pdig.0000324.g005" position="float">
<object-id pub-id-type="doi">10.1371/journal.pdig.0000324.g005</object-id>
<label>Fig 5</label>
<caption>
<title>Weighted accuracy metric (<xref ref-type="disp-formula" rid="pdig.0000324.e001">1</xref>) for the murmur detection task (<italic>x</italic>-axis) and the cost metric (<xref ref-type="disp-formula" rid="pdig.0000324.e008">8</xref>) scores for the clinical outcome identification task (<italic>y</italic>-axis) of the final Challenge entries on the hidden test set.</title>
<p>Each point shows an entry, and the shading of each point shows whether the entry was an official entry (dark red points) that satisfied all of the Challenge rules or an unofficial entry (light red points) that did not. The Spearman correlation coefficient <italic>ρ</italic> between the scores is given in the plot, and a line of best fit (gray dotted line) is given by a robust linear regression.</p>
</caption>
<graphic mimetype="image" position="float" xlink:href="info:doi/10.1371/journal.pdig.0000324.g005" xlink:type="simple"/>
</fig>
<fig id="pdig.0000324.g006" position="float">
<object-id pub-id-type="doi">10.1371/journal.pdig.0000324.g006</object-id>
<label>Fig 6</label>
<caption>
<title>Traditional evaluation metric (<italic>x</italic>-axis) and weighted accuracy metric (<italic>y</italic>-axis) scores for the final Challenge entries with the murmur detection task on the hidden test set.</title>
<p>AUROC is the area under the receiver operating character curve, AUPRC is the area under the precision-recall curve, <italic>F</italic>-measure is the macro-averaged <italic>F</italic>-measure, and accuracy is the traditional accuracy metric. Each point shows an entry, and the shading of each point shows whether the entry was an official entry (dark red points) that satisfied all of the Challenge rules or an unofficial entry (light red points) that did not. The Spearman correlation coefficients <italic>ρ</italic> between the metrics are given in the individual plots, and a line of best fit (gray dotted line) is given by a robust linear regression.</p>
</caption>
<graphic mimetype="image" position="float" xlink:href="info:doi/10.1371/journal.pdig.0000324.g006" xlink:type="simple"/>
</fig>
<fig id="pdig.0000324.g007" position="float">
<object-id pub-id-type="doi">10.1371/journal.pdig.0000324.g007</object-id>
<label>Fig 7</label>
<caption>
<title>Traditional evaluation metric (<italic>x</italic>-axis) and cost metric (<italic>y</italic>-axis) scores for the final Challenge entries with the clinical outcome identification task on the hidden test set.</title>
<p>AUROC is the area under the receiver operating character curve, AUPRC the is area under the precision-recall curve, <italic>F</italic>-measure is the traditional <italic>F</italic>-measure, and accuracy is the traditional accuracy metric. Each point shows an entry, and the shading of each point shows whether the entry was an official entry (dark red points) that satisfied all of the Challenge rules or an unofficial entry (light red points) that did not. The Spearman correlation coefficients <italic>ρ</italic> between the metrics are given in the individual plots, and a line of best fit (gray dotted line) is given by a robust linear regression.</p>
</caption>
<graphic mimetype="image" position="float" xlink:href="info:doi/10.1371/journal.pdig.0000324.g007" xlink:type="simple"/>
</fig>
<p>For the official rankings, we required the teams to have successful unofficial and official phase entries, to have an accepted CinC abstract, to publicly share their CinC proceedings paper preprint by the CinC preprint submission deadline, to have an accepted final CinC proceedings paper by the CinC final paper submission deadline, and to license their code under an open-source or similarly permissive license. We also allowed teams without a successful unofficial phase entry and/or accepted CinC abstract who had a successful, high-scoring official phase entry to submit a CinC abstract after the original abstract submission deadline as a “wild card” team. The wild card abstract and proceedings paper were otherwise subject to the same review process as for the other participants.</p>
<p>We imposed these requirements to support the dissemination of research into the research community. Of the 53 working entries, a total of 40 teams were officially ranked. Tables <xref ref-type="table" rid="pdig.0000324.t005">5</xref> and <xref ref-type="table" rid="pdig.0000324.t006">6</xref> summarize the traditional and Challenge evaluation metrics for the officially ranked entries for the murmur detection and clinical outcome identification tasks, respectively, on the hidden test set.</p>
<p>To assess the robustness of the algorithms, we tested whether they actually learned from the training set; algorithms that cannot learn from new data have more limited use. To do so, we trained them on a subset of the training set with permuted labels and ran the retrained models on the validation and test sets with the original labels; we did not change any of the publicly available training data or labels but simply the size of the training set and the relationship between the data and the labels in the training set. Algorithms that truly learned from the training set performed much worse when retrained on the modified training set, but algorithms that did not learn from the training set performed the same or better on the modified training set. Only 35 of the 53 working entries were robust enough for us to complete this process. The remaining 18 working entries either crashed or achieved the same or a better score when retrained on the modified training set, suggesting that they were insensitive to the training set labels. While we encouraged teams to submit robust code, we did not share the details about how we would assess the robustness of their algorithms to encourage them to make their code robust in as many ways as possible. Therefore, since we did not provide advance notice of the exact requirements for robustness, we did not disqualify teams whose algorithms failed this test.</p>
</sec>
<sec id="sec012">
<title>Voting algorithms</title>
<p>While some entries had better overall performance than others, an entry with a lower overall performance may perform better on certain patient subgroups than another entry with a stronger overall performance. Therefore, an algorithm that can learn the different strengths of different algorithms can improve on the overall performance of the individual entries. To test this concept, we developed multiple voting algorithms to attempt to leverage the diversity of Challenge entries.</p>
<p>For the voting algorithms, we considered the discrete model outputs (see Tables <xref ref-type="table" rid="pdig.0000324.t003">3</xref> and <xref ref-type="table" rid="pdig.0000324.t004">4</xref>) from the 39 algorithms from teams that were officially ranked for both the murmur detection and clinical outcome tasks (see Tables <xref ref-type="table" rid="pdig.0000324.t005">5</xref> and <xref ref-type="table" rid="pdig.0000324.t006">6</xref>). We considered these tasks separately, and we used the relevant Challenge scoring metric to evaluate the voting algorithms for each task: the weighted accuracy metric (<xref ref-type="disp-formula" rid="pdig.0000324.e001">1</xref>) for the murmur detection task and the cost metric (<xref ref-type="disp-formula" rid="pdig.0000324.e008">8</xref>) for the clinical outcome identification task. We used the common gradient-boosting trees (GBT) and random forests (RF) models for the voting algorithms [<xref ref-type="bibr" rid="pdig.0000324.ref015">15</xref>, <xref ref-type="bibr" rid="pdig.0000324.ref016">16</xref>, <xref ref-type="bibr" rid="pdig.0000324.ref017">17</xref>].</p>
<p>We developed and evaluated the GBT and RF voting algorithms using the following procedure. First, we trained the GBT and RF voting algorithms on the <italic>k</italic> = 1, 2, …, 39 best-performing teams on the training set. Next, we chose <italic>k</italic> to be the value that achieved the best performance on the validation set; this step identified <italic>k</italic> = 14 for the GBT models and <italic>k</italic> = 2 for the RF models on the murmur detection task and <italic>k</italic> = 14 for the GBT models and <italic>k</italic> = 4 for the RF models on the clinical outcome identification task. Finally, we evaluated the resulting voting algorithms on the test set.</p>
<p>The GBT and RF voting algorithms performed slightly better than the highest-ranked entry for the murmur detection task (weighted accuracy metric of 0.790 and 0.789, respectively vs. 0.780; see <xref ref-type="table" rid="pdig.0000324.t005">Table 5</xref>) and performed slightly worse than the highest-ranked entries for the clinical outcome identification task (cost of 11357 and 11687, respectively vs. 11144; see <xref ref-type="table" rid="pdig.0000324.t006">Table 6</xref>). In each case, the voting algorithms had comparable performance to the highest ranked individual algorithms, but they did not significantly outperform them in either task by any of the traditional or novel scoring metrics that we considered.</p>
<table-wrap id="pdig.0000324.t005" position="float">
<object-id pub-id-type="doi">10.1371/journal.pdig.0000324.t005</object-id>
<label>Table 5</label>
<caption>
<title>Scores of the officially ranked methods on the test set for the murmur detection task.</title>
<p>AUROC is the area under the receiver operating characteristic curve, AUPRC is the area under the precision-recall curve, <italic>F</italic>-measure is the macro-averaged <italic>F</italic>-measure, accuracy is the traditional accuracy metric, and weighted accuracy is the weighted accuracy metric (<xref ref-type="disp-formula" rid="pdig.0000324.e001">1</xref>), i.e., the metric used to rank algorithms for the murmur detection task.</p>
</caption>
<alternatives>
<graphic id="pdig.0000324.t005g" mimetype="image" position="float" xlink:href="info:doi/10.1371/journal.pdig.0000324.t005" xlink:type="simple"/>
<table border="0" frame="box" rules="all">
<colgroup>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
</colgroup>
<thead>
<tr>
<th align="right">Rank</th>
<th align="left">Team</th>
<th align="right">AUROC</th>
<th align="right">AUPRC</th>
<th align="right"><italic>F</italic>-measure</th>
<th align="right">Accuracy</th>
<th align="right">Weighted Accuracy</th>
</tr>
</thead>
<tbody>
<tr>
<td align="right">*</td>
<td align="left"><italic>Voting—GBT</italic></td>
<td align="char" char="."><italic>0.677</italic></td>
<td align="char" char="."><italic>0.465</italic></td>
<td align="char" char="."><italic>0.660</italic></td>
<td align="char" char="."><italic>0.845</italic></td>
<td align="char" char="."><italic>0.790</italic></td>
</tr>
<tr>
<td align="right">**</td>
<td align="left"><italic>Voting—RF</italic></td>
<td align="char" char="."><italic>0.775</italic></td>
<td align="char" char="."><italic>0.589</italic></td>
<td align="char" char="."><italic>0.650</italic></td>
<td align="char" char="."><italic>0.832</italic></td>
<td align="char" char="."><italic>0.789</italic></td>
</tr>
<tr>
<td align="right">1</td>
<td align="left">HearHeart [<xref ref-type="bibr" rid="pdig.0000324.ref019">19</xref>]</td>
<td align="char" char=".">0.884</td>
<td align="char" char=".">0.716</td>
<td align="char" char=".">0.619</td>
<td align="char" char=".">0.801</td>
<td align="char" char=".">0.780</td>
</tr>
<tr>
<td align="right">2</td>
<td align="left">CUED_Acoustics [<xref ref-type="bibr" rid="pdig.0000324.ref020">20</xref>]</td>
<td align="char" char=".">0.757</td>
<td align="char" char=".">0.528</td>
<td align="char" char=".">0.623</td>
<td align="char" char=".">0.763</td>
<td align="char" char=".">0.776</td>
</tr>
<tr>
<td align="right">2</td>
<td align="left">HearTech+ [<xref ref-type="bibr" rid="pdig.0000324.ref021">21</xref>]</td>
<td align="char" char=".">0.771</td>
<td align="char" char=".">0.561</td>
<td align="char" char=".">0.647</td>
<td align="char" char=".">0.822</td>
<td align="char" char=".">0.776</td>
</tr>
<tr>
<td align="right">4</td>
<td align="left">PathToMyHeart [<xref ref-type="bibr" rid="pdig.0000324.ref022">22</xref>]</td>
<td align="char" char=".">0.880</td>
<td align="char" char=".">0.684</td>
<td align="char" char=".">0.686</td>
<td align="char" char=".">0.778</td>
<td align="char" char=".">0.771</td>
</tr>
<tr>
<td align="right">5</td>
<td align="left">CAU_UMN [<xref ref-type="bibr" rid="pdig.0000324.ref023">23</xref>]</td>
<td align="char" char=".">0.763</td>
<td align="char" char=".">0.621</td>
<td align="char" char=".">0.521</td>
<td align="char" char=".">0.786</td>
<td align="char" char=".">0.767</td>
</tr>
<tr>
<td align="right">6</td>
<td align="left">Care4MyHeart [<xref ref-type="bibr" rid="pdig.0000324.ref024">24</xref>]</td>
<td align="char" char=".">0.891</td>
<td align="char" char=".">0.717</td>
<td align="char" char=".">0.695</td>
<td align="char" char=".">0.851</td>
<td align="char" char=".">0.757</td>
</tr>
<tr>
<td align="right">6</td>
<td align="left">SmartBeatIT [<xref ref-type="bibr" rid="pdig.0000324.ref025">25</xref>]</td>
<td align="char" char=".">0.873</td>
<td align="char" char=".">0.707</td>
<td align="char" char=".">0.633</td>
<td align="char" char=".">0.809</td>
<td align="char" char=".">0.757</td>
</tr>
<tr>
<td align="right">8</td>
<td align="left">CeZIS [<xref ref-type="bibr" rid="pdig.0000324.ref026">26</xref>]</td>
<td align="char" char=".">0.804</td>
<td align="char" char=".">0.587</td>
<td align="char" char=".">0.586</td>
<td align="char" char=".">0.761</td>
<td align="char" char=".">0.756</td>
</tr>
<tr>
<td align="right">9</td>
<td align="left">ISIBrno-AIMT [<xref ref-type="bibr" rid="pdig.0000324.ref027">27</xref>]</td>
<td align="char" char=".">0.897</td>
<td align="char" char=".">0.746</td>
<td align="char" char=".">0.555</td>
<td align="char" char=".">0.839</td>
<td align="char" char=".">0.755</td>
</tr>
<tr>
<td align="right">9</td>
<td align="left">Murmur Mia! [<xref ref-type="bibr" rid="pdig.0000324.ref028">28</xref>]</td>
<td align="char" char=".">0.867</td>
<td align="char" char=".">0.688</td>
<td align="char" char=".">0.592</td>
<td align="char" char=".">0.771</td>
<td align="char" char=".">0.755</td>
</tr>
<tr>
<td align="right">11</td>
<td align="left">PhysioDreamfly [<xref ref-type="bibr" rid="pdig.0000324.ref029">29</xref>]</td>
<td align="char" char=".">0.885</td>
<td align="char" char=".">0.723</td>
<td align="char" char=".">0.652</td>
<td align="char" char=".">0.799</td>
<td align="char" char=".">0.752</td>
</tr>
<tr>
<td align="right">12</td>
<td align="left">Heart2Beat [<xref ref-type="bibr" rid="pdig.0000324.ref030">30</xref>]</td>
<td align="char" char=".">0.849</td>
<td align="char" char=".">0.650</td>
<td align="char" char=".">0.579</td>
<td align="char" char=".">0.738</td>
<td align="char" char=".">0.751</td>
</tr>
<tr>
<td align="right">13</td>
<td align="left">Listen2YourHeart [<xref ref-type="bibr" rid="pdig.0000324.ref031">31</xref>]</td>
<td align="char" char=".">0.836</td>
<td align="char" char=".">0.656</td>
<td align="char" char=".">0.597</td>
<td align="char" char=".">0.706</td>
<td align="char" char=".">0.737</td>
</tr>
<tr>
<td align="right">14</td>
<td align="left">Revenger [<xref ref-type="bibr" rid="pdig.0000324.ref032">32</xref>]</td>
<td align="char" char=".">0.776</td>
<td align="char" char=".">0.611</td>
<td align="char" char=".">0.559</td>
<td align="char" char=".">0.843</td>
<td align="char" char=".">0.736</td>
</tr>
<tr>
<td align="right">15</td>
<td align="left">matLisboa [<xref ref-type="bibr" rid="pdig.0000324.ref033">33</xref>]</td>
<td align="char" char=".">0.269</td>
<td align="char" char=".">0.248</td>
<td align="char" char=".">0.610</td>
<td align="char" char=".">0.807</td>
<td align="char" char=".">0.735</td>
</tr>
<tr>
<td align="right">15</td>
<td align="left">uke-cardio [<xref ref-type="bibr" rid="pdig.0000324.ref034">34</xref>]</td>
<td align="char" char=".">0.890</td>
<td align="char" char=".">0.735</td>
<td align="char" char=".">0.597</td>
<td align="char" char=".">0.790</td>
<td align="char" char=".">0.735</td>
</tr>
<tr>
<td align="right">17</td>
<td align="left">One_Heart_Health [<xref ref-type="bibr" rid="pdig.0000324.ref035">35</xref>]</td>
<td align="char" char=".">0.756</td>
<td align="char" char=".">0.597</td>
<td align="char" char=".">0.530</td>
<td align="char" char=".">0.820</td>
<td align="char" char=".">0.729</td>
</tr>
<tr>
<td align="right">18</td>
<td align="left">MetaHeart [<xref ref-type="bibr" rid="pdig.0000324.ref036">36</xref>]</td>
<td align="char" char=".">0.868</td>
<td align="char" char=".">0.691</td>
<td align="char" char=".">0.548</td>
<td align="char" char=".">0.834</td>
<td align="char" char=".">0.723</td>
</tr>
<tr>
<td align="right">19</td>
<td align="left">Team_IIITH [<xref ref-type="bibr" rid="pdig.0000324.ref037">37</xref>]</td>
<td align="char" char=".">0.725</td>
<td align="char" char=".">0.584</td>
<td align="char" char=".">0.536</td>
<td align="char" char=".">0.813</td>
<td align="char" char=".">0.708</td>
</tr>
<tr>
<td align="right">20</td>
<td align="left">prna [<xref ref-type="bibr" rid="pdig.0000324.ref038">38</xref>]</td>
<td align="char" char=".">0.723</td>
<td align="char" char=".">0.579</td>
<td align="char" char=".">0.489</td>
<td align="char" char=".">0.759</td>
<td align="char" char=".">0.694</td>
</tr>
<tr>
<td align="right">21</td>
<td align="left">HCCL [<xref ref-type="bibr" rid="pdig.0000324.ref039">39</xref>]</td>
<td align="char" char=".">0.717</td>
<td align="char" char=".">0.569</td>
<td align="char" char=".">0.571</td>
<td align="char" char=".">0.769</td>
<td align="char" char=".">0.690</td>
</tr>
<tr>
<td align="right">22</td>
<td align="left">amc-sh [<xref ref-type="bibr" rid="pdig.0000324.ref040">40</xref>]</td>
<td align="char" char=".">0.814</td>
<td align="char" char=".">0.658</td>
<td align="char" char=".">0.595</td>
<td align="char" char=".">0.803</td>
<td align="char" char=".">0.688</td>
</tr>
<tr>
<td align="right">23</td>
<td align="left">JUST_IT_Academy1 [<xref ref-type="bibr" rid="pdig.0000324.ref041">41</xref>]</td>
<td align="char" char=".">0.797</td>
<td align="char" char=".">0.610</td>
<td align="char" char=".">0.572</td>
<td align="char" char=".">0.757</td>
<td align="char" char=".">0.671</td>
</tr>
<tr>
<td align="right">23</td>
<td align="left">LSMU [<xref ref-type="bibr" rid="pdig.0000324.ref042">42</xref>]</td>
<td align="char" char=".">0.741</td>
<td align="char" char=".">0.584</td>
<td align="char" char=".">0.523</td>
<td align="char" char=".">0.824</td>
<td align="char" char=".">0.671</td>
</tr>
<tr>
<td align="right">25</td>
<td align="left">listNto_urHeart [<xref ref-type="bibr" rid="pdig.0000324.ref043">43</xref>]</td>
<td align="char" char=".">0.819</td>
<td align="char" char=".">0.627</td>
<td align="char" char=".">0.565</td>
<td align="char" char=".">0.780</td>
<td align="char" char=".">0.668</td>
</tr>
<tr>
<td align="right">26</td>
<td align="left">USST_Med [<xref ref-type="bibr" rid="pdig.0000324.ref044">44</xref>]</td>
<td align="char" char=".">0.779</td>
<td align="char" char=".">0.593</td>
<td align="char" char=".">0.524</td>
<td align="char" char=".">0.803</td>
<td align="char" char=".">0.642</td>
</tr>
<tr>
<td align="right">27</td>
<td align="left">PCGPAW [<xref ref-type="bibr" rid="pdig.0000324.ref045">45</xref>]</td>
<td align="char" char=".">0.890</td>
<td align="char" char=".">0.721</td>
<td align="char" char=".">0.522</td>
<td align="char" char=".">0.824</td>
<td align="char" char=".">0.637</td>
</tr>
<tr>
<td align="right">28</td>
<td align="left">Melbourne_Kangas [<xref ref-type="bibr" rid="pdig.0000324.ref046">46</xref>]</td>
<td align="char" char=".">0.789</td>
<td align="char" char=".">0.599</td>
<td align="char" char=".">0.499</td>
<td align="char" char=".">0.725</td>
<td align="char" char=".">0.632</td>
</tr>
<tr>
<td align="right">29</td>
<td align="left">SeaCrying [<xref ref-type="bibr" rid="pdig.0000324.ref047">47</xref>]</td>
<td align="char" char=".">0.798</td>
<td align="char" char=".">0.612</td>
<td align="char" char=".">0.461</td>
<td align="char" char=".">0.447</td>
<td align="char" char=".">0.601</td>
</tr>
<tr>
<td align="right">30</td>
<td align="left">Simulab [<xref ref-type="bibr" rid="pdig.0000324.ref048">48</xref>]</td>
<td align="char" char=".">0.711</td>
<td align="char" char=".">0.530</td>
<td align="char" char=".">0.398</td>
<td align="char" char=".">0.497</td>
<td align="char" char=".">0.593</td>
</tr>
<tr>
<td align="right">31</td>
<td align="left">MainLab [<xref ref-type="bibr" rid="pdig.0000324.ref049">49</xref>]</td>
<td align="char" char=".">0.754</td>
<td align="char" char=".">0.537</td>
<td align="char" char=".">0.557</td>
<td align="char" char=".">0.734</td>
<td align="char" char=".">0.583</td>
</tr>
<tr>
<td align="right">32</td>
<td align="left">Leicester Fox [<xref ref-type="bibr" rid="pdig.0000324.ref050">50</xref>]</td>
<td align="char" char=".">0.764</td>
<td align="char" char=".">0.608</td>
<td align="char" char=".">0.449</td>
<td align="char" char=".">0.782</td>
<td align="char" char=".">0.536</td>
</tr>
<tr>
<td align="right">33</td>
<td align="left">Eagles [<xref ref-type="bibr" rid="pdig.0000324.ref051">51</xref>]</td>
<td align="char" char=".">0.357</td>
<td align="char" char=".">0.276</td>
<td align="char" char=".">0.115</td>
<td align="char" char=".">0.208</td>
<td align="char" char=".">0.525</td>
</tr>
<tr>
<td align="right">33</td>
<td align="left">fly_h [<xref ref-type="bibr" rid="pdig.0000324.ref052">52</xref>]</td>
<td align="char" char=".">0.614</td>
<td align="char" char=".">0.481</td>
<td align="char" char=".">0.444</td>
<td align="char" char=".">0.778</td>
<td align="char" char=".">0.525</td>
</tr>
<tr>
<td align="right">33</td>
<td align="left">lubdub [<xref ref-type="bibr" rid="pdig.0000324.ref053">53</xref>]</td>
<td align="char" char=".">0.500</td>
<td align="char" char=".">0.333</td>
<td align="char" char=".">0.115</td>
<td align="char" char=".">0.208</td>
<td align="char" char=".">0.525</td>
</tr>
<tr>
<td align="right">36</td>
<td align="left">AKSJ_97BSc [<xref ref-type="bibr" rid="pdig.0000324.ref054">54</xref>]</td>
<td align="char" char=".">0.655</td>
<td align="char" char=".">0.425</td>
<td align="char" char=".">0.425</td>
<td align="char" char=".">0.491</td>
<td align="char" char=".">0.494</td>
</tr>
<tr>
<td align="right">37</td>
<td align="left">UKJ_FSU [<xref ref-type="bibr" rid="pdig.0000324.ref055">55</xref>]</td>
<td align="char" char=".">0.576</td>
<td align="char" char=".">0.406</td>
<td align="char" char=".">0.379</td>
<td align="char" char=".">0.730</td>
<td align="char" char=".">0.458</td>
</tr>
<tr>
<td align="right">38</td>
<td align="left">BrownBAI [<xref ref-type="bibr" rid="pdig.0000324.ref056">56</xref>]</td>
<td align="char" char=".">0.571</td>
<td align="char" char=".">0.367</td>
<td align="char" char=".">0.361</td>
<td align="char" char=".">0.526</td>
<td align="char" char=".">0.406</td>
</tr>
<tr>
<td align="right">39</td>
<td align="left">Bear_FH [<xref ref-type="bibr" rid="pdig.0000324.ref057">57</xref>]</td>
<td align="char" char=".">0.688</td>
<td align="char" char=".">0.488</td>
<td align="char" char=".">0.328</td>
<td align="char" char=".">0.727</td>
<td align="char" char=".">0.402</td>
</tr>
<tr>
<td align="right">40</td>
<td align="left">MobiHealth [<xref ref-type="bibr" rid="pdig.0000324.ref058">58</xref>]</td>
<td align="char" char=".">0.562</td>
<td align="char" char=".">0.367</td>
<td align="char" char=".">0.369</td>
<td align="char" char=".">0.606</td>
<td align="char" char=".">0.374</td>
</tr>
</tbody>
</table>
</alternatives>
</table-wrap>
<table-wrap id="pdig.0000324.t006" position="float">
<object-id pub-id-type="doi">10.1371/journal.pdig.0000324.t006</object-id>
<label>Table 6</label>
<caption>
<title>Scores of the officially ranked methods on the test set for the clinical outcome identification task.</title>
<p>AUROC is the area under the receiver operating characteristic curve, AUPRC is the area under the precision-recall curve, <italic>F</italic>-measure is the traditional <italic>F</italic>-measure, accuracy is the traditional accuracy metric, and cost is the cost-based evaluation metric (<xref ref-type="disp-formula" rid="pdig.0000324.e008">8</xref>), i.e., the metric used to rank algorithms for the clinical outcome identification task.</p>
</caption>
<alternatives>
<graphic id="pdig.0000324.t006g" mimetype="image" position="float" xlink:href="info:doi/10.1371/journal.pdig.0000324.t006" xlink:type="simple"/>
<table border="0" frame="box" rules="all">
<colgroup>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
</colgroup>
<thead>
<tr>
<th align="right">Rank</th>
<th align="left">Team</th>
<th align="right">AUROC</th>
<th align="right">AUPRC</th>
<th align="right"><italic>F</italic>-measure</th>
<th align="right">Accuracy</th>
<th align="right">Cost</th>
</tr>
</thead>
<tbody>
<tr>
<td align="right">1</td>
<td align="left">CUED_Acoustics [<xref ref-type="bibr" rid="pdig.0000324.ref020">20</xref>]</td>
<td align="char" char=".">0.693</td>
<td align="char" char=".">0.715</td>
<td align="char" char=".">0.549</td>
<td align="char" char=".">0.602</td>
<td align="right">11144</td>
</tr>
<tr>
<td align="right"><italic>*</italic></td>
<td align="left"><italic>Voting-GBT</italic></td>
<td align="char" char="."><italic>0.583</italic></td>
<td align="char" char="."><italic>0.553</italic></td>
<td align="char" char="."><italic>0.546</italic></td>
<td align="char" char="."><italic>0.587</italic></td>
<td align="right"><italic>11357</italic></td>
</tr>
<tr>
<td align="right">2</td>
<td align="left">prna [<xref ref-type="bibr" rid="pdig.0000324.ref038">38</xref>]</td>
<td align="char" char=".">0.691</td>
<td align="char" char=".">0.706</td>
<td align="char" char=".">0.536</td>
<td align="char" char=".">0.587</td>
<td align="right">11403</td>
</tr>
<tr>
<td align="right"><italic>**</italic></td>
<td align="left"><italic>Voting-RF</italic></td>
<td align="char" char="."><italic>0.625</italic></td>
<td align="char" char="."><italic>0.584</italic></td>
<td align="char" char="."><italic>0.596</italic></td>
<td align="char" char="."><italic>0.606</italic></td>
<td align="right"><italic>11687</italic></td>
</tr>
<tr>
<td align="right">3</td>
<td align="left">Melbourne_Kangas [<xref ref-type="bibr" rid="pdig.0000324.ref046">46</xref>]</td>
<td align="char" char=".">0.663</td>
<td align="char" char=".">0.667</td>
<td align="char" char=".">0.528</td>
<td align="char" char=".">0.568</td>
<td align="right">11735</td>
</tr>
<tr>
<td align="right">4</td>
<td align="left">CeZIS [<xref ref-type="bibr" rid="pdig.0000324.ref026">26</xref>]</td>
<td align="char" char=".">0.614</td>
<td align="char" char=".">0.579</td>
<td align="char" char=".">0.511</td>
<td align="char" char=".">0.560</td>
<td align="right">11916</td>
</tr>
<tr>
<td align="right">5</td>
<td align="left">CAU_UMN [<xref ref-type="bibr" rid="pdig.0000324.ref023">23</xref>]</td>
<td align="char" char=".">0.660</td>
<td align="char" char=".">0.653</td>
<td align="char" char=".">0.505</td>
<td align="char" char=".">0.562</td>
<td align="right">11933</td>
</tr>
<tr>
<td align="right">6</td>
<td align="left">HCCL [<xref ref-type="bibr" rid="pdig.0000324.ref039">39</xref>]</td>
<td align="char" char=".">0.605</td>
<td align="char" char=".">0.579</td>
<td align="char" char=".">0.532</td>
<td align="char" char=".">0.562</td>
<td align="right">11943</td>
</tr>
<tr>
<td align="right">7</td>
<td align="left">Listen2YourHeart [<xref ref-type="bibr" rid="pdig.0000324.ref031">31</xref>]</td>
<td align="char" char=".">0.627</td>
<td align="char" char=".">0.607</td>
<td align="char" char=".">0.512</td>
<td align="char" char=".">0.558</td>
<td align="right">11946</td>
</tr>
<tr>
<td align="right">8</td>
<td align="left">uke-cardio [<xref ref-type="bibr" rid="pdig.0000324.ref034">34</xref>]</td>
<td align="char" char=".">0.665</td>
<td align="char" char=".">0.658</td>
<td align="char" char=".">0.509</td>
<td align="char" char=".">0.556</td>
<td align="right">11990</td>
</tr>
<tr>
<td align="right">9</td>
<td align="left">HearTech+ [<xref ref-type="bibr" rid="pdig.0000324.ref021">21</xref>]</td>
<td align="char" char=".">0.547</td>
<td align="char" char=".">0.527</td>
<td align="char" char=".">0.508</td>
<td align="char" char=".">0.551</td>
<td align="right">12069</td>
</tr>
<tr>
<td align="right">10</td>
<td align="left">HearHeart [<xref ref-type="bibr" rid="pdig.0000324.ref019">19</xref>]</td>
<td align="char" char=".">0.593</td>
<td align="char" char=".">0.605</td>
<td align="char" char=".">0.528</td>
<td align="char" char=".">0.556</td>
<td align="right">12110</td>
</tr>
<tr>
<td align="right">11</td>
<td align="left">Heart2Beat [<xref ref-type="bibr" rid="pdig.0000324.ref030">30</xref>]</td>
<td align="char" char=".">0.636</td>
<td align="char" char=".">0.625</td>
<td align="char" char=".">0.560</td>
<td align="char" char=".">0.572</td>
<td align="right">12244</td>
</tr>
<tr>
<td align="right">12</td>
<td align="left">ISIBrno-AIMT [<xref ref-type="bibr" rid="pdig.0000324.ref027">27</xref>]</td>
<td align="char" char=".">0.586</td>
<td align="char" char=".">0.567</td>
<td align="char" char=".">0.505</td>
<td align="char" char=".">0.541</td>
<td align="right">12313</td>
</tr>
<tr>
<td align="right">13</td>
<td align="left">UKJ_FSU [<xref ref-type="bibr" rid="pdig.0000324.ref055">55</xref>]</td>
<td align="char" char=".">0.565</td>
<td align="char" char=".">0.582</td>
<td align="char" char=".">0.481</td>
<td align="char" char=".">0.539</td>
<td align="right">12373</td>
</tr>
<tr>
<td align="right">14</td>
<td align="left">Simulab [<xref ref-type="bibr" rid="pdig.0000324.ref048">48</xref>]</td>
<td align="char" char=".">0.375</td>
<td align="char" char=".">0.421</td>
<td align="char" char=".">0.503</td>
<td align="char" char=".">0.537</td>
<td align="right">12419</td>
</tr>
<tr>
<td align="right">15</td>
<td align="left">MetaHeart [<xref ref-type="bibr" rid="pdig.0000324.ref036">36</xref>]</td>
<td align="char" char=".">0.500</td>
<td align="char" char=".">0.500</td>
<td align="char" char=".">0.511</td>
<td align="char" char=".">0.537</td>
<td align="right">12536</td>
</tr>
<tr>
<td align="right">16</td>
<td align="left">matLisboa [<xref ref-type="bibr" rid="pdig.0000324.ref033">33</xref>]</td>
<td align="char" char=".">0.644</td>
<td align="char" char=".">0.654</td>
<td align="char" char=".">0.545</td>
<td align="char" char=".">0.558</td>
<td align="right">12593</td>
</tr>
<tr>
<td align="right">17</td>
<td align="left">PathToMyHeart [<xref ref-type="bibr" rid="pdig.0000324.ref022">22</xref>]</td>
<td align="char" char=".">0.566</td>
<td align="char" char=".">0.567</td>
<td align="char" char=".">0.460</td>
<td align="char" char=".">0.535</td>
<td align="right">12637</td>
</tr>
<tr>
<td align="right">18</td>
<td align="left">PhysioDreamfly [<xref ref-type="bibr" rid="pdig.0000324.ref029">29</xref>]</td>
<td align="char" char=".">0.602</td>
<td align="char" char=".">0.626</td>
<td align="char" char=".">0.486</td>
<td align="char" char=".">0.518</td>
<td align="right">12831</td>
</tr>
<tr>
<td align="right">19</td>
<td align="left">Revenger [<xref ref-type="bibr" rid="pdig.0000324.ref032">32</xref>]</td>
<td align="char" char=".">0.594</td>
<td align="char" char=".">0.604</td>
<td align="char" char=".">0.442</td>
<td align="char" char=".">0.520</td>
<td align="right">12944</td>
</tr>
<tr>
<td align="right">20</td>
<td align="left">amc-sh [<xref ref-type="bibr" rid="pdig.0000324.ref040">40</xref>]</td>
<td align="char" char=".">0.593</td>
<td align="char" char=".">0.594</td>
<td align="char" char=".">0.512</td>
<td align="char" char=".">0.528</td>
<td align="right">13002</td>
</tr>
<tr>
<td align="right">21</td>
<td align="left">MainLab [<xref ref-type="bibr" rid="pdig.0000324.ref049">49</xref>]</td>
<td align="char" char=".">0.572</td>
<td align="char" char=".">0.572</td>
<td align="char" char=".">0.517</td>
<td align="char" char=".">0.528</td>
<td align="right">13259</td>
</tr>
<tr>
<td align="right">22</td>
<td align="left">Team_IIITH [<xref ref-type="bibr" rid="pdig.0000324.ref037">37</xref>]</td>
<td align="char" char=".">0.616</td>
<td align="char" char=".">0.610</td>
<td align="char" char=".">0.533</td>
<td align="char" char=".">0.541</td>
<td align="right">13264</td>
</tr>
<tr>
<td align="right">23</td>
<td align="left">One_Heart_Health [<xref ref-type="bibr" rid="pdig.0000324.ref035">35</xref>]</td>
<td align="char" char=".">0.587</td>
<td align="char" char=".">0.594</td>
<td align="char" char=".">0.531</td>
<td align="char" char=".">0.539</td>
<td align="right">13283</td>
</tr>
<tr>
<td align="right">24</td>
<td align="left">JUST_IT_Academy1 [<xref ref-type="bibr" rid="pdig.0000324.ref041">41</xref>]</td>
<td align="char" char=".">0.624</td>
<td align="char" char=".">0.631</td>
<td align="char" char=".">0.559</td>
<td align="char" char=".">0.562</td>
<td align="right">13394</td>
</tr>
<tr>
<td align="right">25</td>
<td align="left">SmartBeatIT [<xref ref-type="bibr" rid="pdig.0000324.ref025">25</xref>]</td>
<td align="char" char=".">0.647</td>
<td align="char" char=".">0.655</td>
<td align="char" char=".">0.593</td>
<td align="char" char=".">0.593</td>
<td align="right">13815</td>
</tr>
<tr>
<td align="right">26</td>
<td align="left">Leicester Fox [<xref ref-type="bibr" rid="pdig.0000324.ref050">50</xref>]</td>
<td align="char" char=".">0.662</td>
<td align="char" char=".">0.646</td>
<td align="char" char=".">0.620</td>
<td align="char" char=".">0.621</td>
<td align="right">13844</td>
</tr>
<tr>
<td align="right">27</td>
<td align="left">listNto_urHeart [<xref ref-type="bibr" rid="pdig.0000324.ref043">43</xref>]</td>
<td align="char" char=".">0.489</td>
<td align="char" char=".">0.490</td>
<td align="char" char=".">0.495</td>
<td align="char" char=".">0.505</td>
<td align="right">13866</td>
</tr>
<tr>
<td align="right">28</td>
<td align="left">Murmur Mia! [<xref ref-type="bibr" rid="pdig.0000324.ref028">28</xref>]</td>
<td align="char" char=".">0.682</td>
<td align="char" char=".">0.688</td>
<td align="char" char=".">0.382</td>
<td align="char" char=".">0.528</td>
<td align="right">14228</td>
</tr>
<tr>
<td align="right">29</td>
<td align="left">Care4MyHeart [<xref ref-type="bibr" rid="pdig.0000324.ref024">24</xref>]</td>
<td align="char" char=".">0.624</td>
<td align="char" char=".">0.632</td>
<td align="char" char=".">0.597</td>
<td align="char" char=".">0.597</td>
<td align="right">14410</td>
</tr>
<tr>
<td align="right">30</td>
<td align="left">USST_Med [<xref ref-type="bibr" rid="pdig.0000324.ref044">44</xref>]</td>
<td align="char" char=".">0.623</td>
<td align="char" char=".">0.621</td>
<td align="char" char=".">0.583</td>
<td align="char" char=".">0.583</td>
<td align="right">14529</td>
</tr>
<tr>
<td align="right">31</td>
<td align="left">lubdub [<xref ref-type="bibr" rid="pdig.0000324.ref053">53</xref>]</td>
<td align="char" char=".">0.560</td>
<td align="char" char=".">0.551</td>
<td align="char" char=".">0.345</td>
<td align="char" char=".">0.509</td>
<td align="right">14905</td>
</tr>
<tr>
<td align="right">32</td>
<td align="left">PCGPAW [<xref ref-type="bibr" rid="pdig.0000324.ref045">45</xref>]</td>
<td align="char" char=".">0.500</td>
<td align="char" char=".">0.500</td>
<td align="char" char=".">0.337</td>
<td align="char" char=".">0.507</td>
<td align="right">15083</td>
</tr>
<tr>
<td align="right">32</td>
<td align="left">SeaCrying [<xref ref-type="bibr" rid="pdig.0000324.ref047">47</xref>]</td>
<td align="char" char=".">0.500</td>
<td align="char" char=".">0.500</td>
<td align="char" char=".">0.337</td>
<td align="char" char=".">0.507</td>
<td align="right">15083</td>
</tr>
<tr>
<td align="right">34</td>
<td align="left">LSMU [<xref ref-type="bibr" rid="pdig.0000324.ref042">42</xref>]</td>
<td align="char" char=".">0.325</td>
<td align="char" char=".">0.399</td>
<td align="char" char=".">0.344</td>
<td align="char" char=".">0.388</td>
<td align="right">15402</td>
</tr>
<tr>
<td align="right">35</td>
<td align="left">Bear_FH [<xref ref-type="bibr" rid="pdig.0000324.ref057">57</xref>]</td>
<td align="char" char=".">0.578</td>
<td align="char" char=".">0.590</td>
<td align="char" char=".">0.549</td>
<td align="char" char=".">0.551</td>
<td align="right">15982</td>
</tr>
<tr>
<td align="right">35</td>
<td align="left">fly_h [<xref ref-type="bibr" rid="pdig.0000324.ref052">52</xref>]</td>
<td align="char" char=".">0.578</td>
<td align="char" char=".">0.590</td>
<td align="char" char=".">0.549</td>
<td align="char" char=".">0.551</td>
<td align="right">15982</td>
</tr>
<tr>
<td align="right">37</td>
<td align="left">AKSJ_97BSc [<xref ref-type="bibr" rid="pdig.0000324.ref054">54</xref>]</td>
<td align="char" char=".">0.549</td>
<td align="char" char=".">0.550</td>
<td align="char" char=".">0.518</td>
<td align="char" char=".">0.520</td>
<td align="right">16427</td>
</tr>
<tr>
<td align="right">38</td>
<td align="left">BrownBAI [<xref ref-type="bibr" rid="pdig.0000324.ref056">56</xref>]</td>
<td align="char" char=".">0.487</td>
<td align="char" char=".">0.486</td>
<td align="char" char=".">0.497</td>
<td align="char" char=".">0.499</td>
<td align="right">16773</td>
</tr>
<tr>
<td align="right">39</td>
<td align="left">MobiHealth [<xref ref-type="bibr" rid="pdig.0000324.ref058">58</xref>]</td>
<td align="char" char=".">0.523</td>
<td align="char" char=".">0.512</td>
<td align="char" char=".">0.503</td>
<td align="char" char=".">0.520</td>
<td align="right">18754</td>
</tr>
</tbody>
</table>
</alternatives>
</table-wrap>
</sec>
</sec>
<sec id="sec013" sec-type="conclusions">
<title>Discussion</title>
<p>Cardiac auscultation is one of the most cost-effective tools for helping clinicians to identify heart murmurs, and the CirCor Digiscope dataset enriches our understanding cardiac auscultation within a resource-constrained environment. However, despite the novelty and value of this dataset, it, like every dataset, has limitations.</p>
<p>No ages were available for the pregnant individuals in the CirCor DigiScope dataset. It was unclear to the teams if the pregnant individuals belonged to the pediatric age group of the rest of the patients, or if they had a different set of exclusion criteria from the other patients, potentially limiting the performance and appropriateness of models that use this dataset on pregnant individuals.</p>
<p>There was a single human annotator for labeling the heart murmurs; we did not have information about the number of human annotators for labeling the clinical outcomes of abnormal or normal heart function. We expect disagreements between annotators, and several annotators are often needed to produce a single, consistent annotation of a health record. Even several annotators may produce disparate annotations [<xref ref-type="bibr" rid="pdig.0000324.ref059">59</xref>]. It is likely that different or more annotators would result in different annotations.</p>
<p>Some issues, such as background noises in the recordings and the relatively high heart rates of children, are inherent to the data or to the collection of the data. To preserve the realism of the problem and the diversity of the approaches, we did not remove these issues, enumerate them as potential difficulties, or suggest how to address them; many of the solutions employ different strategies to address different problems with the data.</p>
<p>Some heart murmurs are pathological, indicating a physiological problem that requires monitoring and/or intervention. Other heart murmurs are innocent, with sounds resulting from normal blood flow, and do not require treatment. However, the human annotator did not identify which heart murmurs were pathological or innocent; the clinical outcomes, which reflect a full examination of the patient, are the strongest evidence in the dataset for characterizing the severity of any heart murmurs or underlying cardiac disease. Therefore, we only evaluated the ability of algorithms to identify heart murmurs, not their ability to identify pathological heart murmurs or differentiate between pathological and innocent heart murmurs, but this task is still valuable for screening for cardiovascular disease.</p>
<p>The definition of a task and the choice of evaluation metrics for quantifying an algorithm’s performance on the task affect the actual and perceived clinical relevance of the algorithms [<xref ref-type="bibr" rid="pdig.0000324.ref014">14</xref>]. The definitions of the Challenge evaluation metrics (<xref ref-type="disp-formula" rid="pdig.0000324.e001">1</xref>) and (<xref ref-type="disp-formula" rid="pdig.0000324.e008">8</xref>) are attempts to make the evaluation metrics, and therefore the algorithms developed for these metrics, more clinically relevant. The correlation in performance between the traditional and Challenge metrics demonstrates that methods that perform better by one metric tended to perform better by another metric (at least for the murmur detection task), but the best-scoring method by one metric was often different from the best best-scoring method by another metric, motivating the careful consideration of metrics; see Figs <xref ref-type="fig" rid="pdig.0000324.g006">6</xref> and <xref ref-type="fig" rid="pdig.0000324.g007">7</xref>. We also recognize that these metrics are imperfect descriptions of clinical needs; in particular, healthcare cost can be a poor proxy for health needs [<xref ref-type="bibr" rid="pdig.0000324.ref013">13</xref>, <xref ref-type="bibr" rid="pdig.0000324.ref014">14</xref>].</p>
<p>The relatively poor performance of the methods by all metrics on the clinical outcome identification task suggests the difficulty of performing this task using the PCG recordings alone; we note that echocardiography is a standard diagnostic tool for assessing cardiac function, which is a more expensive and less accessible modality than phonocardiography.</p>
<p>The voting algorithms had only modest performance improvements, if any, over the individual algorithms. Indeed, the voting algorithms did not use any data-derived features, which could help to provide context by associating different algorithms with different patient subgroups. The features for the voting algorithms included the top <italic>k</italic> algorithms, even when including a lower-ranked entry with a worse overall score or excluding a higher-ranked entry with a better overall score would improve the performance of the voting algorithm. This experiment only considered GBT and RF models, but other types of models could potentially achieve better performance. The training procedure for the GBT and RF models did not use hyperparameter optimization (beyond the selection of the number <italic>k</italic> of individual algorithms), limiting their performance as well. Also, unlike the Challenge teams, we had access to the test set, but, like the Challenge teams, our formal training procedure did not use it. Despite these limitations, the ability of the voting algorithms to slightly improve on the performance on the top-ranked algorithms for the murmur detection task, but not the clinical outcome identification task, also suggests the differences in difficulty between the two related tasks considered by the Challenge.</p>
</sec>
<sec id="sec014" sec-type="conclusions">
<title>Conclusions</title>
<p>The George B. Moody PhysioNet Challenge explored the potential for algorithmic pre-screening for heart murmurs and abnormal cardiac function in resource-constrained environments. We invited the Challenge participants to design working, open-source algorithms for identifying heart murmurs and clinical outcomes from PCG recordings, resulting in 53 working implementations of different algorithmic approaches for interpreting PCGs. A voting approach to combining the diverse approaches resulted in a superior performance over the individual algorithms for murmur detection but not for clinical outcome identification.</p>
<p>By reducing human screening of patients with normal cardiac function, algorithms can lower healthcare costs and increase the effective screening capacity for patients with abnormal cardiac function. The cost function proposed in this Challenge could be the basis for cost-effective screening that balances both the financial and health burden of correctly or incorrectly diagnosing patients. However, it will be important to optimize the proposed cost function for a given healthcare system or population, since disease prevalence, financial resources, and healthcare resources can differ enormously in different settings.</p>
</sec>
<sec id="sec015" sec-type="supplementary-material">
<title>Supporting information</title>
<supplementary-material id="pdig.0000324.s001" mimetype="application/pdf" position="float" xlink:href="info:doi/10.1371/journal.pdig.0000324.s001" xlink:type="simple">
<label>S1 Appendix</label>
<caption>
<title>Additional scoring metrics.</title>
<p>(PDF)</p>
</caption>
</supplementary-material>
<supplementary-material id="pdig.0000324.s002" mimetype="application/pdf" position="float" xlink:href="info:doi/10.1371/journal.pdig.0000324.s002" xlink:type="simple">
<label>S2 Appendix</label>
<caption>
<title>Mathematical derivation of the cost-based scoring metric.</title>
<p>(PDF)</p>
</caption>
</supplementary-material>
</sec>
</body>
<back>
<ack>
<p>None of the funding entities influenced the design of the Challenge or provided data for the Challenge. The content of this manuscript is solely the responsibility of the authors and does not necessarily represent the official views of the funding entities.</p>
</ack>
<ref-list>
<title>References</title>
<ref id="pdig.0000324.ref001">
<label>1</label>
<mixed-citation publication-type="journal" xlink:type="simple">
<name name-style="western"><surname>Amin</surname> <given-names>DS</given-names></name>, <name name-style="western"><surname>Fethi</surname> <given-names>BR</given-names></name>. <article-title>Features for heartbeat sound signal normal and pathological</article-title>. <source>Recent Patents on Computer Science</source>. <year>2008</year>;<volume>1</volume>(<issue>1</issue>):<fpage>1</fpage>–<lpage>8</lpage>. <comment>doi: <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.2174/1874479610801010001" xlink:type="simple">10.2174/1874479610801010001</ext-link></comment></mixed-citation>
</ref>
<ref id="pdig.0000324.ref002">
<label>2</label>
<mixed-citation publication-type="journal" xlink:type="simple">
<name name-style="western"><surname>Singh</surname> <given-names>J</given-names></name>, <name name-style="western"><surname>Anand</surname> <given-names>RS</given-names></name>. <article-title>Computer aided analysis of phonocardiogram</article-title>. <source>Journal of Medical Engineering &amp; Technology</source>. <year>2007</year>;<volume>31</volume>(<issue>5</issue>):<fpage>319</fpage>–<lpage>323</lpage>. <comment>doi: <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1080/03091900500282772" xlink:type="simple">10.1080/03091900500282772</ext-link></comment> <object-id pub-id-type="pmid">17701776</object-id></mixed-citation>
</ref>
<ref id="pdig.0000324.ref003">
<label>3</label>
<mixed-citation publication-type="journal" xlink:type="simple">
<name name-style="western"><surname>Marcus</surname> <given-names>G</given-names></name>, <name name-style="western"><surname>Vessey</surname> <given-names>J</given-names></name>, <name name-style="western"><surname>Jordan</surname> <given-names>MV</given-names></name>, <name name-style="western"><surname>Huddleston</surname> <given-names>M</given-names></name>, <name name-style="western"><surname>McKeown</surname> <given-names>B</given-names></name>, <name name-style="western"><surname>Gerber</surname> <given-names>IL</given-names></name>, <etal>et al</etal>. <article-title>Relationship Between Accurate Auscultation of a Clinically Useful Third Heart Sound and Level of Experience</article-title>. <source>Archives of Internal Medicine</source>. <year>2006</year>;<volume>166</volume>(<issue>6</issue>):<fpage>617</fpage>–<lpage>622</lpage>. <comment>doi: <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1001/archinte.166.6.617" xlink:type="simple">10.1001/archinte.166.6.617</ext-link></comment> <object-id pub-id-type="pmid">16567599</object-id></mixed-citation>
</ref>
<ref id="pdig.0000324.ref004">
<label>4</label>
<mixed-citation publication-type="book" xlink:type="simple">
<name name-style="western"><surname>Ishmail</surname> <given-names>AA</given-names></name>, <name name-style="western"><surname>Wing</surname> <given-names>S</given-names></name>, <name name-style="western"><surname>Ferguson</surname> <given-names>J</given-names></name>, <name name-style="western"><surname>Hutchinson</surname> <given-names>TA</given-names></name>, <name name-style="western"><surname>Magder</surname> <given-names>S</given-names></name>, <name name-style="western"><surname>Flegel</surname> <given-names>KM</given-names></name>. <chapter-title>Interobserver Agreement by Auscultation in the Presence of a Third Heart Sound in Patients with Congestive Heart Failure</chapter-title>. <source>Chest</source>. <year>1987</year>;<volume>91</volume>(<issue>6</issue>):<fpage>870</fpage>–<lpage>873</lpage>. <comment>doi: <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1378/chest.91.6.870" xlink:type="simple">10.1378/chest.91.6.870</ext-link></comment></mixed-citation>
</ref>
<ref id="pdig.0000324.ref005">
<label>5</label>
<mixed-citation publication-type="book" xlink:type="simple">
<name name-style="western"><surname>Vermarien</surname> <given-names>H</given-names></name>. <chapter-title>Phonocardiography</chapter-title>. In: <name name-style="western"><surname>Webster</surname> <given-names>JG</given-names></name>, editor. <source>Encyclopedia of Medical Devices and Instrumentation</source>. vol. <volume>5</volume>. <edition designator="2">2nd ed</edition>. <publisher-name>John Wiley &amp; Sons, Ltd</publisher-name>; <year>2006</year>. p. <fpage>278</fpage>–<lpage>290</lpage>.</mixed-citation>
</ref>
<ref id="pdig.0000324.ref006">
<label>6</label>
<mixed-citation publication-type="journal" xlink:type="simple">
<name name-style="western"><surname>Oliveira</surname> <given-names>JH</given-names></name>, <name name-style="western"><surname>Renna</surname> <given-names>F</given-names></name>, <name name-style="western"><surname>Costa</surname> <given-names>P</given-names></name>, <name name-style="western"><surname>Nogueira</surname> <given-names>D</given-names></name>, <name name-style="western"><surname>Oliveira</surname> <given-names>C</given-names></name>, <name name-style="western"><surname>Ferreira</surname> <given-names>C</given-names></name>, <etal>et al</etal>. <article-title>The CirCor DigiScope Dataset: From Murmur Detection to Murmur Classification</article-title>. <source>IEEE Journal of Biomedical and Health Informatics</source>. <year>2021</year>;<volume>26</volume>(<issue>6</issue>):<fpage>2524</fpage>–<lpage>2535</lpage>. <comment>doi: <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1109/JBHI.2021.3137048" xlink:type="simple">10.1109/JBHI.2021.3137048</ext-link></comment></mixed-citation>
</ref>
<ref id="pdig.0000324.ref007">
<label>7</label>
<mixed-citation publication-type="journal" xlink:type="simple">
<name name-style="western"><surname>Liu</surname> <given-names>C</given-names></name>, <name name-style="western"><surname>Springer</surname> <given-names>D</given-names></name>, <name name-style="western"><surname>Li</surname> <given-names>Q</given-names></name>, <name name-style="western"><surname>Moody</surname> <given-names>B</given-names></name>, <name name-style="western"><surname>Juan</surname> <given-names>RA</given-names></name>, <name name-style="western"><surname>Chorro</surname> <given-names>FJ</given-names></name>, <etal>et al</etal>. <article-title>An open access database for the evaluation of heart sound algorithms</article-title>. <source>Physiological Measurement</source>. <year>2016</year>;<volume>37</volume>(<issue>12</issue>):<fpage>2181</fpage>–<lpage>2213</lpage>. <comment>doi: <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1088/0967-3334/37/12/2181" xlink:type="simple">10.1088/0967-3334/37/12/2181</ext-link></comment> <object-id pub-id-type="pmid">27869105</object-id></mixed-citation>
</ref>
<ref id="pdig.0000324.ref008">
<label>8</label>
<mixed-citation publication-type="journal" xlink:type="simple">
<name name-style="western"><surname>Oliveira</surname> <given-names>J</given-names></name>, <name name-style="western"><surname>Renna</surname> <given-names>F</given-names></name>, <name name-style="western"><surname>Mantadelis</surname> <given-names>T</given-names></name>, <name name-style="western"><surname>Coimbra</surname> <given-names>M</given-names></name>. <article-title>Adaptive Sojourn Time HSMM for Heart Sound Segmentation</article-title>. <source>IEEE Journal of Biomedical and Health Informatics</source>. <year>2019</year>;<volume>23</volume>(<issue>2</issue>):<fpage>642</fpage>–<lpage>649</lpage>. <comment>doi: <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1109/JBHI.2018.2841197" xlink:type="simple">10.1109/JBHI.2018.2841197</ext-link></comment> <object-id pub-id-type="pmid">29993729</object-id></mixed-citation>
</ref>
<ref id="pdig.0000324.ref009">
<label>9</label>
<mixed-citation publication-type="journal" xlink:type="simple">
<name name-style="western"><surname>Renna</surname> <given-names>F</given-names></name>, <name name-style="western"><surname>Oliveira</surname> <given-names>J</given-names></name>, <name name-style="western"><surname>Coimbra</surname> <given-names>MT</given-names></name>. <article-title>Deep Convolutional Neural Networks for Heart Sound Segmentation</article-title>. <source>IEEE Journal of Biomedical and Health Informatics</source>. <year>2019</year>;<volume>23</volume>(<issue>6</issue>):<fpage>2435</fpage>–<lpage>2445</lpage>. <comment>doi: <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1109/JBHI.2019.2894222" xlink:type="simple">10.1109/JBHI.2019.2894222</ext-link></comment> <object-id pub-id-type="pmid">30668487</object-id></mixed-citation>
</ref>
<ref id="pdig.0000324.ref010">
<label>10</label>
<mixed-citation publication-type="journal" xlink:type="simple">
<name name-style="western"><surname>Freeman</surname> <given-names>AR</given-names></name>. <article-title>The Clinical Significance of the Systolic Murmur</article-title>. <source>Annals of Internal Medicine</source>. <year>1933</year>;<volume>6</volume>(<issue>11</issue>):<fpage>1371</fpage>. <comment>doi: <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.7326/0003-4819-6-11-1371" xlink:type="simple">10.7326/0003-4819-6-11-1371</ext-link></comment></mixed-citation>
</ref>
<ref id="pdig.0000324.ref011">
<label>11</label>
<mixed-citation publication-type="journal" xlink:type="simple">
<name name-style="western"><surname>Goldberger</surname> <given-names>AL</given-names></name>, <name name-style="western"><surname>Amaral</surname> <given-names>LA</given-names></name>, <name name-style="western"><surname>Glass</surname> <given-names>L</given-names></name>, <name name-style="western"><surname>Hausdorff</surname> <given-names>JM</given-names></name>, <name name-style="western"><surname>Ivanov</surname> <given-names>PC</given-names></name>, <name name-style="western"><surname>Mark</surname> <given-names>RG</given-names></name>, <etal>et al</etal>. <article-title>PhysioBank, PhysioToolkit, and PhysioNet: Components of a New Research Resource for Complex Physiologic Signals</article-title>. <source>Circulation</source>. <year>2000</year>;<volume>101</volume>(<issue>23</issue>):<fpage>e215</fpage>–<lpage>e220</lpage>. <comment>doi: <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1161/01.CIR.101.23.e215" xlink:type="simple">10.1161/01.CIR.101.23.e215</ext-link></comment> <object-id pub-id-type="pmid">10851218</object-id></mixed-citation>
</ref>
<ref id="pdig.0000324.ref012">
<label>12</label>
<mixed-citation publication-type="journal" xlink:type="simple">
<name name-style="western"><surname>Reyna</surname> <given-names>MA</given-names></name>, <name name-style="western"><surname>Josef</surname> <given-names>C</given-names></name>, <name name-style="western"><surname>Jeter</surname> <given-names>R</given-names></name>, <name name-style="western"><surname>Shashikumar</surname> <given-names>SP</given-names></name>, <name name-style="western"><surname>Westover</surname> <given-names>MB</given-names></name>, <name name-style="western"><surname>Nemati</surname> <given-names>S</given-names></name>, <etal>et al</etal>. <article-title>Early Prediction of Sepsis from Clinical Data: the PhysioNet/Computing in Cardiology Challenge 2019</article-title>. <source>Critical Care Medicine</source>. <year>2019</year>;<volume>48</volume>:<fpage>210</fpage>–<lpage>217</lpage>. <comment>doi: <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1097/CCM.0000000000004145" xlink:type="simple">10.1097/CCM.0000000000004145</ext-link></comment></mixed-citation>
</ref>
<ref id="pdig.0000324.ref013">
<label>13</label>
<mixed-citation publication-type="journal" xlink:type="simple">
<name name-style="western"><surname>Mullainathan</surname> <given-names>S</given-names></name>, <name name-style="western"><surname>Obermeyer</surname> <given-names>Z</given-names></name>. <article-title>On the Inequity of Predicting A While Hoping for B</article-title>. In: <source>AEA Papers and Proceedings</source>. vol. <volume>111</volume>; <year>2021</year>. p. <fpage>37</fpage>–<lpage>42</lpage>. <comment>doi: <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1257/pandp.20211078" xlink:type="simple">10.1257/pandp.20211078</ext-link></comment></mixed-citation>
</ref>
<ref id="pdig.0000324.ref014">
<label>14</label>
<mixed-citation publication-type="journal" xlink:type="simple">
<name name-style="western"><surname>Reyna</surname> <given-names>MA</given-names></name>, <name name-style="western"><surname>Nsoesie</surname> <given-names>EO</given-names></name>, <name name-style="western"><surname>Clifford</surname> <given-names>GD</given-names></name>. <article-title>Rethinking Algorithm Performance Metrics for Artificial Intelligence in Diagnostic Medicine</article-title>. <source>JAMA</source>. <year>2022</year>;<volume>328</volume>(<issue>4</issue>):<fpage>329</fpage>–<lpage>330</lpage>. <comment>doi: <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1001/jama.2022.10561" xlink:type="simple">10.1001/jama.2022.10561</ext-link></comment> <object-id pub-id-type="pmid">35802382</object-id></mixed-citation>
</ref>
<ref id="pdig.0000324.ref015">
<label>15</label>
<mixed-citation publication-type="journal" xlink:type="simple">
<name name-style="western"><surname>Friedman</surname> <given-names>JH</given-names></name>. <article-title>Greedy function approximation: a gradient boosting machine</article-title>. <source>Annals of Statistics</source>. <year>2001</year>; p. <fpage>1189</fpage>–<lpage>1232</lpage>.</mixed-citation>
</ref>
<ref id="pdig.0000324.ref016">
<label>16</label>
<mixed-citation publication-type="other" xlink:type="simple">Chen T, Guestrin C. XGBoost: A scalable tree boosting system. In: Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining; 2016. p. 785–794.</mixed-citation>
</ref>
<ref id="pdig.0000324.ref017">
<label>17</label>
<mixed-citation publication-type="journal" xlink:type="simple">
<name name-style="western"><surname>Breiman</surname> <given-names>L</given-names></name>. <article-title>Random forests</article-title>. <source>Machine Learning</source>. <year>2001</year>;<volume>45</volume>:<fpage>5</fpage>–<lpage>32</lpage>.</mixed-citation>
</ref>
<ref id="pdig.0000324.ref018">
<label>18</label>
<mixed-citation publication-type="book" xlink:type="simple">
<name name-style="western"><surname>Reyna</surname> <given-names>M</given-names></name>, <name name-style="western"><surname>Kiarashi</surname> <given-names>Y</given-names></name>, <name name-style="western"><surname>Andoni</surname> <given-names>E</given-names></name>, <name name-style="western"><surname>Oliveira</surname> <given-names>J</given-names></name>, <name name-style="western"><surname>Renna</surname> <given-names>F</given-names></name>, <name name-style="western"><surname>Gu</surname> <given-names>A</given-names></name>, <etal>et al</etal>. <chapter-title>Heart Murmur Detection from Phonocardiogram Recordings: The George B. Moody PhysioNet Challenge 2022</chapter-title>. In: <source>2022 Computing in Cardiology (CinC)</source>. vol. <volume>49</volume>. <publisher-name>IEEE</publisher-name>; <year>2022</year>. p. <fpage>1</fpage>–<lpage>4</lpage>.</mixed-citation>
</ref>
<ref id="pdig.0000324.ref019">
<label>19</label>
<mixed-citation publication-type="book" xlink:type="simple">
<name name-style="western"><surname>Lu</surname> <given-names>H</given-names></name>, <name name-style="western"><surname>Yip</surname> <given-names>J</given-names></name>, <name name-style="western"><surname>Steigleder</surname> <given-names>T</given-names></name>, <name name-style="western"><surname>Grießhammer</surname> <given-names>S</given-names></name>, <name name-style="western"><surname>Jami</surname> <given-names>NVSJ</given-names></name>, <name name-style="western"><surname>Eskofier</surname> <given-names>B</given-names></name>, <etal>et al</etal>. <chapter-title>A Lightweight Robust Approach for Automatic Heart Murmurs and Clinical Outcomes Classification from Phonocardiogram Recordings</chapter-title>. In: <source>2022 Computing in Cardiology (CinC)</source>. vol. <volume>49</volume>. <publisher-name>IEEE</publisher-name>; <year>2022</year>. p. <fpage>1</fpage>–<lpage>4</lpage>.</mixed-citation>
</ref>
<ref id="pdig.0000324.ref020">
<label>20</label>
<mixed-citation publication-type="book" xlink:type="simple">
<name name-style="western"><surname>McDonald</surname> <given-names>A</given-names></name>, <name name-style="western"><surname>Gales</surname> <given-names>M</given-names></name>, <name name-style="western"><surname>Agarwal</surname> <given-names>A</given-names></name>. <chapter-title>Detection of Heart Murmurs in Phonocardiograms with Parallel Hidden Semi-Markov Models</chapter-title>. In: <source>2022 Computing in Cardiology (CinC)</source>. vol. <volume>49</volume>. <publisher-name>IEEE</publisher-name>; <year>2022</year>. p. <fpage>1</fpage>–<lpage>4</lpage>.</mixed-citation>
</ref>
<ref id="pdig.0000324.ref021">
<label>21</label>
<mixed-citation publication-type="book" xlink:type="simple">
<name name-style="western"><surname>Xu</surname> <given-names>Y</given-names></name>, <name name-style="western"><surname>Bao</surname> <given-names>X</given-names></name>, <name name-style="western"><surname>Lam</surname> <given-names>HK</given-names></name>, <name name-style="western"><surname>Kamavuako</surname> <given-names>E</given-names></name>. <chapter-title>Hierarchical Multi-Scale Convolutional Network for Murmurs Detection on PCG Signals</chapter-title>. In: <source>2022 Computing in Cardiology (CinC)</source>. vol. <volume>49</volume>. <publisher-name>IEEE</publisher-name>; <year>2022</year>. p. <fpage>1</fpage>–<lpage>4</lpage>.</mixed-citation>
</ref>
<ref id="pdig.0000324.ref022">
<label>22</label>
<mixed-citation publication-type="book" xlink:type="simple">
<name name-style="western"><surname>Krones</surname> <given-names>F</given-names></name>, <name name-style="western"><surname>Walker</surname> <given-names>B</given-names></name>, <name name-style="western"><surname>Mahdi</surname> <given-names>A</given-names></name>, <name name-style="western"><surname>Kiskin</surname> <given-names>I</given-names></name>, <name name-style="western"><surname>Lyons</surname> <given-names>T</given-names></name>, <name name-style="western"><surname>Parsons</surname> <given-names>G</given-names></name>. <chapter-title>Dual Bayesian ResNet: A Deep Learning Approach to Heart Murmur Detection</chapter-title>. In: <source>2022 Computing in Cardiology (CinC)</source>. vol. <volume>49</volume>. <publisher-name>IEEE</publisher-name>; <year>2022</year>. p. <fpage>1</fpage>–<lpage>4</lpage>.</mixed-citation>
</ref>
<ref id="pdig.0000324.ref023">
<label>23</label>
<mixed-citation publication-type="book" xlink:type="simple">
<name name-style="western"><surname>Lee</surname> <given-names>J</given-names></name>, <name name-style="western"><surname>Kang</surname> <given-names>T</given-names></name>, <name name-style="western"><surname>Kim</surname> <given-names>N</given-names></name>, <name name-style="western"><surname>Han</surname> <given-names>S</given-names></name>, <name name-style="western"><surname>Won</surname> <given-names>H</given-names></name>, <name name-style="western"><surname>Gong</surname> <given-names>W</given-names></name>, <etal>et al</etal>. <chapter-title>Deep Learning Based Heart Murmur Detection using Frequency-time Domain Features of Heartbeat Sounds</chapter-title>. In: <source>2022 Computing in Cardiology (CinC)</source>. vol. <volume>49</volume>. <publisher-name>IEEE</publisher-name>; <year>2022</year>. p. <fpage>1</fpage>–<lpage>4</lpage>.</mixed-citation>
</ref>
<ref id="pdig.0000324.ref024">
<label>24</label>
<mixed-citation publication-type="book" xlink:type="simple">
<name name-style="western"><surname>Alkhodari</surname> <given-names>M</given-names></name>, <name name-style="western"><surname>Azman</surname> <given-names>S</given-names></name>, <name name-style="western"><surname>Hadjileontiadis</surname> <given-names>L</given-names></name>, <name name-style="western"><surname>Khandoker</surname> <given-names>A</given-names></name>. <chapter-title>Ensemble Transformer-Based Neural Networks Detect Heart Murmur In Phonocardiogram Recordings</chapter-title>. In: <source>2022 Computing in Cardiology (CinC)</source>. vol. <volume>49</volume>. <publisher-name>IEEE</publisher-name>; <year>2022</year>. p. <fpage>1</fpage>–<lpage>4</lpage>.</mixed-citation>
</ref>
<ref id="pdig.0000324.ref025">
<label>25</label>
<mixed-citation publication-type="book" xlink:type="simple">
<name name-style="western"><surname>Monteiro</surname> <given-names>S</given-names></name>, <name name-style="western"><surname>Fred</surname> <given-names>A</given-names></name>, <name name-style="western"><surname>Silva</surname> <given-names>H</given-names></name>. <chapter-title>Detection of Heart Sound Murmurs and Clinical Outcome with Bidirectional Long Short-Term Memory Networks</chapter-title>. In: <source>2022 Computing in Cardiology (CinC)</source>. vol. <volume>49</volume>. <publisher-name>IEEE</publisher-name>; <year>2022</year>. p. <fpage>1</fpage>–<lpage>4</lpage>.</mixed-citation>
</ref>
<ref id="pdig.0000324.ref026">
<label>26</label>
<mixed-citation publication-type="book" xlink:type="simple">
<name name-style="western"><surname>Ľubomír</surname> <given-names>Antoni</given-names></name>, <name name-style="western"><surname>Bruoth</surname> <given-names>E</given-names></name>, <name name-style="western"><surname>Szabari</surname> <given-names>A</given-names></name>, <name name-style="western"><surname>Vozáriková</surname> <given-names>G</given-names></name>, <name name-style="western"><surname>Bugata</surname> <given-names>P</given-names></name>, <name name-style="western"><surname>Jr</surname> <given-names>PB</given-names></name>, <etal>et al</etal>. <chapter-title>Murmur Identification Using Supervised Constrastive Learning</chapter-title>. In: <source>2022 Computing in Cardiology (CinC)</source>. vol. <volume>49</volume>. <publisher-name>IEEE</publisher-name>; <year>2022</year>. p. <fpage>1</fpage>–<lpage>4</lpage>.</mixed-citation>
</ref>
<ref id="pdig.0000324.ref027">
<label>27</label>
<mixed-citation publication-type="book" xlink:type="simple">
<name name-style="western"><surname>Nejedly</surname> <given-names>P</given-names></name>, <name name-style="western"><surname>Pavlus</surname> <given-names>J</given-names></name>, <name name-style="western"><surname>Smisek</surname> <given-names>R</given-names></name>, <name name-style="western"><surname>Koscova</surname> <given-names>Z</given-names></name>, <name name-style="western"><surname>Vargova</surname> <given-names>E</given-names></name>, <name name-style="western"><surname>Viscor</surname> <given-names>I</given-names></name>, <etal>et al</etal>. <chapter-title>Classification of heart murmurs using an ensemble of residual CNNs</chapter-title>. In: <source>2022 Computing in Cardiology (CinC)</source>. vol. <volume>49</volume>. <publisher-name>IEEE</publisher-name>; <year>2022</year>. p. <fpage>1</fpage>–<lpage>4</lpage>.</mixed-citation>
</ref>
<ref id="pdig.0000324.ref028">
<label>28</label>
<mixed-citation publication-type="book" xlink:type="simple">
<name name-style="western"><surname>Summerton</surname> <given-names>S</given-names></name>, <name name-style="western"><surname>Wood</surname> <given-names>D</given-names></name>, <name name-style="western"><surname>Murphy</surname> <given-names>D</given-names></name>, <name name-style="western"><surname>Redfern</surname> <given-names>O</given-names></name>, <name name-style="western"><surname>Benatan</surname> <given-names>M</given-names></name>, <name name-style="western"><surname>Kaisti</surname> <given-names>M</given-names></name>, <etal>et al</etal>. <chapter-title>Two-stage Detection of Murmurs from Phonocardiograms using Deep and One-class Methods</chapter-title>. In: <source>2022 Computing in Cardiology (CinC)</source>. vol. <volume>49</volume>. <publisher-name>IEEE</publisher-name>; <year>2022</year>. p. <fpage>1</fpage>–<lpage>4</lpage>.</mixed-citation>
</ref>
<ref id="pdig.0000324.ref029">
<label>29</label>
<mixed-citation publication-type="book" xlink:type="simple">
<name name-style="western"><surname>Bai</surname> <given-names>Z</given-names></name>, <name name-style="western"><surname>Yan</surname> <given-names>B</given-names></name>, <name name-style="western"><surname>Chen</surname> <given-names>X</given-names></name>, <name name-style="western"><surname>Wu</surname> <given-names>Y</given-names></name>, <name name-style="western"><surname>Wang</surname> <given-names>P</given-names></name>. <chapter-title>Murmur Detection and Clinical Outcome Classification Using a VGG-like Network and Combined Time-Frequency Representations of PCG Signals</chapter-title>. In: <source>2022 Computing in Cardiology (CinC)</source>. vol. <volume>49</volume>. <publisher-name>IEEE</publisher-name>; <year>2022</year>. p. <fpage>1</fpage>–<lpage>4</lpage>.</mixed-citation>
</ref>
<ref id="pdig.0000324.ref030">
<label>30</label>
<mixed-citation publication-type="book" xlink:type="simple">
<name name-style="western"><surname>Rohr</surname> <given-names>M</given-names></name>, <name name-style="western"><surname>Müller</surname> <given-names>B</given-names></name>, <name name-style="western"><surname>Dill</surname> <given-names>S</given-names></name>, <name name-style="western"><surname>Güney</surname> <given-names>G</given-names></name>, <name name-style="western"><surname>Antink</surname> <given-names>CH</given-names></name>. <chapter-title>Two-Stage Multitask-Learner for PCG Murmur Location Detection</chapter-title>. In: <source>2022 Computing in Cardiology (CinC)</source>. vol. <volume>49</volume>. <publisher-name>IEEE</publisher-name>; <year>2022</year>. p. <fpage>1</fpage>–<lpage>4</lpage>.</mixed-citation>
</ref>
<ref id="pdig.0000324.ref031">
<label>31</label>
<mixed-citation publication-type="book" xlink:type="simple">
<name name-style="western"><surname>Ballas</surname> <given-names>A</given-names></name>, <name name-style="western"><surname>Papapanagiotou</surname> <given-names>V</given-names></name>, <name name-style="western"><surname>Delopoulis</surname> <given-names>A</given-names></name>, <name name-style="western"><surname>Diou</surname> <given-names>C</given-names></name>. <chapter-title>Listen to your heart: A self-supervised approach for detecting murmur in heart-beat sounds</chapter-title>. In: <source>2022 Computing in Cardiology (CinC)</source>. vol. <volume>49</volume>. <publisher-name>IEEE</publisher-name>; <year>2022</year>. p. <fpage>1</fpage>–<lpage>4</lpage>.</mixed-citation>
</ref>
<ref id="pdig.0000324.ref032">
<label>32</label>
<mixed-citation publication-type="book" xlink:type="simple">
<name name-style="western"><surname>WEN</surname> <given-names>H</given-names></name>, <name name-style="western"><surname>Kang</surname> <given-names>J</given-names></name>. <chapter-title>Searching for Effective Neural Network Architectures for Heart Murmur Detection from Phonocardiogram</chapter-title>. In: <source>2022 Computing in Cardiology (CinC)</source>. vol. <volume>49</volume>. <publisher-name>IEEE</publisher-name>; <year>2022</year>. p. <fpage>1</fpage>–<lpage>4</lpage>.</mixed-citation>
</ref>
<ref id="pdig.0000324.ref033">
<label>33</label>
<mixed-citation publication-type="book" xlink:type="simple">
<name name-style="western"><surname>Costa</surname> <given-names>J</given-names></name>, <name name-style="western"><surname>Rodrigues</surname> <given-names>R</given-names></name>, <name name-style="western"><surname>Couto</surname> <given-names>P</given-names></name>. <chapter-title>Multitask and Transfer Learning for Murmur Detection in Heart Sounds</chapter-title>. In: <source>2022 Computing in Cardiology (CinC)</source>. vol. <volume>49</volume>. <publisher-name>IEEE</publisher-name>; <year>2022</year>. p. <fpage>1</fpage>–<lpage>4</lpage>.</mixed-citation>
</ref>
<ref id="pdig.0000324.ref034">
<label>34</label>
<mixed-citation publication-type="book" xlink:type="simple">
<name name-style="western"><surname>Knorr</surname> <given-names>M</given-names></name>, <name name-style="western"><surname>Bremer</surname> <given-names>J</given-names></name>, <name name-style="western"><surname>Schnabel</surname> <given-names>R</given-names></name>. <chapter-title>Using Mel-Spectrograms and 2D-CNNs to detect Murmurs in Variable Length Phonocardiograms</chapter-title>. In: <source>2022 Computing in Cardiology (CinC)</source>. vol. <volume>49</volume>. <publisher-name>IEEE</publisher-name>; <year>2022</year>. p. <fpage>1</fpage>–<lpage>4</lpage>.</mixed-citation>
</ref>
<ref id="pdig.0000324.ref035">
<label>35</label>
<mixed-citation publication-type="book" xlink:type="simple">
<name name-style="western"><surname>Araujo</surname> <given-names>M</given-names></name>, <name name-style="western"><surname>Zeng</surname> <given-names>D</given-names></name>, <name name-style="western"><surname>Palotti</surname> <given-names>J</given-names></name>, <name name-style="western"><surname>Hu</surname> <given-names>X</given-names></name>, <name name-style="western"><surname>Shi</surname> <given-names>Y</given-names></name>, <name name-style="western"><surname>Pyles</surname> <given-names>L</given-names></name>, <etal>et al</etal>. <chapter-title>Maiby’s Algorithm: A Two-stage Deep Learning approach for Murmur Detection in Mel Spectrograms for Automatic Auscultation of Congenital Heart Disease</chapter-title>. In: <source>2022 Computing in Cardiology (CinC)</source>. vol. <volume>49</volume>. <publisher-name>IEEE</publisher-name>; <year>2022</year>. p. <fpage>1</fpage>–<lpage>4</lpage>.</mixed-citation>
</ref>
<ref id="pdig.0000324.ref036">
<label>36</label>
<mixed-citation publication-type="book" xlink:type="simple">
<name name-style="western"><surname>Xia</surname> <given-names>P</given-names></name>, <name name-style="western"><surname>Yao</surname> <given-names>Y</given-names></name>, <name name-style="western"><surname>Liu</surname> <given-names>C</given-names></name>, <name name-style="western"><surname>Zhang</surname> <given-names>H</given-names></name>, <name name-style="western"><surname>Wang</surname> <given-names>Y</given-names></name>, <name name-style="western"><surname>Xu</surname> <given-names>L</given-names></name>, <etal>et al</etal>. <chapter-title>Heart Murmur Detection from Phonocardiogram Based on Residual Neural Network with Classes Distinguished Focal Loss</chapter-title>. In: <source>2022 Computing in Cardiology (CinC)</source>. vol. <volume>49</volume>. <publisher-name>IEEE</publisher-name>; <year>2022</year>. p. <fpage>1</fpage>–<lpage>4</lpage>.</mixed-citation>
</ref>
<ref id="pdig.0000324.ref037">
<label>37</label>
<mixed-citation publication-type="book" xlink:type="simple">
<name name-style="western"><surname>Venkataramani</surname> <given-names>VV</given-names></name>, <name name-style="western"><surname>Garg</surname> <given-names>A</given-names></name>, <name name-style="western"><surname>Priyakumar</surname> <given-names>UD</given-names></name>. <chapter-title>Modified Variable Kernel Length ResNets for Heart Murmur Detection and Clinical Outcome Prediction using Multi-positional Phonocardiogram Recording</chapter-title>. In: <source>2022 Computing in Cardiology (CinC)</source>. vol. <volume>49</volume>. <publisher-name>IEEE</publisher-name>; <year>2022</year>. p. <fpage>1</fpage>–<lpage>4</lpage>.</mixed-citation>
</ref>
<ref id="pdig.0000324.ref038">
<label>38</label>
<mixed-citation publication-type="book" xlink:type="simple">
<name name-style="western"><surname>Chang</surname> <given-names>Y</given-names></name>, <name name-style="western"><surname>Liu</surname> <given-names>L</given-names></name>, <name name-style="western"><surname>Antonescu</surname> <given-names>C</given-names></name>. <chapter-title>Multi-Task Prediction of Murmur and Outcome from Heart Sound Recordings</chapter-title>. In: <source>2022 Computing in Cardiology (CinC)</source>. vol. <volume>49</volume>. <publisher-name>IEEE</publisher-name>; <year>2022</year>. p. <fpage>1</fpage>–<lpage>4</lpage>.</mixed-citation>
</ref>
<ref id="pdig.0000324.ref039">
<label>39</label>
<mixed-citation publication-type="book" xlink:type="simple">
<name name-style="western"><surname>Kim</surname> <given-names>J</given-names></name>, <name name-style="western"><surname>Park</surname> <given-names>G</given-names></name>, <name name-style="western"><surname>Suh</surname> <given-names>B</given-names></name>. <chapter-title>Classification of Phonocardiogram Recordings using Vision Transformer Architecture</chapter-title>. In: <source>2022 Computing in Cardiology (CinC)</source>. vol. <volume>49</volume>. <publisher-name>IEEE</publisher-name>; <year>2022</year>. p. <fpage>1</fpage>–<lpage>4</lpage>.</mixed-citation>
</ref>
<ref id="pdig.0000324.ref040">
<label>40</label>
<mixed-citation publication-type="book" xlink:type="simple">
<name name-style="western"><surname>Shin</surname> <given-names>JM</given-names></name>, <name name-style="western"><surname>Kim</surname> <given-names>HS</given-names></name>, <name name-style="western"><surname>Seo</surname> <given-names>WY</given-names></name>, <name name-style="western"><surname>Kim</surname> <given-names>SH</given-names></name>. <chapter-title>Learning Time-Frequency Representations of Phonocardiogram for Murmur Detection</chapter-title>. In: <source>2022 Computing in Cardiology (CinC)</source>. vol. <volume>49</volume>. <publisher-name>IEEE</publisher-name>; <year>2022</year>. p. <fpage>1</fpage>–<lpage>4</lpage>.</mixed-citation>
</ref>
<ref id="pdig.0000324.ref041">
<label>41</label>
<mixed-citation publication-type="book" xlink:type="simple">
<name name-style="western"><surname>Peng</surname> <given-names>G</given-names></name>, <name name-style="western"><surname>Zou</surname> <given-names>H</given-names></name>, <name name-style="western"><surname>Wang</surname> <given-names>J</given-names></name>. <chapter-title>Classification of phonocardiograms using residual convolutional neural network and MLP</chapter-title>. In: <source>2022 Computing in Cardiology (CinC)</source>. vol. <volume>49</volume>. <publisher-name>IEEE</publisher-name>; <year>2022</year>. p. <fpage>1</fpage>–<lpage>4</lpage>.</mixed-citation>
</ref>
<ref id="pdig.0000324.ref042">
<label>42</label>
<mixed-citation publication-type="book" xlink:type="simple">
<name name-style="western"><surname>Petrolis</surname> <given-names>R</given-names></name>, <name name-style="western"><surname>Paukstaitiene</surname> <given-names>R</given-names></name>, <name name-style="western"><surname>Rudokaite</surname> <given-names>G</given-names></name>, <name name-style="western"><surname>Macas</surname> <given-names>A</given-names></name>, <name name-style="western"><surname>Grigaliunas</surname> <given-names>A</given-names></name>, <name name-style="western"><surname>Krisciukaitis</surname> <given-names>A</given-names></name>. <chapter-title>Convolutional neural network aproach for heart MurMur detection in auscultation signals using wavelet transform based features</chapter-title>. In: <source>2022 Computing in Cardiology (CinC)</source>. vol. <volume>49</volume>. <publisher-name>IEEE</publisher-name>; <year>2022</year>. p. <fpage>1</fpage>–<lpage>4</lpage>.</mixed-citation>
</ref>
<ref id="pdig.0000324.ref043">
<label>43</label>
<mixed-citation publication-type="book" xlink:type="simple">
<name name-style="western"><surname>Gemke</surname> <given-names>P</given-names></name>, <name name-style="western"><surname>Spicher</surname> <given-names>N</given-names></name>, <name name-style="western"><surname>Kacprowski</surname> <given-names>T</given-names></name>. <chapter-title>An LSTM-based Listener for Early Detection of Heart Disease</chapter-title>. In: <source>2022 Computing in Cardiology (CinC)</source>. vol. <volume>49</volume>. <publisher-name>IEEE</publisher-name>; <year>2022</year>. p. <fpage>1</fpage>–<lpage>4</lpage>.</mixed-citation>
</ref>
<ref id="pdig.0000324.ref044">
<label>44</label>
<mixed-citation publication-type="book" xlink:type="simple">
<name name-style="western"><surname>Hu</surname> <given-names>L</given-names></name>, <name name-style="western"><surname>Cai</surname> <given-names>W</given-names></name>, <name name-style="western"><surname>Li</surname> <given-names>X</given-names></name>, <name name-style="western"><surname>Li</surname> <given-names>J</given-names></name>. <chapter-title>Detection of murmurs from heart sound recordings with deep residual networks</chapter-title>. In: <source>2022 Computing in Cardiology (CinC)</source>. vol. <volume>49</volume>. <publisher-name>IEEE</publisher-name>; <year>2022</year>. p. <fpage>1</fpage>–<lpage>4</lpage>.</mixed-citation>
</ref>
<ref id="pdig.0000324.ref045">
<label>45</label>
<mixed-citation publication-type="book" xlink:type="simple">
<name name-style="western"><surname>Warrick</surname> <given-names>P</given-names></name>, <name name-style="western"><surname>Afilalo</surname> <given-names>J</given-names></name>. <chapter-title>Phonocardiographic Murmur Detection by Scattering-Recurrent Networks</chapter-title>. In: <source>2022 Computing in Cardiology (CinC)</source>. vol. <volume>49</volume>. <publisher-name>IEEE</publisher-name>; <year>2022</year>. p. <fpage>1</fpage>–<lpage>4</lpage>.</mixed-citation>
</ref>
<ref id="pdig.0000324.ref046">
<label>46</label>
<mixed-citation publication-type="book" xlink:type="simple">
<name name-style="western"><surname>Imran</surname> <given-names>Z</given-names></name>, <name name-style="western"><surname>Grooby</surname> <given-names>E</given-names></name>, <name name-style="western"><surname>Sitaula</surname> <given-names>C</given-names></name>, <name name-style="western"><surname>Malgi</surname> <given-names>V</given-names></name>, <name name-style="western"><surname>Aryal</surname> <given-names>S</given-names></name>, <name name-style="western"><surname>Marzbanrad</surname> <given-names>F</given-names></name>. <chapter-title>A Fusion of Handcrafted Features and Deep Learning Classifiers for Heart Murmur Detection</chapter-title>. In: <source>2022 Computing in Cardiology (CinC)</source>. vol. <volume>49</volume>. <publisher-name>IEEE</publisher-name>; <year>2022</year>. p. <fpage>1</fpage>–<lpage>4</lpage>.</mixed-citation>
</ref>
<ref id="pdig.0000324.ref047">
<label>47</label>
<mixed-citation publication-type="book" xlink:type="simple">
<name name-style="western"><surname>Wang</surname> <given-names>X</given-names></name>, <name name-style="western"><surname>Fan</surname> <given-names>F</given-names></name>, <name name-style="western"><surname>Gao</surname> <given-names>H</given-names></name>, <name name-style="western"><surname>Zhang</surname> <given-names>S</given-names></name>, <name name-style="western"><surname>Yang</surname> <given-names>C</given-names></name>, <name name-style="western"><surname>Li</surname> <given-names>J</given-names></name>, <etal>et al</etal>. <chapter-title>Beat-wise uncertainty learning for murmur detection in heart sounds</chapter-title>. In: <source>2022 Computing in Cardiology (CinC)</source>. vol. <volume>49</volume>. <publisher-name>IEEE</publisher-name>; <year>2022</year>. p. <fpage>1</fpage>–<lpage>4</lpage>.</mixed-citation>
</ref>
<ref id="pdig.0000324.ref048">
<label>48</label>
<mixed-citation publication-type="book" xlink:type="simple">
<name name-style="western"><surname>Singstad</surname> <given-names>BJ</given-names></name>, <name name-style="western"><surname>Bongo</surname> <given-names>L</given-names></name>, <name name-style="western"><surname>Johnsen</surname> <given-names>M</given-names></name>, <name name-style="western"><surname>Ravn</surname> <given-names>J</given-names></name>, <name name-style="western"><surname>Gitau</surname> <given-names>A</given-names></name>, <name name-style="western"><surname>Schirmer</surname> <given-names>H</given-names></name>. <chapter-title>Phonocardiogram Classification Using 1-Dimensional Inception Time Convolutional Neural Networks</chapter-title>. In: <source>2022 Computing in Cardiology (CinC)</source>. vol. <volume>49</volume>. <publisher-name>IEEE</publisher-name>; <year>2022</year>. p. <fpage>1</fpage>–<lpage>4</lpage>.</mixed-citation>
</ref>
<ref id="pdig.0000324.ref049">
<label>49</label>
<mixed-citation publication-type="book" xlink:type="simple">
<name name-style="western"><surname>Choi</surname> <given-names>S</given-names></name>, <name name-style="western"><surname>Seo</surname> <given-names>HC</given-names></name>, <name name-style="western"><surname>Choi</surname> <given-names>K</given-names></name>, <name name-style="western"><surname>Yoon</surname> <given-names>G</given-names></name>, <name name-style="western"><surname>Joo</surname> <given-names>S</given-names></name>. <chapter-title>Murmur Classification with U-net State Prediction</chapter-title>. In: <source>2022 Computing in Cardiology (CinC)</source>. vol. <volume>49</volume>. <publisher-name>IEEE</publisher-name>; <year>2022</year>. p. <fpage>1</fpage>–<lpage>4</lpage>.</mixed-citation>
</ref>
<ref id="pdig.0000324.ref050">
<label>50</label>
<mixed-citation publication-type="book" xlink:type="simple">
<name name-style="western"><surname>Li</surname> <given-names>X</given-names></name>, <name name-style="western"><surname>Schlindwein</surname> <given-names>F</given-names></name>, <name name-style="western"><surname>Ng</surname> <given-names>GA</given-names></name>. <chapter-title>Transfer Learning in Heart Sound Classification using Mel spectrogram</chapter-title>. In: <source>2022 Computing in Cardiology (CinC)</source>. vol. <volume>49</volume>. <publisher-name>IEEE</publisher-name>; <year>2022</year>. p. <fpage>1</fpage>–<lpage>4</lpage>.</mixed-citation>
</ref>
<ref id="pdig.0000324.ref051">
<label>51</label>
<mixed-citation publication-type="book" xlink:type="simple">
<name name-style="western"><surname>Cornely</surname> <given-names>A</given-names></name>, <name name-style="western"><surname>Mirsky</surname> <given-names>G</given-names></name>. <chapter-title>Heart Murmur Detection Using Wavelet Time Scattering and Support Vector Machines</chapter-title>. In: <source>2022 Computing in Cardiology (CinC)</source>. vol. <volume>49</volume>. <publisher-name>IEEE</publisher-name>; <year>2022</year>. p. <fpage>1</fpage>–<lpage>4</lpage>.</mixed-citation>
</ref>
<ref id="pdig.0000324.ref052">
<label>52</label>
<mixed-citation publication-type="book" xlink:type="simple">
<name name-style="western"><surname>Gao</surname> <given-names>Y</given-names></name>, <name name-style="western"><surname>Qiao</surname> <given-names>L</given-names></name>, <name name-style="western"><surname>Li</surname> <given-names>Z</given-names></name>. <chapter-title>Heart Murmur Detection of PCG Using ResNet with Selective Kernel Convolution</chapter-title>. In: <source>2022 Computing in Cardiology (CinC)</source>. vol. <volume>49</volume>. <publisher-name>IEEE</publisher-name>; <year>2022</year>. p. <fpage>1</fpage>–<lpage>4</lpage>.</mixed-citation>
</ref>
<ref id="pdig.0000324.ref053">
<label>53</label>
<mixed-citation publication-type="book" xlink:type="simple">
<name name-style="western"><surname>Ding</surname> <given-names>J</given-names></name>, <name name-style="western"><surname>Li</surname> <given-names>JJ</given-names></name>, <name name-style="western"><surname>Xu</surname> <given-names>M</given-names></name>. <chapter-title>Classification of Murmurs in PCG Using Combined Frequency Domain and Physician Inspired Features</chapter-title>. In: <source>2022 Computing in Cardiology (CinC)</source>. vol. <volume>49</volume>. <publisher-name>IEEE</publisher-name>; <year>2022</year>. p. <fpage>1</fpage>–<lpage>4</lpage>.</mixed-citation>
</ref>
<ref id="pdig.0000324.ref054">
<label>54</label>
<mixed-citation publication-type="book" xlink:type="simple">
<name name-style="western"><surname>Jalali</surname> <given-names>K</given-names></name>, <name name-style="western"><surname>Saket</surname> <given-names>MA</given-names></name>, <name name-style="western"><surname>Noorzadeh</surname> <given-names>S</given-names></name>. <chapter-title>Heart Murmur Detection and Clinical Outcome Prediction using Multilayer Perceptron Classifier</chapter-title>. In: <source>2022 Computing in Cardiology (CinC)</source>. vol. <volume>49</volume>. <publisher-name>IEEE</publisher-name>; <year>2022</year>. p. <fpage>1</fpage>–<lpage>4</lpage>.</mixed-citation>
</ref>
<ref id="pdig.0000324.ref055">
<label>55</label>
<mixed-citation publication-type="book" xlink:type="simple">
<name name-style="western"><surname>Stein</surname> <given-names>G</given-names></name>, <name name-style="western"><surname>Festag</surname> <given-names>S</given-names></name>, <name name-style="western"><surname>Büchner</surname> <given-names>T</given-names></name>, <name name-style="western"><surname>Shadaydeh</surname> <given-names>M</given-names></name>, <name name-style="western"><surname>Denzler</surname> <given-names>J</given-names></name>, <name name-style="western"><surname>Spreckelsen</surname> <given-names>C</given-names></name>. <chapter-title>Outcome Prediction and Murmur Detection in Sets of Phonocardiograms by a Deep Learning-Based Ensemble Approach</chapter-title>. In: <source>2022 Computing in Cardiology (CinC)</source>. vol. <volume>49</volume>. <publisher-name>IEEE</publisher-name>; <year>2022</year>. p. <fpage>1</fpage>–<lpage>4</lpage>.</mixed-citation>
</ref>
<ref id="pdig.0000324.ref056">
<label>56</label>
<mixed-citation publication-type="book" xlink:type="simple">
<name name-style="western"><surname>Rudman</surname> <given-names>W</given-names></name>, <name name-style="western"><surname>Merullo</surname> <given-names>J</given-names></name>, <name name-style="western"><surname>Mercurio</surname> <given-names>L</given-names></name>, <name name-style="western"><surname>Eickhoff</surname> <given-names>C</given-names></name>. <chapter-title>ACQuA: Anomaly Classification with Quasi-Attractors</chapter-title>. In: <source>2022 Computing in Cardiology (CinC)</source>. vol. <volume>49</volume>. <publisher-name>IEEE</publisher-name>; <year>2022</year>. p. <fpage>1</fpage>–<lpage>4</lpage>.</mixed-citation>
</ref>
<ref id="pdig.0000324.ref057">
<label>57</label>
<mixed-citation publication-type="book" xlink:type="simple">
<name name-style="western"><surname>Fan</surname> <given-names>P</given-names></name>, <name name-style="western"><surname>Shu</surname> <given-names>Y</given-names></name>, <name name-style="western"><surname>Han</surname> <given-names>Y</given-names></name>. <chapter-title>Transformer embedded with learnable filters for heart murmur detection</chapter-title>. In: <source>2022 Computing in Cardiology (CinC)</source>. vol. <volume>49</volume>. <publisher-name>IEEE</publisher-name>; <year>2022</year>. p. <fpage>1</fpage>–<lpage>4</lpage>.</mixed-citation>
</ref>
<ref id="pdig.0000324.ref058">
<label>58</label>
<mixed-citation publication-type="book" xlink:type="simple">
<name name-style="western"><surname>Bondareva</surname> <given-names>E</given-names></name>, <name name-style="western"><surname>Han</surname> <given-names>J</given-names></name>, <name name-style="western"><surname>Xia</surname> <given-names>T</given-names></name>, <name name-style="western"><surname>Mascolo</surname> <given-names>C</given-names></name>. <chapter-title>Towards Uncertainty-Aware Murmur Detection in Heart Sounds via Tandem Learning</chapter-title>. In: <source>2022 Computing in Cardiology (CinC)</source>. vol. <volume>49</volume>. <publisher-name>IEEE</publisher-name>; <year>2022</year>. p. <fpage>1</fpage>–<lpage>4</lpage>.</mixed-citation>
</ref>
<ref id="pdig.0000324.ref059">
<label>59</label>
<mixed-citation publication-type="book" xlink:type="simple">
<name name-style="western"><surname>Clifford</surname> <given-names>GD</given-names></name>, <name name-style="western"><surname>Liu</surname> <given-names>C</given-names></name>, <name name-style="western"><surname>Moody</surname> <given-names>B</given-names></name>, <name name-style="western"><surname>Lehman</surname> <given-names>LwH</given-names></name>, <name name-style="western"><surname>Silva</surname> <given-names>I</given-names></name>, <name name-style="western"><surname>Li</surname> <given-names>Q</given-names></name>, <etal>et al</etal>. <chapter-title>AF Classification from a Short Single Lead ECG Recording: the PhysioNet/Computing in Cardiology Challenge 2017</chapter-title>. In: <source>2017 Computing in Cardiology (CinC)</source>. vol. <volume>44</volume>. <publisher-name>IEEE</publisher-name>; <year>2017</year>. p. <fpage>1</fpage>–<lpage>4</lpage>.</mixed-citation>
</ref>
</ref-list>
</back>
<sub-article article-type="aggregated-review-documents" id="pdig.0000324.r001" specific-use="decision-letter">
<front-stub>
<article-id pub-id-type="doi">10.1371/journal.pdig.0000324.r001</article-id>
<title-group>
<article-title>Decision Letter 0</article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name name-style="western">
<surname>Celi</surname>
<given-names>Leo Anthony</given-names>
</name>
<role>Editor-In-Chief</role>
</contrib>
</contrib-group>
<permissions>
<copyright-year>2023</copyright-year>
<copyright-holder>Leo Anthony Celi</copyright-holder>
<license xlink:href="http://creativecommons.org/licenses/by/4.0/">
<license-p>This is an open access article distributed under the terms of the <ext-link ext-link-type="uri" xlink:href="http://creativecommons.org/licenses/by/4.0/" xlink:type="simple">Creative Commons Attribution License</ext-link>, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.</license-p>
</license>
</permissions>
<related-object document-id="10.1371/journal.pdig.0000324" document-id-type="doi" document-type="article" id="rel-obj001" link-type="peer-reviewed-article"/>
<custom-meta-group>
<custom-meta>
<meta-name>Submission Version</meta-name>
<meta-value>0</meta-value>
</custom-meta>
</custom-meta-group>
</front-stub>
<body>
<p>
<named-content content-type="letter-date">19 May 2023</named-content>
</p>
<p>PDIG-D-23-00131</p>
<p>Heart murmur detection from phonocardiogram recordings: The George B. Moody PhysioNet Challenge 2022</p>
<p>PLOS Digital Health</p>
<p>Dear Dr. Reyna,</p>
<p>Thank you for submitting your manuscript to PLOS Digital Health. After careful consideration, we feel that it has merit but does not fully meet PLOS Digital Health's publication criteria as it currently stands. Therefore, we invite you to submit a revised version of the manuscript that addresses the points raised during the review process.</p>
<p>Please submit your revised manuscript within 30 days Jul 18 2023 11:59PM. If you will need more time than this to complete your revisions, please reply to this message or contact the journal office at <email xlink:type="simple">digitalhealth@plos.org</email>. When you're ready to submit your revision, log on to <ext-link ext-link-type="uri" xlink:href="https://www.editorialmanager.com/pdig/" xlink:type="simple">https://www.editorialmanager.com/pdig/</ext-link> and select the 'Submissions Needing Revision' folder to locate your manuscript file.</p>
<p>Please include the following items when submitting your revised manuscript:</p>
<p>* A rebuttal letter that responds to each point raised by the editor and reviewer(s). You should upload this letter as a separate file labeled 'Response to Reviewers'.</p>
<p>* A marked-up copy of your manuscript that highlights changes made to the original version. You should upload this as a separate file labeled 'Revised Manuscript with Track Changes'.</p>
<p>* An unmarked version of your revised paper without tracked changes. You should upload this as a separate file labeled 'Manuscript'.</p>
<p>If you would like to make changes to your financial disclosure, please include your updated statement in your cover letter. Guidelines for resubmitting your figure files are available below the reviewer comments at the end of this letter.</p>
<p>We look forward to receiving your revised manuscript.</p>
<p>Kind regards,</p>
<p>Leo Anthony Celi, MD MS MPH</p>
<p>Editor-In-Chief</p>
<p>PLOS Digital Health</p>
<p>Journal Requirements:</p>
<p>1. Please review your reference list to ensure that it is complete and correct. If you have cited papers that have been retracted, please include the rationale for doing so in the manuscript text, or remove these references and replace them with relevant current references. Any changes to the reference list should be mentioned in the rebuttal letter that accompanies your revised manuscript. If you need to cite a retracted article, indicate the article's retracted status in the References list and also include a citation and full reference for the retraction notice.</p>
<p>2. Please send a completed 'Competing Interests' statement, including any COIs declared by your co-authors. If you have no competing interests to declare, please state "The authors have declared that no competing interests exist". Otherwise please declare all competing interests beginning with twhe statement "I have read the journal's policy and the authors of this manuscript have the following competing interests:"</p>
<p>Additional Editor Comments (if provided):</p>
<p>[Note: HTML markup is below. Please do not edit.]</p>
<p>Reviewers' comments:</p>
<p>Reviewer's Responses to Questions</p>
<p><!-- <font color="black"> --><bold>Comments to the Author</bold></p>
<p>1. Does this manuscript meet PLOS Digital Health’s <ext-link ext-link-type="uri" xlink:href="https://journals.plos.org/digitalhealth/s/journal-information#loc-criteria-for-publication" xlink:type="simple">publication criteria</ext-link>? Is the manuscript technically sound, and do the data support the conclusions? The manuscript must describe methodologically and ethically rigorous research with conclusions that are appropriately drawn based on the data presented.</p>
<p>Reviewer #1: Yes</p>
<p>Reviewer #2: Yes</p>
<p>--------------------</p>
<p><!-- <font color="black"> -->2. Has the statistical analysis been performed appropriately and rigorously?<!-- </font> --></p>
<p>Reviewer #1: Yes</p>
<p>Reviewer #2: Yes</p>
<p>--------------------</p>
<p><!-- <font color="black"> -->3. Have the authors made all data underlying the findings in their manuscript fully available (please refer to the Data Availability Statement at the start of the manuscript PDF file)?</p>
<p> The <ext-link ext-link-type="uri" xlink:href="https://journals.plos.org/digitalhealth/s/data-availability" xlink:type="simple">PLOS Data policy</ext-link> requires authors to make all data underlying the findings described in their manuscript fully available without restriction, with rare exception. The data should be provided as part of the manuscript or its supporting information, or deposited to a public repository. For example, in addition to summary statistics, the data points behind means, medians and variance measures should be available. If there are restrictions on publicly sharing data—e.g. participant privacy or use of data from a third party—those must be specified.<!-- </font> --></p>
<p>Reviewer #1: Yes</p>
<p>Reviewer #2: Yes</p>
<p>--------------------</p>
<p><!-- <font color="black"> -->4. Is the manuscript presented in an intelligible fashion and written in standard English?</p>
<p>PLOS Digital Health does not copyedit accepted manuscripts, so the language in submitted articles must be clear, correct, and unambiguous. Any typographical or grammatical errors should be corrected at revision, so please note any specific errors here.<!-- </font> --></p>
<p>Reviewer #1: Yes</p>
<p>Reviewer #2: Yes</p>
<p>--------------------</p>
<p><!-- <font color="black"> -->5. Review Comments to the Author</p>
<p>Please use the space provided to explain your answers to the questions above. You may also include additional comments for the author, including concerns about dual publication, research ethics, or publication ethics. (Please upload your review as an attachment if it exceeds 20,000 characters)<!-- </font> --></p>
<p>Reviewer #1: The manuscript presents results from the “Heart murmur detection from phonocardiogram recordings: The George B. Moody PhysioNet Challenge 2022”. It is well written and easy to follow. The manuscript uses up to date references; which are all well linked within the document. All reference materials have been provided.</p>
<p>However, the following could be addressed.</p>
<p>- The abstract is great, but consider adding a paragraph about the results (submitted algorithms) from the challenge. The abstract presents the background information; and how the challenge was conducted, but is very silent about the results (which algorithm performed best from the challenge). You might also consider mentioning the aim of this opinion paper in the abstract, to provide a reader with the general picture of the paper.</p>
<p>- The usage of the phrase “This year’s challenge” appears misleading in some paragraphs. May be consider using “The 2022 year’s challenge”; so that it is easy for the reader not to confuse it with the current year.</p>
<p>- The paragraph “while algorithms that did not learn from the training set performed the same or better” on page 12/24 is incomplete.</p>
<p>- The paragraph “requires monitoring and/or intervention” on page 14/24 is incomplete.</p>
<p>- Check paragraph “models and k = 2 for the RF models.” on page 13/24</p>
<p>Reviewer #2: Thank you for the opportunity to review this interesting manuscript. This purpose of the paper was to report findings from The 2022 George B. Moody PhysioNet Challenge (formerly the PhysioNet/Computing in Cardiology Challenge). This challenge invited teams to develop fully automated approaches for detecting heart murmurs and abnormal cardiac function from PCG recordings. The investigators sourced and shared PCG recordings for up to four auscultation locations from a largely pediatric population in Brazil, and teams were asked to identify both heart murmurs and the clinical outcomes of a full diagnostic screening from the recordings. The Challenge explored the diagnostic potential of algorithmic approaches for interpreting PCG recordings. Below are suggestions designed to enhance the readability, clinical understanding and reproducibility of this already well written manuscript. </p>
<p>The format of the paper made it much easier to review this manuscript – thank you. </p>
<p>Title – consider adding “Pediatric” to the title. </p>
<p>Perhaps this was missed by the reviewer, but I did not see key words, are they required?</p>
<p>A limitation of this paper is that the sample was not clearly described. The authors state that the PCG recording were from pediatric patients, yet pregnant individuals were mentioned as having contributed recordings. One might assume if pregnant women were included the PCG recording were obtained from a fetus on the abdomen of the mother? Among pediatric patients one might assume the PCG recordings were obtain from the child’s chest? How might this impact recordings (chest vs abdomen) is this is how the PCG was recorded? </p>
<p>While it may be outside of the scope of this paper one would also imagine that PCG recordings are impacted by heart rate, which in pediatric patients (in your study you included Neonate (birth to 27 days), Infant (28 days to 1 year), Child (1 to 11 years), Adolescent (12 to 18 years), or fetus, in the case of pregnant individuals, which would be very challenging since heart rate is so fast in younger children. Was heart rate considered or accounted for? Again, this may not be appropriate to discuss in this paper, but could be mentioned. </p>
<p>In the Introduction, second sentence the term “technology is used. Yet a stethoscope is a device, which may be a more appropriate term.</p>
<p>Introduction second paragraph – the statements regarding “within the valves” is not entirely accurate. Suggest using “around,” rather than “within” as blood flow is disrupted around an incompetent valve. The authors may want to delete the statement “…..and by the turbulence of blood flow within the valves” in the first sentence and end it after “….cardiac cycle.” Then make the suggested adjustment in the next sentence with refers to the pathology.  </p>
<p>Figure 1 – the AV and PV locations are both at the location of the second intercostal space yet the image shows them slightly off, suggesting that the PV is in the third intercostal space. </p>
<p>Page 4 second paragraph – Consider adding (described below) to the sentence “Each patient’s PCGs and clinical notes were also annotated for murmurs.” This addition would help the reader understand that this description will be discussed further down in the paper.</p>
<p>Can “resource constrained” be defined i.e., rural vs urban, socioeconomic etc. this was not entirely clear.  </p>
<p>Page 6 sentence that reads “………………important issue in the Section .” seem to be missing the section #. </p>
<p>For the text description for Figures 3 and 4 consider bolding the text for “per-patient” and “per-screening” to add clarity to the description.</p>
<p>--------------------</p>
<p><!-- <font color="black"> -->6. PLOS authors have the option to publish the peer review history of their article (<ext-link ext-link-type="uri" xlink:href="https://journals.plos.org/digitalhealth/s/editorial-and-peer-review-process#loc-peer-review-history" xlink:type="simple">what does this mean?</ext-link>). If published, this will include your full peer review and any attached files.</p>
<p><bold>Do you want your identity to be public for this peer review?</bold> If you choose “no”, your identity will remain anonymous but your review may still be made public.</p>
<p>For information about this choice, including consent withdrawal, please see our <ext-link ext-link-type="uri" xlink:href="https://www.plos.org/privacy-policy" xlink:type="simple">Privacy Policy</ext-link>.</p>
<p>Reviewer #1: Yes: Dr. Wasswa William | Mbarara University of Science and Technology</p>
<p>Reviewer #2: No</p>
<p>--------------------</p>
<p>[NOTE: If reviewer comments were submitted as an attachment file, they will be attached to this email and accessible via the submission site. Please log into your account, locate the manuscript record, and check for the action link "View Attachments". If this link does not appear, there are no attachment files.]</p>
<p>While revising your submission, please upload your figure files to the Preflight Analysis and Conversion Engine (PACE) digital diagnostic tool, <ext-link ext-link-type="uri" xlink:href="https://pacev2.apexcovantage.com/" xlink:type="simple">https://pacev2.apexcovantage.com/</ext-link>. PACE helps ensure that figures meet PLOS requirements. To use PACE, you must first register as a user. Registration is free. Then, login and navigate to the UPLOAD tab, where you will find detailed instructions on how to use the tool. If you encounter any issues or have any questions when using PACE, please email PLOS at <email xlink:type="simple">figures@plos.org</email>. Please note that Supporting Information files do not need this step.</p>
<supplementary-material id="pdig.0000324.s003" mimetype="application/pdf" position="float" xlink:href="info:doi/10.1371/journal.pdig.0000324.s003" xlink:type="simple">
<label>Attachment</label>
<caption>
<p>Submitted filename: <named-content content-type="submitted-filename">PDIG-D-23-00131_comments.pdf</named-content></p>
</caption>
</supplementary-material>
</body>
</sub-article>
<sub-article article-type="author-comment" id="pdig.0000324.r002">
<front-stub>
<article-id pub-id-type="doi">10.1371/journal.pdig.0000324.r002</article-id>
<title-group>
<article-title>Author response to Decision Letter 0</article-title>
</title-group>
<related-object document-id="10.1371/journal.pdig.0000324" document-id-type="doi" document-type="peer-reviewed-article" id="rel-obj002" link-type="rebutted-decision-letter" object-id="10.1371/journal.pdig.0000324.r001" object-id-type="doi" object-type="decision-letter"/>
<custom-meta-group>
<custom-meta>
<meta-name>Submission Version</meta-name>
<meta-value>1</meta-value>
</custom-meta>
</custom-meta-group>
</front-stub>
<body>
<p>
<named-content content-type="author-response-date">23 Jun 2023</named-content>
</p>
<supplementary-material id="pdig.0000324.s004" mimetype="application/pdf" position="float" xlink:href="info:doi/10.1371/journal.pdig.0000324.s004" xlink:type="simple">
<label>Attachment</label>
<caption>
<p>Submitted filename: <named-content content-type="submitted-filename">2022 Challenge Manuscript Review Response.pdf</named-content></p>
</caption>
</supplementary-material>
</body>
</sub-article>
<sub-article article-type="editor-report" id="pdig.0000324.r003" specific-use="decision-letter">
<front-stub>
<article-id pub-id-type="doi">10.1371/journal.pdig.0000324.r003</article-id>
<title-group>
<article-title>Decision Letter 1</article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name name-style="western">
<surname>Celi</surname>
<given-names>Leo Anthony</given-names>
</name>
<role>Editor-In-Chief</role>
</contrib>
</contrib-group>
<permissions>
<copyright-year>2023</copyright-year>
<copyright-holder>Leo Anthony Celi</copyright-holder>
<license xlink:href="http://creativecommons.org/licenses/by/4.0/">
<license-p>This is an open access article distributed under the terms of the <ext-link ext-link-type="uri" xlink:href="http://creativecommons.org/licenses/by/4.0/" xlink:type="simple">Creative Commons Attribution License</ext-link>, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.</license-p>
</license>
</permissions>
<related-object document-id="10.1371/journal.pdig.0000324" document-id-type="doi" document-type="article" id="rel-obj003" link-type="peer-reviewed-article"/>
<custom-meta-group>
<custom-meta>
<meta-name>Submission Version</meta-name>
<meta-value>1</meta-value>
</custom-meta>
</custom-meta-group>
</front-stub>
<body>
<p>
<named-content content-type="letter-date">29 Jun 2023</named-content>
</p>
<p>PDIG-D-23-00131R1</p>
<p>Heart murmur detection from phonocardiogram recordings: The George B. Moody PhysioNet Challenge 2022</p>
<p>PLOS Digital Health</p>
<p>Dear Dr. Reyna,</p>
<p>Thank you for submitting your manuscript to PLOS Digital Health. After careful consideration, we feel that it has merit but does not fully meet PLOS Digital Health's publication criteria as it currently stands. Therefore, we invite you to submit a revised version of the manuscript that addresses the points raised during the review process.</p>
<p>Please submit your revised manuscript within 30 days Jul 29 2023 11:59PM. If you will need more time than this to complete your revisions, please reply to this message or contact the journal office at <email xlink:type="simple">digitalhealth@plos.org</email>. When you're ready to submit your revision, log on to <ext-link ext-link-type="uri" xlink:href="https://www.editorialmanager.com/pdig/" xlink:type="simple">https://www.editorialmanager.com/pdig/</ext-link> and select the 'Submissions Needing Revision' folder to locate your manuscript file.</p>
<p>Please include the following items when submitting your revised manuscript:</p>
<p>* A rebuttal letter that responds to each point raised by the editor and reviewer(s). You should upload this letter as a separate file labeled 'Response to Reviewers'.</p>
<p>* A marked-up copy of your manuscript that highlights changes made to the original version. You should upload this as a separate file labeled 'Revised Manuscript with Track Changes'.</p>
<p>* An unmarked version of your revised paper without tracked changes. You should upload this as a separate file labeled 'Manuscript'.</p>
<p>If you would like to make changes to your financial disclosure, please include your updated statement in your cover letter. Guidelines for resubmitting your figure files are available below the reviewer comments at the end of this letter.</p>
<p>We look forward to receiving your revised manuscript.</p>
<p>Kind regards,</p>
<p>Leo Anthony Celi, MD MS MPH</p>
<p>Editor-In-Chief</p>
<p>PLOS Digital Health</p>
<p>Journal Requirements:</p>
<p>1. Please review your reference list to ensure that it is complete and correct. If you have cited papers that have been retracted, please include the rationale for doing so in the manuscript text, or remove these references and replace them with relevant current references. Any changes to the reference list should be mentioned in the rebuttal letter that accompanies your revised manuscript. If you need to cite a retracted article, indicate the article's retracted status in the References list and also include a citation and full reference for the retraction notice.</p>
<p>2. Please send a completed 'Competing Interests' statement, including any COIs declared by your co-authors. If you have no competing interests to declare, please state "The authors have declared that no competing interests exist". Otherwise please declare all competing interests beginning with twhe statement "I have read the journal's policy and the authors of this manuscript have the following competing interests:"</p>
<p>Additional Editor Comments (if provided):</p>
<p>[Note: HTML markup is below. Please do not edit.]</p>
<p>Reviewers' comments:</p>
<p>[NOTE: If reviewer comments were submitted as an attachment file, they will be attached to this email and accessible via the submission site. Please log into your account, locate the manuscript record, and check for the action link "View Attachments". If this link does not appear, there are no attachment files.]</p>
<p>While revising your submission, please upload your figure files to the Preflight Analysis and Conversion Engine (PACE) digital diagnostic tool, <ext-link ext-link-type="uri" xlink:href="https://pacev2.apexcovantage.com/" xlink:type="simple">https://pacev2.apexcovantage.com/</ext-link>. PACE helps ensure that figures meet PLOS requirements. To use PACE, you must first register as a user. Registration is free. Then, login and navigate to the UPLOAD tab, where you will find detailed instructions on how to use the tool. If you encounter any issues or have any questions when using PACE, please email PLOS at <email xlink:type="simple">figures@plos.org</email>. Please note that Supporting Information files do not need this step.</p>
</body>
</sub-article>
<sub-article article-type="author-comment" id="pdig.0000324.r004">
<front-stub>
<article-id pub-id-type="doi">10.1371/journal.pdig.0000324.r004</article-id>
<title-group>
<article-title>Author response to Decision Letter 1</article-title>
</title-group>
<related-object document-id="10.1371/journal.pdig.0000324" document-id-type="doi" document-type="peer-reviewed-article" id="rel-obj004" link-type="rebutted-decision-letter" object-id="10.1371/journal.pdig.0000324.r003" object-id-type="doi" object-type="decision-letter"/>
<custom-meta-group>
<custom-meta>
<meta-name>Submission Version</meta-name>
<meta-value>2</meta-value>
</custom-meta>
</custom-meta-group>
</front-stub>
<body>
<p>
<named-content content-type="author-response-date">30 Jun 2023</named-content>
</p>
<supplementary-material id="pdig.0000324.s005" mimetype="application/pdf" position="float" xlink:href="info:doi/10.1371/journal.pdig.0000324.s005" xlink:type="simple">
<label>Attachment</label>
<caption>
<p>Submitted filename: <named-content content-type="submitted-filename">2022 Challenge Manuscript Review Response.pdf</named-content></p>
</caption>
</supplementary-material>
</body>
</sub-article>
<sub-article article-type="editor-report" id="pdig.0000324.r005" specific-use="decision-letter">
<front-stub>
<article-id pub-id-type="doi">10.1371/journal.pdig.0000324.r005</article-id>
<title-group>
<article-title>Decision Letter 2</article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name name-style="western">
<surname>Celi</surname>
<given-names>Leo Anthony</given-names>
</name>
<role>Editor-In-Chief</role>
</contrib>
</contrib-group>
<permissions>
<copyright-year>2023</copyright-year>
<copyright-holder>Leo Anthony Celi</copyright-holder>
<license xlink:href="http://creativecommons.org/licenses/by/4.0/">
<license-p>This is an open access article distributed under the terms of the <ext-link ext-link-type="uri" xlink:href="http://creativecommons.org/licenses/by/4.0/" xlink:type="simple">Creative Commons Attribution License</ext-link>, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.</license-p>
</license>
</permissions>
<related-object document-id="10.1371/journal.pdig.0000324" document-id-type="doi" document-type="article" id="rel-obj005" link-type="peer-reviewed-article"/>
<custom-meta-group>
<custom-meta>
<meta-name>Submission Version</meta-name>
<meta-value>2</meta-value>
</custom-meta>
</custom-meta-group>
</front-stub>
<body>
<p>
<named-content content-type="letter-date">10 Jul 2023</named-content>
</p>
<p>Heart murmur detection from phonocardiogram recordings: The George B. Moody PhysioNet Challenge 2022</p>
<p>PDIG-D-23-00131R2</p>
<p>Dear Prof. Reyna,</p>
<p>We are pleased to inform you that your manuscript 'Heart murmur detection from phonocardiogram recordings: The George B. Moody PhysioNet Challenge 2022' has been provisionally accepted for publication in PLOS Digital Health.</p>
<p>Before your manuscript can be formally accepted you will need to complete some formatting changes, which you will receive in a follow-up email from a member of our team. </p>
<p>Please note that your manuscript will not be scheduled for publication until you have made the required changes, so a swift response is appreciated.</p>
<p>IMPORTANT: The editorial review process is now complete. PLOS will only permit corrections to spelling, formatting or significant scientific errors from this point onwards. Requests for major changes, or any which affect the scientific understanding of your work, will cause delays to the publication date of your manuscript.</p>
<p>If your institution or institutions have a press office, please notify them about your upcoming paper to help maximize its impact. If they'll be preparing press materials, please inform our press team as soon as possible -- no later than 48 hours after receiving the formal acceptance. Your manuscript will remain under strict press embargo until 2 pm Eastern Time on the date of publication. For more information, please contact <email xlink:type="simple">digitalhealth@plos.org</email>.</p>
<p>Thank you again for supporting Open Access publishing; we are looking forward to publishing your work in PLOS Digital Health.</p>
<p>Best regards,</p>
<p>Leo Anthony Celi, MD MS MPH</p>
<p>Editor-In-Chief</p>
<p>PLOS Digital Health</p>
<p>***********************************************************</p>
<p>Reviewer Comments (if any, and for reference):</p>
</body>
</sub-article>
</article>