{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T20:40:57Z","timestamp":1760647257705,"version":"3.37.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030474256"},{"type":"electronic","value":"9783030474263"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-47426-3_18","type":"book-chapter","created":{"date-parts":[[2020,5,8]],"date-time":"2020-05-08T06:02:49Z","timestamp":1588917769000},"page":"222-234","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Hierarchical Gradient Smoothing for Probability Estimation Trees"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9851-9414","authenticated-orcid":false,"given":"He","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5334-3574","authenticated-orcid":false,"given":"Fran\u00e7ois","family":"Petitjean","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9292-1015","authenticated-orcid":false,"given":"Wray","family":"Buntine","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,5,6]]},"reference":[{"key":"18_CR1","doi-asserted-by":"crossref","unstructured":"Bostrom, H.: Estimating class probabilities in random forests. In: 2007 Sixth International Conference on Machine Learning and Applications (ICMLA 2007), pp. 211\u2013216. IEEE (2007)","DOI":"10.1109\/ICMLA.2007.64"},{"issue":"4","key":"18_CR2","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1006\/csla.1999.0128","volume":"13","author":"SF Chen","year":"1999","unstructured":"Chen, S.F., Goodman, J.: An empirical study of smoothing techniques for language modeling. Comput. Speech Lang. 13(4), 359\u2013394 (1999)","journal-title":"Comput. Speech Lang."},{"key":"18_CR3","unstructured":"Dua, D., Graff, C.: UCI machine learning repository (2017)"},{"key":"18_CR4","unstructured":"Elkan, C.: The foundations of cost-sensitive learning. In: International Joint Conference on Artificial Intelligence, vol. 17, pp. 973\u2013978. Lawrence Erlbaum Associates Ltd (2001)"},{"key":"18_CR5","unstructured":"Ferri, C., Flach, P., Hern\u00e1ndez-Orallo, J.: Decision trees for ranking: effect of new smoothing methods, new splitting criteria and simple pruning methods. Technical report DSIC 2003 (2003)"},{"key":"18_CR6","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/978-3-540-39857-8_13","volume-title":"Machine Learning: ECML 2003","author":"C Ferri","year":"2003","unstructured":"Ferri, C., Flach, P.A., Hern\u00e1ndez-Orallo, J.: Improving the AUC of probabilistic estimation trees. In: Lavra\u010d, N., Gamberger, D., Blockeel, H., Todorovski, L. (eds.) ECML 2003. LNCS (LNAI), vol. 2837, pp. 121\u2013132. Springer, Heidelberg (2003). \nhttps:\/\/doi.org\/10.1007\/978-3-540-39857-8_13"},{"key":"18_CR7","unstructured":"Joulani, P., Gyorgy, A., Szepesv\u00e1ri, C.: Fast cross-validation for incremental learning. In: Twenty-Fourth International Joint Conference on Artificial Intelligence (2015)"},{"key":"18_CR8","unstructured":"Kneser, R., Ney, H.: Improved backing-off for m-gram language modeling. In: ICASSP, vol. 1, p. 181e4 (1995)"},{"key":"18_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1007\/3-540-59286-5_57","volume-title":"Machine Learning: ECML-95","author":"R Kohavi","year":"1995","unstructured":"Kohavi, R.: The power of decision tables. In: Lavrac, N., Wrobel, S. (eds.) ECML 1995. LNCS, vol. 912, pp. 174\u2013189. Springer, Heidelberg (1995). \nhttps:\/\/doi.org\/10.1007\/3-540-59286-5_57"},{"key":"18_CR10","doi-asserted-by":"crossref","unstructured":"Liang, H., Zhang, H., Yan, Y.: Decision trees for probability estimation: an empirical study. In: 2006 18th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2006), pp. 756\u2013764. IEEE (2006)","DOI":"10.1109\/ICTAI.2006.49"},{"key":"18_CR11","unstructured":"Manapragada, C., Webb, G.I., Salehi, M.: Extremely fast decision tree. In: Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining (KDD 2018), pp. 1953\u20131962. ACM, New York, (2018)"},{"issue":"44","key":"18_CR12","doi-asserted-by":"publisher","first-page":"22071","DOI":"10.1073\/pnas.1900654116","volume":"116","author":"WJ Murdoch","year":"2019","unstructured":"Murdoch, W.J., Singh, C., Kumbier, K., Abbasi-Asl, R., Yu, B.: Definitions, methods, and applications in interpretable machine learning. Proc. Nat. Acad. Sci. 116(44), 22071\u201322080 (2019)","journal-title":"Proc. Nat. Acad. Sci."},{"key":"18_CR13","doi-asserted-by":"publisher","first-page":"1303","DOI":"10.1007\/s10994-018-5718-0","volume":"107","author":"F Petitjean","year":"2018","unstructured":"Petitjean, F., Buntine, W., Webb, G.I., Zaidi, N.: Accurate parameter estimation for Bayesian network classifiers using hierarchical Dirichlet processes. Mach. Learn. 107, 1303\u20131331 (2018). \nhttps:\/\/doi.org\/10.1007\/s10994-018-5718-0","journal-title":"Mach. Learn."},{"issue":"3","key":"18_CR14","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1023\/A:1024099825458","volume":"52","author":"F Provost","year":"2003","unstructured":"Provost, F., Domingos, P.: Tree induction for probability-based ranking. Mach. Learn. 52(3), 199\u2013215 (2003). \nhttps:\/\/doi.org\/10.1023\/A:1024099825458","journal-title":"Mach. Learn."},{"key":"18_CR15","unstructured":"Quinlan, J.R.: C4.5: Programs for Machine Learning. The Morgan Kaufmann Series in Machine Learning, San Mateo, Morgan Kaufmann, Burlington (1993)"},{"key":"18_CR16","unstructured":"Ruder, S.: An overview of gradient descent optimization algorithms. arXiv preprint \narXiv:1609.04747\n\n (2016)"},{"key":"18_CR17","doi-asserted-by":"crossref","unstructured":"Shareghi, E., Haffari, G., Cohn, T.: Compressed nonparametric language modelling. In: Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, pp. 2701\u20132707 (2017)","DOI":"10.24963\/ijcai.2017\/376"},{"key":"18_CR18","unstructured":"Shen, Y.: Loss functions for binary classification and class probability estimation. Ph.D. thesis, University of Pennsylvania (2005)"},{"key":"18_CR19","doi-asserted-by":"crossref","unstructured":"Teh, Y.W., Jordan, M.I.: Hierarchical bayesian nonparametric models with applications. In: Bayesian Nonparametrics, vol. 1, pp. 158\u2013207. Cambridge University Press, Cambridge (2010)","DOI":"10.1017\/CBO9780511802478.006"},{"issue":"7","key":"18_CR20","doi-asserted-by":"publisher","first-page":"1137","DOI":"10.1016\/j.jss.2010.01.002","volume":"83","author":"T Wang","year":"2010","unstructured":"Wang, T., Qin, Z., Jin, Z., Zhang, S.: Handling over-fitting in test cost-sensitive decision tree learning by feature selection, smoothing and pruning. J. Syst. Softw. 83(7), 1137\u20131147 (2010)","journal-title":"J. Syst. Softw."},{"key":"18_CR21","doi-asserted-by":"crossref","unstructured":"Zadrozny, B., Elkan, C.: Learning and making decisions when costs and probabilities are both unknown. In: Proceedings of the seventh ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 204\u2013213. ACM (2001)","DOI":"10.1145\/502512.502540"},{"key":"18_CR22","unstructured":"Zadrozny, B., Elkan, C.: Obtaining calibrated probability estimates from decision trees and naive Bayesian classifiers. In: ICML, vol. 1, pp. 609\u2013616. Citeseer (2001)"},{"key":"18_CR23","unstructured":"Zhang, K.: Probability estimation trees: empirical comparison, algorithm extension and applications. Ph.D. thesis, Tulane University (2006)"}],"container-title":["Lecture Notes in Computer Science","Advances in Knowledge Discovery and Data Mining"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-47426-3_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,8]],"date-time":"2020-05-08T08:09:44Z","timestamp":1588925384000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-47426-3_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030474256","9783030474263"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-47426-3_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"6 May 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PAKDD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Pacific-Asia Conference on Knowledge Discovery and Data Mining","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Singapore","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Singapore","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 May 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 May 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pakdd2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.pakdd2020.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"CMT System","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"628","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"135","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"21% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3-4","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"6-8","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The conference was held virtually due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}