Aye Aye Maung
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Aye Aye Maung has a total of 9 co-authors. Here are the top co-authors by number of shared publications:
- Drew Lazar
Department of Mathematical Sciences, Ball State University, Muncie, USA
3 shared publications - Qi Zheng
Department of Bioinformatics and Biostatistics, University of Louisville, Louisville, USA
3 shared publications - Evan Alexander
Department of Pathology and Laboratory Medicine, University of Louisville School of Medicine, Louisville, KY, USA
1 shared publication Maiying Kong
Biostatistics and Bioinformatics Facility, James Graham Brown Cancer Center, Louisville, KY, USA; Department of Bioinformatics and Biostatistics, University of Louisville, Louisville, KY, USA
1 shared publication- Mark William Linder
Department of Pathology and Laboratory Medicine, University of Louisville School of Medicine, Louisville, USA
1 shared publication Melissa Barousse Hall
UofL Health Brown Cancer Center, Louisville, KY, USA; Department of Medicine, University of Louisville School of Medicine, Louisville, KY, USA
1 shared publication
Latest Publications
- Open Access
- 5 June 2026
- Published by Springer Nature in METRON
- Vol. 84 (2) , 1
Correction: Node splitting SVMs for survival trees based on an L2-regularized dipole splitting criteria
- 5 June 2026
- Published by Springer Nature in METRON
- Vol. 84 (2) , 1
Open AccessCorrection: Node splitting SVMs for survival trees based on an L2-regularized dipole splitting criteria
- 9 November 2025
- Published by Springer Nature in METRON
- Vol. 83 (3) , 285-312
Node splitting SVMs for survival trees based on an $L_2$-regularized dipole splitting criteria- 9 November 2025
- Published by Springer Nature in METRON
- Vol. 83 (3) , 285-312
Node splitting SVMs for survival trees based on an $L_2$-regularized dipole splitting criteria- Open Access
Node Splitting SVMs for Survival Trees Based on an L2-Regularized Dipole Splitting Criteria
This paper proposes a novel, node-splitting support vector machine (SVM) for creating survival trees. This approach is capable of non-linearly partitioning survival data which includes continuous, right-censored outcomes. Our method improves on an existing non-parametric method, which uses at most oblique splits to induce survival regression trees. In the prior work, these oblique splits were created via a non-SVM approach, by minimizing a piece-wise linear objective, called a dipole splitting criterion, constructed from pairs of covariates and their associated survival information. We extend this method by enabling splits from a general class of non-linear surfaces. We achieve this by ridge regularizing the dipole-splitting criterion to enable application of kernel methods in a manner analogous to classical SVMs. The ridge regularization provides robustness and can be tuned. Using various kernels, we induce both linear and non-linear survival trees to compare their sizes and predictive powers on real and simulated data sets. We compare traditional univariate log-rank splits, oblique splits using the original dipole-splitting criterion and a variety of non-linear splits enabled by our method. In these tests, trees created by non-linear splits, using polynomial and Gaussian kernels show similar predictive power while often being of smaller sizes compared to trees created by univariate and oblique splits. This approach provides a novel and flexible array of survival trees that can be applied to diverse survival data sets.
Open AccessNode Splitting SVMs for Survival Trees Based on an L2-Regularized Dipole Splitting Criteria
This paper proposes a novel, node-splitting support vector machine (SVM) for creating survival trees. This approach is capable of non-linearly partitioning survival data which includes continuous, right-censored outcomes. Our method improves on an existing non-parametric method, which uses at most oblique splits to induce survival regression trees. In the prior work, these oblique splits were created via a non-SVM approach, by minimizing a piece-wise linear objective, called a dipole splitting criterion, constructed from pairs of covariates and their associated survival information. We extend this method by enabling splits from a general class of non-linear surfaces. We achieve this by ridge regularizing the dipole-splitting criterion to enable application of kernel methods in a manner analogous to classical SVMs. The ridge regularization provides robustness and can be tuned. Using various kernels, we induce both linear and non-linear survival trees to compare their sizes and predictive powers on real and simulated data sets. We compare traditional univariate log-rank splits, oblique splits using the original dipole-splitting criterion and a variety of non-linear splits enabled by our method. In these tests, trees created by non-linear splits, using polynomial and Gaussian kernels show similar predictive power while often being of smaller sizes compared to trees created by univariate and oblique splits. This approach provides a novel and flexible array of survival trees that can be applied to diverse survival data sets.
- Open Access
- 1 February 2024
- Published by Elsevier in Translational Oncology
- Vol. 42, 101883
Corresponding ctDNA and tumor burden dynamics in metastatic melanoma patients on systemic treatment
- 1 February 2024
- Published by Elsevier in Translational Oncology
- Vol. 42, 101883
Open AccessCorresponding ctDNA and tumor burden dynamics in metastatic melanoma patients on systemic treatment