{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,4]],"date-time":"2026-07-04T08:18:32Z","timestamp":1783153112628,"version":"3.54.6"},"reference-count":36,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2027,5,25]],"date-time":"2027-05-25T00:00:00Z","timestamp":1811203200000},"content-version":"am","delay-in-days":266,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Neurocomputing"],"published-print":{"date-parts":[[2026,9]]},"DOI":"10.1016\/j.neucom.2026.134019","type":"journal-article","created":{"date-parts":[[2026,5,19]],"date-time":"2026-05-19T15:51:55Z","timestamp":1779205915000},"page":"134019","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["GGBoost: Graph-split gradient boosting trees"],"prefix":"10.1016","volume":"695","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2875-3672","authenticated-orcid":false,"given":"Isaac Alan","family":"Diaz-Ray","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shuren","family":"He","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lihao","family":"Yin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ligang","family":"Lu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1405-6390","authenticated-orcid":false,"given":"Huiyan","family":"Sang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.neucom.2026.134019_bib0005","doi-asserted-by":"crossref","first-page":"507","DOI":"10.52202\/068431-0037","article-title":"Why do tree-based models still outperform deep learning on typical tabular data?","volume":"35","author":"Grinsztajn","year":"2022","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"10.1016\/j.neucom.2026.134019_bib0010","series-title":"Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","first-page":"785","article-title":"XGBoost: a scalable tree boosting system","author":"Chen","year":"2016"},{"key":"10.1016\/j.neucom.2026.134019_bib0015","first-page":"3146","article-title":"LightGBM: a highly efficient gradient boosting decision tree","volume":"30","author":"Ke","year":"2017","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"10.1016\/j.neucom.2026.134019_bib0020","author":"Dorogush"},{"key":"10.1016\/j.neucom.2026.134019_bib0025","first-page":"1","article-title":"Intrinsic Gaussian process on unknown manifolds with probabilistic metrics","volume":"24","author":"Niu","year":"2023","journal-title":"J. Mach. Learn. Res."},{"key":"10.1016\/j.neucom.2026.134019_bib0030","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1214\/18-AOAS1205","article-title":"Prediction models for network-linked data","volume":"13","author":"Li","year":"2019","journal-title":"Ann. Appl. Stat."},{"key":"10.1016\/j.neucom.2026.134019_bib0035","doi-asserted-by":"crossref","first-page":"110451","DOI":"10.1109\/ACCESS.2021.3102239","article-title":"A review and experimental comparison of multivariate decision trees","volume":"9","author":"Ca\u00f1ete-Sifuentes","year":"2021","journal-title":"IEEE Access"},{"key":"10.1016\/j.neucom.2026.134019_bib0040","series-title":"Mexican International Conference on Artificial Intelligence","first-page":"593","article-title":"Decision forests with oblique decision trees","author":"Tan","year":"2006"},{"key":"10.1016\/j.neucom.2026.134019_bib0045","series-title":"Proceedings of the 37th International Conference on Machine Learning, 119 Proceedings of Machine Learning Research","first-page":"11398","article-title":"Smaller, more accurate regression forests using tree alternating optimization","author":"Zharmagambetov","year":"2020"},{"key":"10.1016\/j.neucom.2026.134019_bib0050","doi-asserted-by":"crossref","first-page":"617","DOI":"10.3390\/e24050617","article-title":"Random RotBoost: an ensemble classification method based on rotation forest and AdaBoost in random subsets and its application to clinical decision support","volume":"24","author":"Lee","year":"2022","journal-title":"Entropy"},{"key":"10.1016\/j.neucom.2026.134019_bib0055","first-page":"1","article-title":"Sparse oblique decision trees: a tool to understand and manipulate neural net features","author":"Hada","year":"2023","journal-title":"Data Min. Knowl. Discov."},{"key":"10.1016\/j.neucom.2026.134019_bib0060","first-page":"1","article-title":"AddiVortes:Bayesian additive voronoi tessellations","author":"Stone","year":"2024","journal-title":"J. Comput. Graph. Stat."},{"key":"10.1016\/j.neucom.2026.134019_bib0065","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1080\/00401706.2024.2421752","article-title":"Modeling crash risk on roadway networks using Bayesian regression trees","volume":"67","author":"Dahl","year":"2025","journal-title":"Technometrics"},{"key":"10.1016\/j.neucom.2026.134019_bib0070","doi-asserted-by":"crossref","first-page":"665","DOI":"10.1080\/01621459.2021.1950003","article-title":"Random forests for spatially dependent data","volume":"118","author":"Saha","year":"2023","journal-title":"J. Am. Stat. Assoc."},{"key":"10.1016\/j.neucom.2026.134019_bib0075","series-title":"International Conference on Machine Learning","first-page":"14509","article-title":"BAMDT: Bayesian additive semi-multivariate decision trees for nonparametric regression","author":"Luo","year":"2022"},{"key":"10.1016\/j.neucom.2026.134019_bib0080","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1214\/09-AOAS285","article-title":"BART: Bayesian additive regression trees","volume":"4","author":"Chipman","year":"2010","journal-title":"Ann. Appl. Stat."},{"key":"10.1016\/j.neucom.2026.134019_bib0085","doi-asserted-by":"crossref","first-page":"711","DOI":"10.1093\/biomet\/82.4.711","article-title":"Reversible jump Markov chain Monte Carlo computation and Bayesian model determination","volume":"82","author":"Green","year":"1995","journal-title":"Biometrika"},{"key":"10.1016\/j.neucom.2026.134019_bib0090","doi-asserted-by":"crossref","first-page":"1050","DOI":"10.1080\/01621459.2018.1529595","article-title":"Spatial homogeneity pursuit of regression coefficients for large datasets","volume":"114","author":"Li","year":"2019","journal-title":"J. Am. Stat. Assoc."},{"key":"10.1016\/j.neucom.2026.134019_bib0095","first-page":"1","article-title":"Bayesian space-time partitioning by sampling and pruning spanning trees","volume":"20","author":"Teixeira","year":"2019","journal-title":"J. Mach. Learn. Res."},{"key":"10.1016\/j.neucom.2026.134019_bib0100","first-page":"1","article-title":"A Bayesian contiguous partitioning method for learning clustered latent variables","volume":"22","author":"Luo","year":"2021","journal-title":"J. Mach. Learn. Res."},{"key":"10.1016\/j.neucom.2026.134019_bib0105","series-title":"Proceedings of the Sixteenth Annual Symposium on Computational Geometry","first-page":"341","article-title":"Delaunay triangulations and voronoi diagrams for riemannian manifolds","author":"Leibon","year":"2000"},{"key":"10.1016\/j.neucom.2026.134019_bib0110","doi-asserted-by":"crossref","first-page":"637","DOI":"10.1137\/S0036144599352836","article-title":"Centroidal voronoi tessellations: applications and algorithms","volume":"41","author":"Du","year":"1999","journal-title":"SIAM Rev."},{"key":"10.1016\/j.neucom.2026.134019_bib0115","series-title":"Spatial Tessellations: Concepts and Applications of Voronoi Diagrams","author":"Boots","year":"2009"},{"key":"10.1016\/j.neucom.2026.134019_bib0120","series-title":"Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing","first-page":"296","article-title":"Generating random spanning trees more quickly than the cover time","author":"Wilson","year":"1996"},{"key":"10.1016\/j.neucom.2026.134019_bib0125","series-title":"Pdp: An R package for Constructing Partial Dependence Plots","author":"Greenwell","year":"2017"},{"key":"10.1016\/j.neucom.2026.134019_bib0130","doi-asserted-by":"crossref","first-page":"3738","DOI":"10.1214\/17-EJS1327","article-title":"Fitting the linear preferential attachment model","volume":"11","author":"Wan","year":"2017","journal-title":"Electron. J. Stat."},{"key":"10.1016\/j.neucom.2026.134019_bib0135","doi-asserted-by":"crossref","first-page":"1295","DOI":"10.1111\/rssb.12233","article-title":"Sparse graphs using exchangeable random measures","volume":"79","author":"Caron","year":"2017","journal-title":"J. R. Stat. Soc. B Stat. Methodol."},{"key":"10.1016\/j.neucom.2026.134019_bib0140","doi-asserted-by":"crossref","DOI":"10.1103\/PhysRevE.70.066111","article-title":"Finding community structure in very large networks","volume":"70","author":"Clauset","year":"2004","journal-title":"Phys. Rev. E"},{"key":"10.1016\/j.neucom.2026.134019_bib0145","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1023\/A:1010933404324","article-title":"Random forests","volume":"45","author":"Breiman","year":"2001","journal-title":"Mach. Learn."},{"key":"10.1016\/j.neucom.2026.134019_bib0150","author":"Jeong"},{"key":"10.1016\/j.neucom.2026.134019_bib0155","unstructured":"M. Kuhn, Caret: Classification and Regression Training, 2021. R package version 6.0-90."},{"key":"10.1016\/j.neucom.2026.134019_bib0160","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1111\/j.0016-7363.2005.00671.x","article-title":"GeoDa: an introduction to spatial data analysis","volume":"38","author":"Anselin","year":"2006","journal-title":"Geogr. Anal."},{"key":"10.1016\/j.neucom.2026.134019_bib0165","first-page":"93","article-title":"Collective classification in network data","volume":"29","author":"Sen","year":"2008","journal-title":"AI Mag."},{"key":"10.1016\/j.neucom.2026.134019_bib0170","series-title":"Machine Learning and Knowledge Discovery in Databases","first-page":"453","article-title":"On oblique random forests","author":"Menze","year":"2011"},{"key":"10.1016\/j.neucom.2026.134019_bib0175","doi-asserted-by":"crossref","first-page":"861","DOI":"10.21105\/joss.00861","article-title":"UMAP: uniform manifold approximation and projection","volume":"3","author":"McInnes","year":"2018","journal-title":"J. Open Source Softw."},{"key":"10.1016\/j.neucom.2026.134019_bib0180","series-title":"The 22nd International Conference on Artificial Intelligence and Statistics","first-page":"1506","article-title":"Fast and robust shortest paths on manifolds learned from data","author":"Arvanitidis","year":"2019"}],"container-title":["Neurocomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0925231226014177?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0925231226014177?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,7,4]],"date-time":"2026-07-04T07:47:01Z","timestamp":1783151221000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0925231226014177"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,9]]},"references-count":36,"alternative-id":["S0925231226014177"],"URL":"https:\/\/doi.org\/10.1016\/j.neucom.2026.134019","relation":{},"ISSN":["0925-2312"],"issn-type":[{"value":"0925-2312","type":"print"}],"subject":[],"published":{"date-parts":[[2026,9]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"GGBoost: Graph-split gradient boosting trees","name":"articletitle","label":"Article Title"},{"value":"Neurocomputing","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.neucom.2026.134019","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"134019"}}