Binacox: automatic cut-point detection in high-dimensional Cox model with applications in genetics
원문 초록
We introduce the binacox, a prognostic method to deal with the problem of detecting multiple cut-points per features in a multivariate setting where a large number of continuous features are available. The method is based on the Cox model and combines one-hot encoding with the binarsity penalty, which uses total-variation regularization together with an extra linear constraint, and enables feature selection. Original nonasymptotic oracle inequalities for prediction (in terms of Kullback-Leibler divergence) and estimation with a fast rate of convergence are established. The statistical performance of the method is examined in an extensive Monte Carlo simulation study, and then illustrated on three publicly available genetic cancer datasets. On these high-dimensional datasets, our proposed method significantly outperforms state-of-the-art survival models regarding risk prediction in terms of the C-index, with a computing time orders of magnitude faster. In addition, it provides powerful interpretability from a clinical perspective by automatically pinpointing significant cut-points in relevant variables.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Interpretable Bayesian Tensor Network Kernel Machines with Automatic Rank and Feature Selection
Malware Classification Leveraging NLP & Machine Learning for Enhanced Accuracy
Simple is what you need for efficient and accurate medical image segmentation
Survival Analysis as Imprecise Classification with Trainable Kernels
Permutation-Free High-Order Interaction Tests
Scalable unsupervised feature selection via weight stability
토론
이 논문과 연결된 포럼 글이 아직 없습니다.