CoxNTF: A New Approach for Joint Clustering and Prediction in Survival Analysis

• URL: http://arxiv.org/abs/2506.06411v1
• Date: Fri, 06 Jun 2025 15:43:51 GMT
• Title: CoxNTF: A New Approach for Joint Clustering and Prediction in Survival Analysis
• Authors: Paul Fogel, Christophe Geissler, George Luta,
• Abstract summary: CoxNTF is a novel approach that uses non-negative tensor factorization (NTF) to derive meaningful latent representations closely associated with survival outcomes.<n>Our results show that CoxNTF achieves survival prediction performance comparable to using Coxnet.<n>The new approach effectively handles feature redundancy, making it a powerful tool for joint clustering and prediction in survival analysis.
• Score: 0.3160121582090025
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: The interpretation of the results of survival analysis often benefits from latent factor representations of baseline covariates. However, existing methods, such as Nonnegative Matrix Factorization (NMF), do not incorporate survival information, limiting their predictive power. We present CoxNTF, a novel approach that uses non-negative tensor factorization (NTF) to derive meaningful latent representations that are closely associated with survival outcomes. CoxNTF constructs a weighted covariate tensor in which survival probabilities derived from the Coxnet model are used to guide the tensorization process. Our results show that CoxNTF achieves survival prediction performance comparable to using Coxnet with the original covariates, while providing a structured and interpretable clustering framework. In addition, the new approach effectively handles feature redundancy, making it a powerful tool for joint clustering and prediction in survival analysis.

Related papers

• Score-Based Model for Low-Rank Tensor Recovery [49.158601255093416]
  Low-rank tensor decompositions (TDs) provide an effective framework for multiway data analysis.<n>Traditional TD methods rely on predefined structural assumptions, such as CP or Tucker decompositions.<n>We propose a score-based model that eliminates the need for predefined structural or distributional assumptions.
  arXiv  Detail & Related papers  (2025-06-27T15:05:37Z)
• Extending Cox Proportional Hazards Model with Symbolic Non-Linear Log-Risk Functions for Survival Analysis [4.872570541276082]
  We introduce Generalized Cox Proportional Hazards (GCPH) model, a novel method for survival analysis.<n>GCPH maintains the interpretability of traditional CPH models while allowing for the estimation of non-linear log-risk functions.
  arXiv  Detail & Related papers  (2025-04-06T04:35:11Z)
• HACSurv: A Hierarchical Copula-Based Approach for Survival Analysis with Dependent Competing Risks [51.95824566163554]
  We introduce HACSurv, a survival analysis method that learns Hierarchical Archimedean Copulas structures.<n>By capturing the dependencies between risks and censoring, HACSurv improves the accuracy of survival predictions.
  arXiv  Detail & Related papers  (2024-10-19T18:52:18Z)
• ICTSurF: Implicit Continuous-Time Survival Functions with Neural Networks [0.0]
  This research introduces the Implicit Continuous-Time Survival Function (ICTSurF) ICTSurF is built on a continuous-time survival model and constructs survival distribution through implicit representation. Our method is capable of accepting inputs in continuous-time space and producing survival probabilities in continuous-time space, independent of neural network architecture.
  arXiv  Detail & Related papers  (2023-12-10T08:29:00Z)
• Learning Survival Distribution with Implicit Survival Function [15.588273962274393]
  We propose Implicit Survival Function (ISF) based on Implicit Neural Representation for survival distribution estimation without strong assumptions. Experimental results show ISF outperforms the state-of-the-art methods in three public datasets.
  arXiv  Detail & Related papers  (2023-05-24T02:51:29Z)
• Variational Classification [51.2541371924591]
  We derive a variational objective to train the model, analogous to the evidence lower bound (ELBO) used to train variational auto-encoders. Treating inputs to the softmax layer as samples of a latent variable, our abstracted perspective reveals a potential inconsistency. We induce a chosen latent distribution, instead of the implicit assumption found in a standard softmax layer.
  arXiv  Detail & Related papers  (2023-05-17T17:47:19Z)
• FastCPH: Efficient Survival Analysis for Neural Networks [57.03275837523063]
  We propose FastCPH, a new method that runs in linear time and supports both the standard Breslow and Efron methods for tied events. We also demonstrate the performance of FastCPH combined with LassoNet, a neural network that provides interpretability through feature sparsity.
  arXiv  Detail & Related papers  (2022-08-21T03:35:29Z)
• Comparative Analysis of Interval Reachability for Robust Implicit and Feedforward Neural Networks [64.23331120621118]
  We use interval reachability analysis to obtain robustness guarantees for implicit neural networks (INNs) INNs are a class of implicit learning models that use implicit equations as layers. We show that our approach performs at least as well as, and generally better than, applying state-of-the-art interval bound propagation methods to INNs.
  arXiv  Detail & Related papers  (2022-04-01T03:31:27Z)
• Interpretable Social Anchors for Human Trajectory Forecasting in Crowds [84.20437268671733]
  We propose a neural network-based system to predict human trajectory in crowds. We learn interpretable rule-based intents, and then utilise the expressibility of neural networks to model scene-specific residual. Our architecture is tested on the interaction-centric benchmark TrajNet++.
  arXiv  Detail & Related papers  (2021-05-07T09:22:34Z)
• DeepHazard: neural network for time-varying risks [0.6091702876917281]
  We propose a new flexible method for survival prediction: DeepHazard, a neural network for time-varying risks. Our approach is tailored for a wide range of continuous hazards forms, with the only restriction of being additive in time. Numerical examples illustrate that our approach outperforms existing state-of-the-art methodology in terms of predictive capability evaluated through the C-index metric.
  arXiv  Detail & Related papers  (2020-07-26T21:01:49Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.