Deep Lifetime Clustering

Abstract

The goal of lifetime clustering is to develop an inductive model that maps subjects into $K$ clusters according to their underlying (unobserved) lifetime distribution. We introduce a neural-network based lifetime clustering model that can find cluster assignments by directly maximizing the divergence between the empirical lifetime distributions of the clusters. Accordingly, we define a novel clustering loss function over the lifetime distributions (of entire clusters) based on a tight upper bound of the two-sample Kuiper test p-value. The resultant model is robust to the modeling issues associated with the unobservability of termination signals, and does not assume proportional hazards. Our results in real and synthetic datasets show significantly better lifetime clusters (as evaluated by C-index, Brier Score, Logrank score and adjusted Rand index) as compared to competing approaches.

References in corpus (9)

• Adam: A Method for Stochastic Optimization
• Natural Scales in Geographical Patterns
• DeepSurv: Personalized Treatment Recommender System Using A Cox Proportional Hazards Deep Neural Network
• Generative Moment Matching Networks
• Deep Survival Analysis
• Benchmark of Deep Learning Models on Large Healthcare MIMIC Datasets
• Deep Learning for Patient-Specific Kidney Graft Survival Analysis
• Adversarial Time-to-Event Modeling
• Statistical tests for whether a given set of independent, identically distributed draws does not come from a specified probability density