An Efficient Training Algorithm for Kernel Survival Support Vector Machines

Sebastian Pölsterl, Nassir Navab, Amin Katouzian
11/21/2016
cs.LGcs.AIstat.ML

Official code: tum-camp/survival-support-vector-machine (11 stars, GPL-3.0, last commit 2016-12-28).

Abstract

Survival analysis is a fundamental tool in medical research to identify predictors of adverse events and develop systems for clinical decision support. In order to leverage large amounts of patient data, efficient optimisation routines are paramount. We propose an efficient training algorithm for the kernel survival support vector machine (SSVM). We directly optimise the primal objective function and employ truncated Newton optimisation and order statistic trees to significantly lower computational costs compared to previous training algorithms, which require $O(n^4)$ space and $O(p n^6)$ time for datasets with $n$ samples and $p$ features. Our results demonstrate that our proposed optimisation scheme allows analysing data of a much larger scale with no loss in prediction performance. Experiments on synthetic and 5 real-world datasets show that our technique outperforms existing kernel SSVM formulations if the amount of right censoring is high ($\geq85\%$), and performs comparably otherwise.

View on arXivView PDF

Code Implementations(1)

GPL-3.0

Fast Training of Support Vector Machines for Survival Analysis

114C++, ShellJun 8, 20159 years agoGPL-3.0

Similar Papers

Cite this paper

@article{plsterl2016efficient,
  title  = {An Efficient Training Algorithm for Kernel Survival Support Vector Machines},
  author = {Sebastian Pölsterl and Nassir Navab and Amin Katouzian},
  year   = {2016},
  eprint = {1611.07054},
  archivePrefix = {arXiv},
  url    = {https://arxiv.org/abs/1611.07054}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/1611.07054.svg)](https://codeofpaper.com/paper/1611.07054)

Discussion