Developing a novel Comorbidities Index for predicting 10-year mortality in Prostate Cancer patients: A computational data-driven approach

The Charlson Comorbidities Index (CCI) is a weighted additive index widely used to estimate ten-year mortality risk, but its original weights may not reflect contemporary prognoses. This limitation is critical in Prostate Cancer (PCa), where radical treatment is recommended only for patients with a life expectancy of at least ten years. For candidates eligible for Radical Prostatectomy (RP), accurate estimation of ten-year other-cause mortality is essential to balance oncological benefit against competing risks and avoid overtreatment. We propose a data-driven framework to derive a comorbidity index tailored to PCa patients considered for RP. Using a retrospective single-institution cohort, we apply Population-Based Bio-Inspired Algorithms (PBBIAs) to recalibrate comorbidity weights and evolve alternative symbolic formulations optimized for ten-year survival discrimination. We compared six optimization strategies, including symbolic regression approaches based on Genetic Programming (GP), population-based metaheuristics, clinically validated baselines, and survival prediction models. Results show that GA, FST-PSO, and SLIM outperform both the original CCI and the PCCI, particularly when PCa-specific variables are included, improving the Concordance Index by up to 0.1. GPLearn yields compact and interpretable models with competitive performance. Overall, the proposed approach provides an updated and interpretable tool to improve patient selection for RP.

NEVO-GSPT: Population-Based Neural Network Evolution Using Inflate and Deflate Operators

Evolving neural network architectures is a computationally demanding process. Traditional methods often require an extensive search through large architectural spaces and offer limited understanding of how structural modifications influence model behavior. This paper introduces \gls{ngspt}, a novel Neuroevolution algorithm based on two key innovations. First, we adapt geometric semantic operators~(GSOs) from genetic programming to neural network evolution, ensuring that architectural changes produce predictable effects on network semantics within a unimodal error surface. Second, we introduce a novel operator (DGSM) that enables controlled reduction of network size, while maintaining the semantic properties of~GSOs. Unlike traditional approaches, \gls{ngspt}'s efficient evaluation mechanism, which only requires computing the semantics of newly added components, allows for efficient population-based training, resulting in a comprehensive exploration of the search space at a fraction of the computational cost. Experimental results on four regression benchmarks show that \gls{ngspt} consistently evolves compact neural networks that achieve performance comparable to or better than established methods in the literature, such as standard neural networks, SLIM-GSGP, TensorNEAT, and SLM.