{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T19:33:39Z","timestamp":1760470419771,"version":"build-2065373602"},"reference-count":38,"publisher":"MDPI AG","issue":"9","license":[{"start":{"date-parts":[[2023,9,19]],"date-time":"2023-09-19T00:00:00Z","timestamp":1695081600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithms"],"abstract":"<jats:p>The carousel greedy algorithm (CG) was proposed several years ago as a generalized greedy algorithm. In this paper, we implement CG to solve linear regression problems with a cardinality constraint on the number of features. More specifically, we introduce a default version of CG that has several novel features. We compare its performance against stepwise regression and more sophisticated approaches using integer programming, and the results are encouraging. For example, CG consistently outperforms stepwise regression (from our preliminary experiments, we see that CG improves upon stepwise regression in 10 of 12 cases), but it is still computationally inexpensive. Furthermore, we show that the approach is applicable to several more general feature selection problems.<\/jats:p>","DOI":"10.3390\/a16090447","type":"journal-article","created":{"date-parts":[[2023,9,19]],"date-time":"2023-09-19T23:17:20Z","timestamp":1695165440000},"page":"447","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Carousel Greedy Algorithms for Feature Selection in Linear Regression"],"prefix":"10.3390","volume":"16","author":[{"ORCID":"https:\/\/orcid.org\/0009-0001-9427-3776","authenticated-orcid":false,"given":"Jiaqi","family":"Wang","sequence":"first","affiliation":[{"name":"Department of Mathematics, University of Maryland, College Park, MD 20742, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5270-6094","authenticated-orcid":false,"given":"Bruce","family":"Golden","sequence":"additional","affiliation":[{"name":"Robert H. Smith School of Business, University of Maryland, College Park, MD 20742, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6243-4512","authenticated-orcid":false,"given":"Carmine","family":"Cerrone","sequence":"additional","affiliation":[{"name":"Department of Economics and Business Studies, University of Genoa, 16126 Genoa, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2023,9,19]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/j.cor.2017.03.016","article-title":"Carousel greedy: A generalized greedy algorithm with applications in optimization","volume":"85","author":"Cerrone","year":"2017","journal-title":"Comput. Oper. Res."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"106093","DOI":"10.1016\/j.cor.2022.106093","article-title":"The knapsack problem with forfeit sets","volume":"151","author":"Laureana","year":"2023","journal-title":"Comput. Oper. Res."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"749","DOI":"10.1007\/s00500-021-06331-x","article-title":"A hybrid metaheuristic for the knapsack problem with forfeits","volume":"26","author":"Capobianco","year":"2022","journal-title":"Soft Comput."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"1330","DOI":"10.1007\/s11227-021-03925-y","article-title":"Maximum network lifetime problem with time slots and coverage constraints: Heuristic approaches","volume":"78","author":"Cerulli","year":"2022","journal-title":"J. Supercomput."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1002\/net.22061","article-title":"Grocery distribution plans in urban networks with street crossing penalties","volume":"78","author":"Cerrone","year":"2021","journal-title":"Networks"},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"830","DOI":"10.1109\/TCSS.2021.3096247","article-title":"An iterated carousel greedy algorithm for finding minimum positive influence dominating sets in social networks","volume":"9","author":"Shan","year":"2021","journal-title":"IEEE Trans. Comput. Soc. Syst."},{"key":"ref_7","first-page":"263","article-title":"The knapsack problem with forfeits","volume":"Volume 12176","author":"Gendron","year":"2020","journal-title":"Combinatorial Optimization. ISCO 2020"},{"key":"ref_8","doi-asserted-by":"crossref","unstructured":"Hammond, J.E., Vernon, C.A., Okeson, T.J., Barrett, B.J., Arce, S., Newell, V., Janson, J., Franke, K.W., and Hedengren, J.D. (2020). Survey of 8 UAV set-covering algorithms for terrain photogrammetry. Remote Sens., 12.","DOI":"10.3390\/rs12142285"},{"key":"ref_9","first-page":"1030","article-title":"An adaptive heuristic approach to compute upper and lower bounds for the close-enough traveling salesman problem","volume":"32","author":"Carrabs","year":"2020","journal-title":"INFORMS J. Comput."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"122124","DOI":"10.1016\/j.physa.2019.122124","article-title":"A hybrid iterated carousel greedy algorithm for community detection in complex networks","volume":"536","author":"Kong","year":"2019","journal-title":"Phys. A Stat. Mech. Its Appl."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1002\/net.21882","article-title":"Heuristics for the strong generalized minimum label spanning tree problem","volume":"74","author":"Cerrone","year":"2019","journal-title":"Networks"},{"key":"ref_12","first-page":"263","article-title":"An efficient approach for sentiment analysis in a big data environment","volume":"8","author":"Hadi","year":"2019","journal-title":"Int. J. Eng. Adv. Technol. (IJEAT)"},{"key":"ref_13","unstructured":"Cerrone, C., Gentili, M., D\u2019Ambrosio, C., and Cerulli, R. (2018). New Trends in Emerging Complex Real Life Problems, ODS."},{"key":"ref_14","doi-asserted-by":"crossref","unstructured":"Carrabs, F., Cerrone, C., D\u2019Ambrosio, C., and Raiconi, A. (2017, January 4\u20137). Column generation embedding carousel greedy for the maximum network lifetime problem with interference constraints. Proceedings of the Optimization and Decision Science: Methodologies and Applications: ODS, Sorrento, Italy.","DOI":"10.1007\/978-3-319-67308-0_16"},{"key":"ref_15","unstructured":"Akaike, H. (1998). Selected Papers of Hirotugu Akaike, Springer."},{"key":"ref_16","first-page":"87","article-title":"Some comments on Cp","volume":"42","author":"Mallows","year":"2000","journal-title":"Technometrics"},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1214\/aos\/1176344136","article-title":"Estimating the dimension of a model","volume":"6","author":"Schwarz","year":"1978","journal-title":"Ann. Stat."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"1947","DOI":"10.1214\/aos\/1176325766","article-title":"The risk inflation criterion for multiple regression","volume":"22","author":"Foster","year":"1994","journal-title":"Ann. Stat."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1287\/opre.2015.1436","article-title":"OR forum\u2014An algorithmic approach to linear regression","volume":"64","author":"Bertsimas","year":"2016","journal-title":"Oper. Res."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"813","DOI":"10.1214\/15-AOS1388","article-title":"Best subset selection via a modern optimization lens","volume":"44","author":"Bertsimas","year":"2016","journal-title":"Ann. Stat."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"33117","DOI":"10.1073\/pnas.2014241117","article-title":"A polynomial algorithm for best-subset selection problem","volume":"117","author":"Zhu","year":"2020","journal-title":"Proc. Natl. Acad. Sci. USA"},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1111\/j.2517-6161.1996.tb02080.x","article-title":"Regression shrinkage and selection via the lasso","volume":"58","author":"Tibshirani","year":"1996","journal-title":"J. R. Stat. Soc. Ser. B (Methodol.)"},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"1418","DOI":"10.1198\/016214506000000735","article-title":"The adaptive lasso and its oracle properties","volume":"101","author":"Zou","year":"2006","journal-title":"J. Am. Stat. Assoc."},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"1517","DOI":"10.1287\/opre.2019.1919","article-title":"Fast best subset selection: Coordinate descent and local combinatorial optimization algorithms","volume":"68","author":"Hazimeh","year":"2020","journal-title":"Oper. Res."},{"key":"ref_25","unstructured":"Bertsimas, D., Copenhaver, M.S., and Mazumder, R. (2017). The trimmed lasso: Sparsity and robustness. arXiv."},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1111\/j.1467-9868.2005.00503.x","article-title":"Regularization and variable selection via the elastic net","volume":"67","author":"Zou","year":"2005","journal-title":"J. R. Stat. Soc. Ser. B Stat. Methodol."},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"894","DOI":"10.1214\/09-AOS729","article-title":"Nearly unbiased variable selection under minimax concave penalty","volume":"38","author":"Zhang","year":"2010","journal-title":"Ann. Stat."},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1214\/18-AOS1804","article-title":"Sparse high-dimensional regression: Exact scalable algorithms and phase transitions","volume":"48","author":"Bertsimas","year":"2020","journal-title":"Ann. Stat."},{"key":"ref_29","unstructured":"Atamturk, A., and Gomez, A. (2020, January 13\u201318). Safe screening rules for L0-regression from perspective relaxations. Proceedings of the 37th International Conference on Machine Learning, Virtual Event."},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"2968","DOI":"10.1287\/ijoc.2022.1211","article-title":"An alternating method for cardinality-constrained optimization: A computational study for the best subset selection and sparse portfolio problems","volume":"34","author":"Kreber","year":"2022","journal-title":"INFORMS J. Comput."},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"1125","DOI":"10.1198\/jasa.2011.tm09738","article-title":"SparseNet: Coordinate descent with nonconvex penalties","volume":"106","author":"Mazumder","year":"2011","journal-title":"J. Am. Stat. Assoc."},{"key":"ref_32","first-page":"579","article-title":"Best subset, forward stepwise or lasso? Analysis and recommendations based on extensive comparisons","volume":"35","author":"Hastie","year":"2020","journal-title":"Stat. Sci."},{"key":"ref_33","doi-asserted-by":"crossref","first-page":"374","DOI":"10.1016\/j.csda.2006.12.019","article-title":"Relaxed lasso","volume":"52","author":"Meinshausen","year":"2007","journal-title":"Comput. Stat. Data Anal."},{"key":"ref_34","first-page":"713","article-title":"Greedy algorithms for classification\u2013consistency, convergence rates, and adaptivity","volume":"4","author":"Mannor","year":"2003","journal-title":"J. Mach. Learn. Res."},{"key":"ref_35","unstructured":"Tewari, A., Ravikumar, P., and Dhillon, I.S. (2011, January 12\u201315). Greedy algorithms for structurally constrained high dimensional problems. Proceedings of the the 24th International Conference on Neural Information Processing Systems, Granada, Spain."},{"key":"ref_36","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1214\/009053607000000631","article-title":"Approximation and learning by greedy algorithms","volume":"36","author":"Barron","year":"2008","journal-title":"Ann. Stat."},{"key":"ref_37","unstructured":"Painter-Wakefield, C., and Parr, R. (July, January 26). Greedy algorithms for sparse reinforcement learning. Proceedings of the the 29th International Coference on International Conference on Machine Learning, Edinburgh, UK."},{"key":"ref_38","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1109\/TPAMI.2005.1","article-title":"A noniterative greedy algorithm for multiframe point correspondence","volume":"27","author":"Shafique","year":"2005","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."}],"container-title":["Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-4893\/16\/9\/447\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T20:53:42Z","timestamp":1760129622000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-4893\/16\/9\/447"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,9,19]]},"references-count":38,"journal-issue":{"issue":"9","published-online":{"date-parts":[[2023,9]]}},"alternative-id":["a16090447"],"URL":"https:\/\/doi.org\/10.3390\/a16090447","relation":{},"ISSN":["1999-4893"],"issn-type":[{"type":"electronic","value":"1999-4893"}],"subject":[],"published":{"date-parts":[[2023,9,19]]}}}