The differential geometric least angle regression method consists essentially in computing the solution path. In Augugliaro et al. , this problem is satisfactorily solved by using a predictor-corrector (PC) algorithm, that however has the drawback of becoming intractable when working with thousands of predictors. Using the PC algorithm leads to an increase in the run times needed for computing the solution curve. In this paper we explain an improved version of the PC algorithm (IPC), proposed in Pazira et al. , to decrease the effects stemming from this problem for computing the solution curve. The IPC algorithm allows the dgLARS method to be implemented by using less number of arithmetic operations that leads to potential computational saving.
|Name||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|
|Conference||15th International Conference on Computational Intelligence Methods for Bioinformatics and Biostatistics, CIBB 2018|
|Period||06/09/2018 → 08/09/2018|