{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,12]],"date-time":"2025-09-12T18:08:40Z","timestamp":1757700520065,"version":"3.44.0"},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2025,7,22]],"date-time":"2025-07-22T00:00:00Z","timestamp":1753142400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,7,22]],"date-time":"2025-07-22T00:00:00Z","timestamp":1753142400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Stat Comput"],"published-print":{"date-parts":[[2025,10]]},"DOI":"10.1007\/s11222-025-10680-0","type":"journal-article","created":{"date-parts":[[2025,7,22]],"date-time":"2025-07-22T06:23:57Z","timestamp":1753165437000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Penalty Learning for Optimal Partitioning using Multilayer Perceptron"],"prefix":"10.1007","volume":"35","author":[{"given":"Tung L","family":"Nguyen","sequence":"first","affiliation":[]},{"given":"Toby Dylan","family":"Hocking","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,7,22]]},"reference":[{"issue":"6","key":"10680_CR1","doi-asserted-by":"publisher","first-page":"716","DOI":"10.1109\/TAC.1974.1100705","volume":"19","author":"H Akaike","year":"1974","unstructured":"Akaike, H.: A new look at the statistical model identification. IEEE Trans. Autom. Control 19(6), 716\u2013723 (1974)","journal-title":"IEEE Trans. Autom. Control"},{"issue":"1","key":"10680_CR2","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/S0092-8240(89)80047-3","volume":"51","author":"IE Auger","year":"1989","unstructured":"Auger, I.E., Lawrence, C.E.: Algorithms for the optimal identification of segment neighborhoods. Bull. Math. Biol. 51(1), 39\u201354 (1989)","journal-title":"Bull. Math. Biol."},{"issue":"1","key":"10680_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1002\/jae.659","volume":"18","author":"J Bai","year":"2003","unstructured":"Bai, J., Perron, P.: Computation and analysis of multiple structural change models. J. Appl. Economet. 18(1), 1\u201322 (2003)","journal-title":"J. Appl. Economet."},{"issue":"4","key":"10680_CR4","doi-asserted-by":"publisher","first-page":"1292","DOI":"10.1080\/10618600.2022.2067548","volume":"31","author":"A Barnwal","year":"2022","unstructured":"Barnwal, A., Cho, H., Hocking, T.: Survival regression with accelerated failure time model in xgboost. J. Comput. Graph. Stat. 31(4), 1292\u20131302 (2022)","journal-title":"J. Comput. Graph. Stat."},{"issue":"1","key":"10680_CR5","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1023\/a:1010933404324","volume":"45","author":"L Breiman","year":"2001","unstructured":"Breiman, L.: Random forest. Mach. Learn. 45(1), 5\u201332 (2001). https:\/\/doi.org\/10.1023\/a:1010933404324","journal-title":"Mach. Learn."},{"issue":"2","key":"10680_CR6","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1111\/j.1541-0420.2008.01074.x","volume":"65","author":"T Cai","year":"2009","unstructured":"Cai, T., Huang, J., Tian, L.: Regularized estimation for the accelerated failure time model. Biometrics 65(2), 394\u2013404 (2009)","journal-title":"Biometrics"},{"doi-asserted-by":"publisher","unstructured":"Cho, K., Merri\u00ebnboer, B., Gulcehre, C., Bahdanau, D., Bougares, F., Schwenk, H., Bengio, Y.: Learning phrase representations using RNN encoder\u2013decoder for statistical machine translation. In: Moschitti, A., Pang, B., Daelemans, W. (eds.) Proceedings of the 2014 Conference on Empirical Methods in Natural Language Processing (EMNLP), pp. 1724\u20131734. Association for Computational Linguistics, Doha, Qatar (2014). https:\/\/doi.org\/10.3115\/v1\/D14-1179 . https:\/\/aclanthology.org\/D14-1179","key":"10680_CR7","DOI":"10.3115\/v1\/D14-1179"},{"unstructured":"Contributors, X.: XGBoost: Python Package. Accessed: 2025-03-26 (2019). https:\/\/github.com\/dmlc\/xgboost","key":"10680_CR8"},{"unstructured":"Drouin, A., Hocking, T.D., Laviolette, F.: Maximum margin interval trees. In: Proceedings of the 31st International Conference on Neural Information Processing Systems. NIPS\u201917, pp. 4954\u20134963. Curran Associates Inc., Red Hook, NY, USA (2017)","key":"10680_CR9"},{"unstructured":"Drouin: Maximum Margin Interval Trees. (2017). https:\/\/github.com\/aldro61\/mmit","key":"10680_CR10"},{"issue":"3","key":"10680_CR11","doi-asserted-by":"publisher","first-page":"1262","DOI":"10.1007\/s10618-023-00923-x","volume":"37","author":"A Ermshaus","year":"2023","unstructured":"Ermshaus, A., Sch\u00e4fer, P., Leser, U.: Clasp: parameter-free time series segmentation. Data Min. Knowl. Disc. 37(3), 1262\u20131300 (2023)","journal-title":"Data Min. Knowl. Disc."},{"issue":"3","key":"10680_CR12","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1093\/biomet\/58.3.509","volume":"58","author":"DV Hinkley","year":"1971","unstructured":"Hinkley, D.V.: Inference about the change-point from cumulative sum tests. Biometrika 58(3), 509\u2013523 (1971)","journal-title":"Biometrika"},{"issue":"8","key":"10680_CR13","doi-asserted-by":"publisher","first-page":"1735","DOI":"10.1162\/neco.1997.9.8.1735","volume":"9","author":"S Hochreiter","year":"1997","unstructured":"Hochreiter, S., Schmidhuber, J.: Long short-term memory. Neural Comput. 9(8), 1735\u20131780 (1997). https:\/\/doi.org\/10.1162\/neco.1997.9.8.1735","journal-title":"Neural Comput."},{"unstructured":"Hocking, T.D.: penaltyLearning: Penalty Learning. (2024). R package version 2024.1.25. https:\/\/github.com\/tdhock\/penaltylearning","key":"10680_CR14"},{"issue":"1","key":"10680_CR15","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1007\/s00180-022-01238-z","volume":"38","author":"TD Hocking","year":"2023","unstructured":"Hocking, T.D., Srivastava, A.: Labeled optimal partitioning. Comput. Statistics 38(1), 461\u2013480 (2023). https:\/\/doi.org\/10.1007\/s00180-022-01238-z","journal-title":"Comput. Statistics"},{"doi-asserted-by":"publisher","unstructured":"Hopfield, J.J.: Neural networks and physical systems with emergent collective computational abilities. Proc. Natl. Acad. Sci. 79(8), 2554\u20132558 (1982). https:\/\/doi.org\/10.1073\/pnas.79.8.2554https:\/\/www.pnas.org\/doi\/pdf\/10.1073\/pnas.79.8.2554","key":"10680_CR16","DOI":"10.1073\/pnas.79.8.2554"},{"issue":"3","key":"10680_CR17","doi-asserted-by":"publisher","first-page":"813","DOI":"10.1111\/j.1541-0420.2006.00562.x","volume":"62","author":"J Huang","year":"2006","unstructured":"Huang, J., Ma, S., Xie, H.: Regularized estimation in the accelerated failure time model with high-dimensional covariates. Biometrics 62(3), 813\u2013820 (2006)","journal-title":"Biometrics"},{"issue":"2","key":"10680_CR18","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1109\/LSP.2001.838216","volume":"12","author":"B Jackson","year":"2005","unstructured":"Jackson, B., Scargle, J.D., Barnes, D., Arabhi, S., Alt, A., Gioumousis, P., Gwin, E., Sangtrakulcharoen, P., Tan, L., Tsai, T.T.: An algorithm for optimal partitioning of data on an interval. IEEE Signal Process. Lett. 12(2), 105\u2013108 (2005)","journal-title":"IEEE Signal Process. Lett."},{"issue":"1","key":"10680_CR19","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1093\/biomet\/74.1.71","volume":"74","author":"B James","year":"1987","unstructured":"James, B., James, K.L., Siegmund, D.: Tests for a change-point. Biometrika 74(1), 71\u201383 (1987)","journal-title":"Biometrika"},{"issue":"500","key":"10680_CR20","doi-asserted-by":"publisher","first-page":"1590","DOI":"10.1080\/01621459.2012.737745","volume":"107","author":"R Killick","year":"2012","unstructured":"Killick, R., Fearnhead, P., Eckley, I.A.: Optimal detection of changepoints with a linear computational cost. J. Am. Stat. Assoc. 107(500), 1590\u20131598 (2012)","journal-title":"J. Am. Stat. Assoc."},{"doi-asserted-by":"publisher","unstructured":"Lattanzi, C., Leonelli, M.: A change-point approach for the identification of financial extreme regimes. Brazilian J. Probability Statistics 35(4) (2021) https:\/\/doi.org\/10.1214\/21-bjps509","key":"10680_CR21","DOI":"10.1214\/21-bjps509"},{"issue":"8","key":"10680_CR22","doi-asserted-by":"publisher","first-page":"1501","DOI":"10.1016\/j.sigpro.2005.01.012","volume":"85","author":"M Lavielle","year":"2005","unstructured":"Lavielle, M.: Using penalized contrasts for the change-point problem. Signal Process. 85(8), 1501\u20131510 (2005). https:\/\/doi.org\/10.1016\/j.sigpro.2005.01.012","journal-title":"Signal Process."},{"doi-asserted-by":"crossref","unstructured":"Lee, J., Xie, Y., Cheng, X.: Training neural networks for sequential change-point detection. In: ICASSP 2023-2023 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), pp. 1\u20135 (2023). IEEE","key":"10680_CR23","DOI":"10.1109\/ICASSP49357.2023.10095005"},{"issue":"2","key":"10680_CR24","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1093\/jrsssb\/qkae004","volume":"86","author":"J Li","year":"2024","unstructured":"Li, J., Fearnhead, P., Fryzlewicz, P., Wang, T.: Automatic change-point detection in time series via deep learning. J. R. Stat. Soc. Ser. B Stat Methodol. 86(2), 273\u2013285 (2024)","journal-title":"J. R. Stat. Soc. Ser. B Stat Methodol."},{"issue":"216","key":"10680_CR25","first-page":"1","volume":"24","author":"M Londschien","year":"2023","unstructured":"Londschien, M., B\u00fchlmann, P., Kov\u00e1cs, S.: Random forests for change point detection. J. Mach. Learn. Res. 24(216), 1\u201345 (2023)","journal-title":"J. Mach. Learn. Res."},{"issue":"2","key":"10680_CR26","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1007\/s11222-016-9636-3","volume":"27","author":"R Maidstone","year":"2016","unstructured":"Maidstone, R., Hocking, T., Rigaill, G., Fearnhead, P.: On optimal multiple changepoint algorithms for large data. Stat. Comput. 27(2), 519\u2013533 (2016). https:\/\/doi.org\/10.1007\/s11222-016-9636-3","journal-title":"Stat. Comput."},{"doi-asserted-by":"publisher","unstructured":"Muggeo, V.M.R., Adelfio, G.: Efficient change point detection for genomic sequences of continuous measurements. Bioinformatics 27(2), 161\u2013166 (2010). https:\/\/doi.org\/10.1093\/bioinformatics\/btq647https:\/\/academic.oup.com\/bioinformatics\/article-pdf\/27\/2\/161\/48869568\/bioinformatics_27_2_161.pdf","key":"10680_CR27","DOI":"10.1093\/bioinformatics\/btq647"},{"unstructured":"Paszke, A., Gross, S., Hamza, S., Chanan, G., Brevdo, E., Lin, Z., Antiga, L., Desmaison, A., Li, A.K.P., Lerer, M.: PyTorch: An Imperative Style, High-Performance Deep Learning Library (2019). arxiv:org\/abs\/1912.01703","key":"10680_CR28"},{"unstructured":"P\u00f6lsterl, S., Navab, N., Katouzian, A.: An efficient training algorithm for kernel survival support vector machines. arXiv preprint arXiv:1611.07054 (2016)","key":"10680_CR29"},{"doi-asserted-by":"publisher","unstructured":"Prechelt, L.: Early Stopping-But When?, pp. 53\u201367. Springer, ??? (2012). https:\/\/doi.org\/10.1007\/978-3-642-35289-8_5","key":"10680_CR30","DOI":"10.1007\/978-3-642-35289-8_5"},{"key":"10680_CR31","first-page":"81","volume":"1","author":"JR Quinlan","year":"1986","unstructured":"Quinlan, J.R.: Induction of decision trees. Machine learning 1, 81\u2013106 (1986)","journal-title":"Induction of decision trees. Machine learning"},{"issue":"6","key":"10680_CR32","doi-asserted-by":"publisher","first-page":"900","DOI":"10.1175\/jam2493.1","volume":"46","author":"J Reeves","year":"2007","unstructured":"Reeves, J., Chen, J., Wang, X.L., Lund, R., Lu, Q.Q.: A review and comparison of changepoint detection techniques for climate data. J. Appl. Meteorol. Climatol. 46(6), 900\u2013915 (2007). https:\/\/doi.org\/10.1175\/jam2493.1","journal-title":"J. Appl. Meteorol. Climatol."},{"unstructured":"Rigaill, G., Hocking, T.D., Bach, F., Vert, J.-P.: Learning Sparse Penalties for Change-Point Detection using Max Margin Interval Regression (2013). https:\/\/inria.hal.science\/hal-00824075 Accessed 2024-01-10","key":"10680_CR33"},{"doi-asserted-by":"publisher","unstructured":"Schwarz, G.: Estimating the Dimension of a Model. Ann. Stat. 6(2), 461\u2013464 (1978). https:\/\/doi.org\/10.1214\/aos\/1176344136","key":"10680_CR34","DOI":"10.1214\/aos\/1176344136"},{"issue":"1","key":"10680_CR35","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1109\/JSTSP.2012.2233713","volume":"7","author":"AG Tartakovsky","year":"2013","unstructured":"Tartakovsky, A.G., Polunchenko, A.S., Sokolov, G.: Efficient computer network anomaly detection by changepoint detection methods. IEEE J. Selected Topics Signal Process. 7(1), 4\u201311 (2013). https:\/\/doi.org\/10.1109\/JSTSP.2012.2233713","journal-title":"IEEE J. Selected Topics Signal Process."},{"doi-asserted-by":"publisher","unstructured":"Truong, C., Gudre, L., Vayatis, N.: Penalty learning for changepoint detection. In: 2017 25th European Signal Processing Conference (EUSIPCO), pp. 1569\u20131573 (2017). https:\/\/doi.org\/10.23919\/EUSIPCO.2017.8081473","key":"10680_CR36","DOI":"10.23919\/EUSIPCO.2017.8081473"},{"doi-asserted-by":"crossref","unstructured":"Wei, L.-J.: The accelerated failure time model: a useful alternative to the cox regression model in survival analysis. Stat. Med. 11(14\u201315), 1871\u20131879 (1992)","key":"10680_CR37","DOI":"10.1002\/sim.4780111409"}],"container-title":["Statistics and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11222-025-10680-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11222-025-10680-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11222-025-10680-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,7]],"date-time":"2025-09-07T17:28:14Z","timestamp":1757266094000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11222-025-10680-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7,22]]},"references-count":37,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2025,10]]}},"alternative-id":["10680"],"URL":"https:\/\/doi.org\/10.1007\/s11222-025-10680-0","relation":{},"ISSN":["0960-3174","1573-1375"],"issn-type":[{"type":"print","value":"0960-3174"},{"type":"electronic","value":"1573-1375"}],"subject":[],"published":{"date-parts":[[2025,7,22]]},"assertion":[{"value":"16 January 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 June 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 July 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"153"}}