{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T04:31:27Z","timestamp":1772166687601,"version":"3.50.1"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T00:00:00Z","timestamp":1742515200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"},{"start":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T00:00:00Z","timestamp":1742515200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Big Data"],"DOI":"10.1186\/s40537-024-01036-y","type":"journal-article","created":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T16:07:23Z","timestamp":1742573243000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Value-at-risk student prescription trees for price personalization"],"prefix":"10.1186","volume":"12","author":[{"given":"Maria R.","family":"Lentini","sequence":"first","affiliation":[]},{"given":"Umashanger","family":"Thayasivam","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,3,21]]},"reference":[{"key":"1036_CR1","doi-asserted-by":"publisher","DOI":"10.1201\/9781315139470","volume-title":"Classification and regression trees","author":"L Breiman","year":"2017","unstructured":"Breiman L, Friedman JH, Olshen RA, Stone CJ. Classification and regression trees. Milton Park: Routledge; 2017."},{"issue":"27","key":"1036_CR2","doi-asserted-by":"publisher","first-page":"7353","DOI":"10.1073\/pnas.1510489113","volume":"113","author":"Susan Athey","year":"2016","unstructured":"Athey Susan, Imbens Guido. Recursive partitioning for heterogeneous causal effects. Proc Natl Acad Sci. 2016;113(27):7353\u201360.","journal-title":"Proc Natl Acad Sci"},{"key":"1036_CR3","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139025751","volume-title":"Causal inference in statistics, social, and biomedical sciences","author":"GW Imbens","year":"2015","unstructured":"Imbens GW, Rubin DB. Causal inference in statistics, social, and biomedical sciences. Cambridge University Press; 2015."},{"key":"1036_CR4","unstructured":"Kallus N. Recursive partitioning for personalization using observational data. In: International conference on machine learning. PMLR; 2017. pp. 1789\u201398."},{"key":"1036_CR5","unstructured":"HiranoK IGW. Thepropensityscorewithcontinuous treatments. 2004."},{"key":"1036_CR6","unstructured":"Biggs M, Sun W, Ettl M. Model distillation for revenue optimization: interpretable personalized pricing. In: International Conference on Machine Learning. PMLR; 2021. pp. 946\u201356."},{"issue":"1","key":"1036_CR7","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1023\/A:1010933404324","volume":"45","author":"L Breiman","year":"2001","unstructured":"Breiman L. Random forests. Mach Learn. 2001;45(1):5\u201332.","journal-title":"Mach Learn"},{"issue":"523","key":"1036_CR8","doi-asserted-by":"publisher","first-page":"1228","DOI":"10.1080\/01621459.2017.1319839","volume":"113","author":"S Wager","year":"2018","unstructured":"Wager S, Athey S. Estimation and inference of heterogeneous treatment effects using random forests. J Am Stat Assoc. 2018;113(523):1228\u201342.","journal-title":"J Am Stat Assoc"},{"key":"1036_CR9","doi-asserted-by":"crossref","unstructured":"Athey S, Tibshirani J, Wager S. Generalized random forests. 2019.","DOI":"10.1214\/18-AOS1709"},{"key":"1036_CR10","doi-asserted-by":"publisher","first-page":"1189","DOI":"10.1214\/aos\/1013203451","volume":"29","author":"JH Friedman","year":"2001","unstructured":"Friedman JH. Greedy function approximation: a gradient boosting machine. Ann Stat. 2001;29:1189\u2013232.","journal-title":"Ann Stat"},{"key":"1036_CR11","first-page":"3146","volume":"30","author":"G Ke","year":"2017","unstructured":"Ke G, Meng Q, Finley T, Wang T, Chen W, Ma W, Ye Q, Liu T-Y. Lightgbm: a highly efficient gradient boosting decision tree. Adv Neural Inform Process Syst. 2017;30:3146\u201354.","journal-title":"Adv Neural Inform Process Syst"},{"key":"1036_CR12","doi-asserted-by":"crossref","unstructured":"Chen T, Guestrin C. Xgboost: a scalable tree boosting system. In: Proceedings of the 22nd acm sigkdd international conference on knowledge discovery and data mining. 2016. pp. 785\u201394.","DOI":"10.1145\/2939672.2939785"},{"issue":"1","key":"1036_CR13","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/0020-0190(76)90095-8","volume":"5","author":"H Laurent","year":"1976","unstructured":"Laurent H, Rivest RL. Constructing optimal binary decision trees is NP-complete. Inform Process Lett. 1976;5(1):15\u20137.","journal-title":"Inform Process Lett"},{"issue":"2","key":"1036_CR14","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1287\/ijoo.2018.0005","volume":"1","author":"D Bertsimas","year":"2019","unstructured":"Bertsimas D, Dunn J, Mundru N. Optimal prescriptive trees. INFORMS J Optim. 2019;1(2):164\u201383.","journal-title":"INFORMS J Optim"},{"key":"1036_CR15","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-022-06128-5","author":"M Amram","year":"2022","unstructured":"Amram M, Dunn J, Zhuo YD. Optimal policy trees. Mach Learn. 2022. https:\/\/doi.org\/10.1007\/s10994-022-06128-5.","journal-title":"Mach Learn"},{"key":"1036_CR16","first-page":"1996","volume-title":"Riskmetrics technical document","author":"J Morgan","year":"1996","unstructured":"Morgan J. Riskmetrics technical document. New York: Morgan Guaranty Trust Company; 1996. p. 1996."},{"key":"1036_CR17","doi-asserted-by":"crossref","unstructured":"Chipman HA, George EI, McCulloch RE. BART: Bayesian additive regression trees. 2010.","DOI":"10.1214\/09-AOAS285"},{"key":"1036_CR18","unstructured":"Quiroga M, Garay PG, Alonso JM, Loyola JM, Martin OA. Bayesian additive regression trees for probabilistic programming. 2022."}],"container-title":["Journal of Big Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s40537-024-01036-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1186\/s40537-024-01036-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s40537-024-01036-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T16:07:28Z","timestamp":1742573248000},"score":1,"resource":{"primary":{"URL":"https:\/\/journalofbigdata.springeropen.com\/articles\/10.1186\/s40537-024-01036-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,3,21]]},"references-count":18,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2025,12]]}},"alternative-id":["1036"],"URL":"https:\/\/doi.org\/10.1186\/s40537-024-01036-y","relation":{"has-preprint":[{"id-type":"doi","id":"10.21203\/rs.3.rs-3173963\/v1","asserted-by":"object"}]},"ISSN":["2196-1115"],"issn-type":[{"value":"2196-1115","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,3,21]]},"assertion":[{"value":"15 July 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 November 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 March 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":"Not applicable.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval and consent to participate"}},{"value":"I, ML, give my consent for the publication of identifiable details, which can include result(s) and\/or data and\/or figures and\/or details within the text (\u201cMaterial\u201d) to be published in the Journal of Big Data.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}},{"value":"The authors declare no competing interests.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"70"}}