Show simple item record

Relationships between average depth and number of misclassifications for decision trees

dc.contributor.authorChikalov, Igor
dc.contributor.authorHussain, Shahid
dc.contributor.authorMoshkov, Mikhail
dc.date.accessioned2015-08-03T11:47:35Z
dc.date.available2015-08-03T11:47:35Z
dc.date.issued2014-02-14
dc.identifier.issn01692968
dc.identifier.doi10.3233/FI-2014-957
dc.identifier.urihttp://hdl.handle.net/10754/563398
dc.description.abstractThis paper presents a new tool for the study of relationships between the total path length or the average depth and the number of misclassifications for decision trees. In addition to algorithm, the paper also presents the results of experiments with datasets from UCI ML Repository [9] and datasets representing Boolean functions with 10 variables.
dc.publisherIOS Press
dc.subjectaverage depth
dc.subjectDecision trees
dc.subjectnumber of misclassifications
dc.subjecttotal path length
dc.titleRelationships between average depth and number of misclassifications for decision trees
dc.typeArticle
dc.contributor.departmentApplied Mathematics and Computational Science Program
dc.contributor.departmentComputational Bioscience Research Center (CBRC)
dc.contributor.departmentComputer Science Program
dc.contributor.departmentComputer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
dc.contributor.departmentExtensions of Dynamic Programming, Machine Learning and Discrete Optimization Research Group
dc.contributor.departmentOffice of the VP
dc.identifier.journalFundamenta Informaticae
kaust.personChikalov, Igor
kaust.personHussain, Shahid
kaust.personMoshkov, Mikhail


This item appears in the following Collection(s)

Show simple item record