{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T19:19:02Z","timestamp":1757618342606,"version":"3.44.0"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T00:00:00Z","timestamp":1750291200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T00:00:00Z","timestamp":1750291200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62372138"],"award-info":[{"award-number":["62372138"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100005046","name":"Natural Science Foundation of Heilongjiang Province","doi-asserted-by":"publisher","award":["HSF20230095"],"award-info":[{"award-number":["HSF20230095"]}],"id":[{"id":"10.13039\/501100005046","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Shenzhen Science and Technology Program","award":["JCYJ20220818100205012"],"award-info":[{"award-number":["JCYJ20220818100205012"]}]},{"DOI":"10.13039\/501100005046","name":"Shenzhen Key Laboratory of Intelligent Bioinformatics","doi-asserted-by":"publisher","award":["ZDSYS20220422103800001"],"award-info":[{"award-number":["ZDSYS20220422103800001"]}],"id":[{"id":"10.13039\/501100005046","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2025,7]]},"DOI":"10.1007\/s10878-025-01323-1","type":"journal-article","created":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T14:45:47Z","timestamp":1750344347000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Fitting and analyzing data with convex-area-wise linear regression models"],"prefix":"10.1007","volume":"49","author":[{"ORCID":"https:\/\/orcid.org\/0009-0005-6462-8942","authenticated-orcid":false,"given":"Bohan","family":"Lyu","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4119-0571","authenticated-orcid":false,"given":"Jianzhong","family":"Li","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,6,19]]},"reference":[{"key":"1323_CR1","unstructured":"Arumugam M (2003) Emprr: a high-dimensional em-based piecewise regression algorithm. Ph.D. thesis, University of Nebraska\u2013Lincoln"},{"issue":"6","key":"1323_CR2","doi-asserted-by":"publisher","first-page":"3194","DOI":"10.1109\/TAC.2022.3183036","volume":"68","author":"A Bemporad","year":"2022","unstructured":"Bemporad A (2022) A piecewise linear regression and classification algorithm with application to learning and model predictive control of hybrid systems. IEEE Trans Autom Control 68(6):3194\u20133209","journal-title":"IEEE Trans Autom Control"},{"key":"1323_CR3","volume-title":"Introduction to probability","author":"D Bertsekas","year":"2008","unstructured":"Bertsekas D, Tsitsiklis JN (2008) Introduction to probability, vol 1. Athena Scientific, Nashua"},{"key":"1323_CR4","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441","volume-title":"Convex optimization","author":"SP Boyd","year":"2004","unstructured":"Boyd SP, Vandenberghe L (2004) Convex optimization. Cambridge University Press, Cambridge"},{"key":"1323_CR5","unstructured":"Diakonikolas I, Li J, Voloshinov A (2020) Efficient algorithms for multidimensional segmented regression. arXiv preprint arXiv:2003.11086"},{"issue":"9","key":"1323_CR6","doi-asserted-by":"publisher","first-page":"2452","DOI":"10.1109\/TKDE.2015.2411609","volume":"27","author":"G Dong","year":"2015","unstructured":"Dong G, Taslimitehrani V (2015) Pattern-aided regression modeling and prediction model analysis. IEEE Trans Knowl Data Eng 27(9):2452\u20132465","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"1323_CR7","unstructured":"Ghosh A, Pananjady A, Guntuboyina A, Ramchandran K (2019) Max-affine regression: Provable, tractable, and near-optimal statistical estimation. arXiv preprint arXiv:1906.09255"},{"issue":"5","key":"1323_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3236009","volume":"51","author":"R Guidotti","year":"2018","unstructured":"Guidotti R, Monreale A, Ruggieri S, Turini F, Giannotti F, Pedreschi D (2018) A survey of methods for explaining black box models. ACM comput surv 51(5):1\u201342","journal-title":"ACM comput surv"},{"issue":"10","key":"1323_CR9","doi-asserted-by":"publisher","first-page":"1025","DOI":"10.1089\/neu.2005.22.1025","volume":"22","author":"CW Hukkelhoven","year":"2005","unstructured":"Hukkelhoven CW, Steyerberg EW, Habbema JDF, Farace E, Marmarou A, Murray GD, Marshall LF, Maas AI (2005) Predicting outcome after traumatic brain injury: development and validation of a prognostic score based on admission characteristics. J Neurotrauma 22(10):1025\u20131039","journal-title":"J Neurotrauma"},{"issue":"2.5","key":"1323_CR10","first-page":"3","volume":"37","author":"V Jakkula","year":"2006","unstructured":"Jakkula V (2006) Tutorial on support vector machine (svm). Sch of EECS, Washington State University 37(2.5):3","journal-title":"Sch of EECS, Washington State University"},{"key":"1323_CR11","doi-asserted-by":"crossref","unstructured":"Lyu B, Li J (2023) An efficient data analysis method for big data using multiple-model linear regression. In: International computing and combinatorics conference. Springer, Berlin, pp 272\u2013284","DOI":"10.1007\/978-3-031-49190-0_19"},{"key":"1323_CR12","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2024.114878","volume":"1021","author":"B Lyu","year":"2024","unstructured":"Lyu B, Li J (2024) Multiple-model polynomial regression and efficient algorithms for data analysis. Theoret Comput Sci 1021:114878","journal-title":"Theoret Comput Sci"},{"issue":"4","key":"1323_CR13","doi-asserted-by":"publisher","first-page":"520","DOI":"10.1038\/sj.leu.2402464","volume":"16","author":"M Monga","year":"2002","unstructured":"Monga M, Sausville EA (2002) Developmental therapeutics program at the nci: molecular target and drug discovery process. Leukemia 16(4):520\u2013526","journal-title":"Leukemia"},{"key":"1323_CR14","unstructured":"Montgomery DC, Peck EA, Vining GG (2021) Introduction to linear regression analysis. Wiley, Tech. rep"},{"key":"1323_CR15","doi-asserted-by":"crossref","unstructured":"Nocedal J, Wright SJ (2006) Quadratic programming. Numerical optimization pp 448\u2013492","DOI":"10.1007\/978-0-387-40065-5_16"},{"key":"1323_CR16","unstructured":"Siahkamari A, Gangrade A, Kulis B, Saligrama V (2020) Piecewise linear regression via a difference of convex functions. In: International Conference on Machine Learning, PMLR pp 8895\u20138904"},{"issue":"1","key":"1323_CR17","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1016\/j.ejor.2011.12.030","volume":"219","author":"A Toriello","year":"2012","unstructured":"Toriello A, Vielma JP (2012) Fitting piecewise linear continuous functions. Eur J Oper Res 219(1):86\u201395","journal-title":"Eur J Oper Res"},{"key":"1323_CR18","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611970128","volume-title":"Spline models for observational data","author":"G Wahba","year":"1990","unstructured":"Wahba G (1990) Spline models for observational data. SIAM, Bang Sue"},{"key":"1323_CR19","unstructured":"Wang Y, Witten IH (1996) Induction of model trees for predicting continuous classes"},{"issue":"1","key":"1323_CR20","doi-asserted-by":"publisher","first-page":"646","DOI":"10.1137\/16M1084705","volume":"28","author":"Y Xu","year":"2018","unstructured":"Xu Y (2018) Hybrid jacobian and gauss-seidel proximal block coordinate update methods for linearly constrained convex programming. SIAM J Optim 28(1):646\u2013670","journal-title":"SIAM J Optim"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-025-01323-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-025-01323-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-025-01323-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,6]],"date-time":"2025-09-06T20:32:05Z","timestamp":1757190725000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-025-01323-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,19]]},"references-count":20,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2025,7]]}},"alternative-id":["1323"],"URL":"https:\/\/doi.org\/10.1007\/s10878-025-01323-1","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2025,6,19]]},"assertion":[{"value":"14 May 2025","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 June 2025","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no relevant financial or non-financial interests to disclose.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing Interests"}}],"article-number":"92"}}