{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,23]],"date-time":"2026-03-23T10:51:19Z","timestamp":1774263079686,"version":"3.50.1"},"reference-count":33,"publisher":"Informa UK Limited","issue":"4","content-domain":{"domain":["www.tandfonline.com"],"crossmark-restriction":true},"short-container-title":["Journal of Computational and Graphical Statistics"],"published-print":{"date-parts":[[2021,10,2]]},"DOI":"10.1080\/10618600.2020.1870480","type":"journal-article","created":{"date-parts":[[2021,1,15]],"date-time":"2021-01-15T03:47:22Z","timestamp":1610682442000},"page":"1168-1180","update-policy":"https:\/\/doi.org\/10.1080\/tandf_crossmark_01","source":"Crossref","is-referenced-by-count":11,"title":["A Projection Pursuit Forest Algorithm for Supervised Classification"],"prefix":"10.1080","volume":"30","author":[{"given":"Natalia","family":"da Silva","sequence":"first","affiliation":[{"name":"Instituto de Estad\u00edstica (IESTA), Universidad de la Rep\u00fablica, Montevideo, Uruguay;"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3813-7155","authenticated-orcid":false,"given":"Dianne","family":"Cook","sequence":"additional","affiliation":[{"name":"Department of Econometrics and Business Statistics, Monash University, Melbourne, Australia;"}]},{"given":"Eun-Kyung","family":"Lee","sequence":"additional","affiliation":[{"name":"Department of Statistics, Ewha Womans University, Seoul, Republic of Korea"}]}],"member":"301","published-online":{"date-parts":[[2021,2,16]]},"reference":[{"key":"e_1_3_3_2_1","doi-asserted-by":"publisher","DOI":"10.1162\/neco.1997.9.7.1545"},{"key":"e_1_3_3_3_1","volume-title":"Measure Theory and Probability Theory, Springer Texts in Statistics","author":"Athreya K. B.","year":"2006","unstructured":"Athreya, K. B., and Lahiri, S. N. (2006), Measure Theory and Probability Theory, Springer Texts in Statistics, Berlin, Heidelberg: Springer-Verlag."},{"key":"e_1_3_3_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00058655"},{"key":"e_1_3_3_5_1","doi-asserted-by":"publisher","DOI":"10.1214\/aos\/1032181158"},{"key":"e_1_3_3_6_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1010933404324"},{"key":"e_1_3_3_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00994660"},{"key":"e_1_3_3_8_1","unstructured":"Chang W. Luraschi J. and Mastny T. (2019) \u201cprofvis: Interactive Visualizations for Profiling R Code \u201d R Package Version 0.3.6 available at https:\/\/CRAN.R-project.org\/package=profvis."},{"key":"e_1_3_3_9_1","doi-asserted-by":"publisher","DOI":"10.6339\/JDS.2007.05(2).307"},{"key":"e_1_3_3_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00994018"},{"key":"e_1_3_3_11_1","unstructured":"da Silva N. Lee E.-K. and Cook D. (2018) \u201cPPforest: Projection Pursuit Classification Forest \u201d R Package Version 0.1.1 available at https:\/\/CRAN.R-project.org\/package=PPforest."},{"key":"e_1_3_3_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-00580-0_3"},{"key":"e_1_3_3_13_1","doi-asserted-by":"publisher","DOI":"10.18637\/jss.v040.i08"},{"key":"e_1_3_3_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/T-C.1974.224051"},{"key":"e_1_3_3_16_1","doi-asserted-by":"publisher","DOI":"10.1198\/016214501753168271"},{"key":"e_1_3_3_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/B978-0-12-498150-8.50024-0"},{"key":"e_1_3_3_18_1","doi-asserted-by":"publisher","DOI":"10.18637\/jss.v083.i08"},{"key":"e_1_3_3_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11222-009-9131-1"},{"key":"e_1_3_3_20_1","doi-asserted-by":"publisher","DOI":"10.1198\/106186005X77702"},{"key":"e_1_3_3_21_1","doi-asserted-by":"publisher","DOI":"10.1214\/13-EJS810"},{"key":"e_1_3_3_22_1","unstructured":"Lichman M. (2013) \u201cUCI Machine Learning Repository \u201d available at http:\/\/archive.ics.uci.edu\/ml."},{"key":"e_1_3_3_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-23783-6_29"},{"key":"e_1_3_3_24_1","unstructured":"Olaf Mersmann. (2019) \u201cmicrobenchmark: Accurate Timing Functions \u201d R package version 1.4\u20137 available at https:\/\/CRAN.R-project.org\/package=microbenchmark"},{"key":"e_1_3_3_25_1","doi-asserted-by":"publisher","DOI":"10.1101\/gr.138461.112"},{"key":"e_1_3_3_26_1","volume-title":"R: A Language and Environment for Statistical Computing","author":"R Core Team","year":"2020","unstructured":"R Core Team (2020), R: A Language and Environment for Statistical Computing, Vienna, Austria: R Foundation for Statistical Computing, available at https:\/\/www.R-project.org\/."},{"key":"e_1_3_3_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-07212-8_11"},{"key":"e_1_3_3_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30549-1_105"},{"key":"e_1_3_3_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/11925231_56"},{"key":"e_1_3_3_30_1","unstructured":"Therneau T. Atkinson B. and Ripley B. (2017) \u201crpart: Recursive Partitioning and Regression Trees \u201d R Package Version 4.1-11 available at https:\/\/CRAN.R-project.org\/package=rpart."},{"key":"e_1_3_3_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/34.709601"},{"key":"e_1_3_3_32_1","unstructured":"Truong A. (2009) \u201cFast Growing and Interpretable Oblique Trees via Probabilistic Models \u201d Univ. of Oxford A thesis submitted for the degree of Doctor of Philosophy Trinity term pp. 1\u2013119."},{"key":"e_1_3_3_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-98141-3"},{"key":"e_1_3_3_34_1","unstructured":"Wickham H. Fran\u00e7ois R. Henry L. and M\u00fcller K. (2020) \u201cdplyr: A Grammar of Data Manipulation \u201d R Package Version 1.0.0 available at https:\/\/CRAN.R-project.org\/package=dplyr."},{"key":"e_1_3_3_35_1","volume-title":"Dynamic Documents With R and knitr","author":"Xie Y.","year":"2015","unstructured":"Xie, Y. (2015), Dynamic Documents With R and knitr (2nd ed.), Boca Raton, FL: Chapman and Hall\/CRC, available at http:\/\/yihui.name\/knitr\/.","edition":"2"}],"container-title":["Journal of Computational and Graphical Statistics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/10618600.2020.1870480","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,11]],"date-time":"2024-07-11T11:12:51Z","timestamp":1720696371000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.tandfonline.com\/doi\/full\/10.1080\/10618600.2020.1870480"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,2,16]]},"references-count":33,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2021,10,2]]}},"alternative-id":["10.1080\/10618600.2020.1870480"],"URL":"https:\/\/doi.org\/10.1080\/10618600.2020.1870480","relation":{},"ISSN":["1061-8600","1537-2715"],"issn-type":[{"value":"1061-8600","type":"print"},{"value":"1537-2715","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,2,16]]},"assertion":[{"value":"The publishing and review policy for this title is described in its Aims & Scope.","order":1,"name":"peerreview_statement","label":"Peer Review Statement"},{"value":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=ucgs20","URL":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=ucgs20","order":2,"name":"aims_and_scope_url","label":"Aim & Scope"},{"value":"2018-07-19","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2020-12-18","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-02-16","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}