TY - GEN
T1 - Learning dependencies among fetal heart rate features using Bayesian networks
AU - Dash, Shishir
AU - Quirk, J. Gerald
AU - Djuric, Petar M.
PY - 2012
Y1 - 2012
N2 - We present preliminary results on the use of Bayesian-network (BN) structure learning algorithms for deciphering dependencies from amongst different fetal heart rate (FHR) features collected from a real database. We used a greedy search-and-score procedure known as the K2 algorithm for the estimation of the BN structure. The database consists of a collection of discrete-valued features quantifying presence of morphological changes as prescribed by expert guidelines (updated by the National Institute of Child Health and Human Development (NICHD)) and implemented as rule-based programs. We compare the results of structure learning to the expert-guided structure and use decision functions for classification using posterior probabilities. It was found that the BN estimated from structure learning algorithms had comparable classification performance, but fewer edges, leading to more efficient characterization of conditional probability tables (CPD's). Moreover, structure learning algorithms offer a method of learning novel correlations between FHR features that may be exploited for automatic categorization.
AB - We present preliminary results on the use of Bayesian-network (BN) structure learning algorithms for deciphering dependencies from amongst different fetal heart rate (FHR) features collected from a real database. We used a greedy search-and-score procedure known as the K2 algorithm for the estimation of the BN structure. The database consists of a collection of discrete-valued features quantifying presence of morphological changes as prescribed by expert guidelines (updated by the National Institute of Child Health and Human Development (NICHD)) and implemented as rule-based programs. We compare the results of structure learning to the expert-guided structure and use decision functions for classification using posterior probabilities. It was found that the BN estimated from structure learning algorithms had comparable classification performance, but fewer edges, leading to more efficient characterization of conditional probability tables (CPD's). Moreover, structure learning algorithms offer a method of learning novel correlations between FHR features that may be exploited for automatic categorization.
UR - https://www.scopus.com/pages/publications/84870846861
U2 - 10.1109/EMBC.2012.6347411
DO - 10.1109/EMBC.2012.6347411
M3 - Conference contribution
C2 - 23367346
AN - SCOPUS:84870846861
SN - 9781424441198
T3 - Proceedings of the Annual International Conference of the IEEE Engineering in Medicine and Biology Society, EMBS
SP - 6204
EP - 6207
BT - 2012 Annual International Conference of the IEEE Engineering in Medicine and Biology Society, EMBC 2012
T2 - 34th Annual International Conference of the IEEE Engineering in Medicine and Biology Society, EMBS 2012
Y2 - 28 August 2012 through 1 September 2012
ER -