Restricted least angle regression algorithm for lasso

Show simple item record

dc.contributor.author Kayanan, M.
dc.contributor.author Wijekoon, P.
dc.date.accessioned 2022-05-18T04:00:11Z
dc.date.available 2022-05-18T04:00:11Z
dc.date.issued 11-10-19
dc.identifier.uri http://drr.vau.ac.lk/handle/123456789/112
dc.description.abstract Least Absolute Shrinkage and Selection Operator (LASSO) method has been used for variable selection in the linear regression model when multicollinearity exists among the predictor variables. A popular algorithm to find LASSO solutions is known as the Least Angle Regression (LARS) algorithm. Researchers have shown that the estimation of regression parameters is improved when adding prior information to the model, which can be in the form of exact linear restrictions or stochastic linear restrictions. In this study, we modify the LARS algorithm by incorporating stochastic linear restrictions to improve the LASSO solutions. Further, we compared the performance of restricted LARS algorithm with the existing algorithm in Root Mean Square Error (RMSE) and Mean Absolute Prediction Error (MAPE) criterions using a Monte Carlo simulation study and a real-world example. The comparisons revealed that restricted LARS algorithm for LASSO shows better performance when prior information of regression coefficients is available. en_US
dc.language.iso en en_US
dc.publisher Postgraduate Institute of Science , University of Peradeniya, Sri Lanka en_US
dc.subject Least Angle Regression en_US
dc.subject LASSO en_US
dc.subject Root Mean Square Error en_US
dc.subject Stochastic linear restrictions en_US
dc.title Restricted least angle regression algorithm for lasso en_US
dc.type Conference paper en_US
dc.identifier.proceedings Proceedings of the Postgraduate Institute of Science Research Congress, Sri Lanka en_US


Files in this item

This item appears in the following Collection(s)

Show simple item record

Search


Browse

My Account