Learning Bayesian networks from survival data using weighting censored instances

  • Authors:
  • Ivan Štajduhar;Bojana Dalbelo-Bašić

  • Affiliations:
  • Department of Computing, Faculty of Engineering, University of Rijeka, Vukovarska 58, 51000 Rijeka, Croatia;Department of Electronics, Microelectronics, Computer and Intelligent Systems, Faculty of Electrical Engineering and Computing, University of Zagreb, Unska 3, 10000 Zagreb, Croatia

  • Venue:
  • Journal of Biomedical Informatics
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

Different survival data pre-processing procedures and adaptations of existing machine-learning techniques have been successfully applied to numerous fields in clinical medicine. Zupan et al. (2000) proposed handling censored survival data by assigning distributions of outcomes to shortly observed censored instances. In this paper, we applied their learning technique to two well-known procedures for learning Bayesian networks: a search-and-score hill-climbing algorithm and a constraint-based conditional independence algorithm. The method was thoroughly tested in a simulation study and on the publicly available clinical dataset GBSG2. We compared it to learning Bayesian networks by treating censored instances as event-free and to Cox regression. The results on model performance suggest that the weighting approach performs best when dealing with intermediate censoring. There is no significant difference between the model structures learnt using either the weighting approach or by treating censored instances as event-free, regardless of censoring.