{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T01:12:58Z","timestamp":1740100378203,"version":"3.37.3"},"reference-count":7,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,10,20]],"date-time":"2021-10-20T00:00:00Z","timestamp":1634688000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,10,20]],"date-time":"2021-10-20T00:00:00Z","timestamp":1634688000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,10,20]],"date-time":"2021-10-20T00:00:00Z","timestamp":1634688000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100008078","name":"University of Strathclyde","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100008078","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,10,20]]},"DOI":"10.1109\/icstcc52150.2021.9607285","type":"proceedings-article","created":{"date-parts":[[2021,11,18]],"date-time":"2021-11-18T01:12:33Z","timestamp":1637197953000},"page":"530-534","source":"Crossref","is-referenced-by-count":2,"title":["A Chi-Square Based Splitting Criterion Better for the Decision Tree Algorithms"],"prefix":"10.1109","author":[{"given":"Laviniu Aurelian","family":"Badulescu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/s11042-021-10725-2"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-021-02265-x"},{"key":"ref6","first-page":"15","article-title":"Pruning methods and splitting criteria for optimal decision trees algorithms","volume":"13","author":"b?dulescu","year":"2016","journal-title":"Annals of the Univ of Craiova"},{"key":"ref5","first-page":"535","article-title":"An information entropy based splitting criterion better for the Data Mining Decision Tree algorithms","author":"b?dulescu","year":"0","journal-title":"Proc of 22nd International Conference on System Theory Control and Computing (ICSTCC 2018)"},{"journal-title":"Graphical Models Methods for Data Analysis and Mining","year":"2002","author":"borgelt","key":"ref7"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/s11042-021-11114-5"},{"key":"ref1","article-title":"UCI Machine Learning Repository","author":"dua","year":"2019","journal-title":"University of California School of Information and Computer Science"}],"event":{"name":"2021 25th International Conference on System Theory, Control and Computing (ICSTCC)","start":{"date-parts":[[2021,10,20]]},"location":"Iasi, Romania","end":{"date-parts":[[2021,10,23]]}},"container-title":["2021 25th International Conference on System Theory, Control and Computing (ICSTCC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9607028\/9606851\/09607285.pdf?arnumber=9607285","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T16:51:32Z","timestamp":1652201492000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9607285\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,10,20]]},"references-count":7,"URL":"https:\/\/doi.org\/10.1109\/icstcc52150.2021.9607285","relation":{},"subject":[],"published":{"date-parts":[[2021,10,20]]}}}