<efrbr:recordSet xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:efrbr="http://vfrbr.info/efrbr/1.1" xmlns:efrbr-work="http://vfrbr.info/efrbr/1.1/work" xmlns:efrbr-expression="http://vfrbr.info/efrbr/1.1/expression" xmlns:efrbr-manifestation="http://vfrbr.info/efrbr/1.1/manifestation" xmlns:efrbr-person="http://vfrbr.info/efrbr/1.1/person" xmlns:efrbr-corporateBody="http://vfrbr.info/efrbr/1.1/corporateBody" xmlns:efrbr-concept="http://vfrbr.info/efrbr/1.1/concept" xmlns:efrbr-structure="http://vfrbr.info/efrbr/1.1/structure" xmlns:efrbr-responsible="http://vfrbr.info/efrbr/1.1/responsible" xmlns:efrbr-subject="http://vfrbr.info/efrbr/1.1/subject" xmlns:efrbr-other="http://vfrbr.info/efrbr/1.1/other" xsi:schemaLocation="http://vfrbr.info/efrbr/1.1 http://vfrbr.info/schemas/1.1/efrbr.xsd"><efrbr:entities><efrbr-work:work identifier="http://purl.tuc.gr/dl/dias/04355E5F-CBEB-4FC0-A75C-59EF43C5C18F"><efrbr-work:titleOfTheWork>Building decision trees with constraints</efrbr-work:titleOfTheWork></efrbr-work:work><efrbr-expression:expression identifier="http://purl.tuc.gr/dl/dias/04355E5F-CBEB-4FC0-A75C-59EF43C5C18F"><efrbr-expression:titleOfTheExpression>Building decision trees with constraints</efrbr-expression:titleOfTheExpression><efrbr-expression:formOfExpression vocabulary="DIAS:TYPES">
            Peer-Reviewed Journal Publication
            Δημοσίευση σε Περιοδικό με Κριτές
         </efrbr-expression:formOfExpression><efrbr-expression:dateOfExpression type="issued">2015-10-29</efrbr-expression:dateOfExpression><efrbr-expression:dateOfExpression type="published">2003</efrbr-expression:dateOfExpression><efrbr-expression:languageOfExpression vocabulary="iso639-1">en</efrbr-expression:languageOfExpression><efrbr-expression:summarizationOfContent>Classification is an important problem in data mining. Given a database of records, each with a class label, a classifier generates a concise and meaningful description for each class that can be used to classify subsequent records. A number of popular classifiers construct decision trees to generate class models. Frequently, however, the constructed trees are complex with hundreds of nodes and thus difficult to comprehend, a fact that calls into question an often-cited benefit that decision trees are easy to interpret. In this paper, we address the problem of constructing “simple” decision trees with few nodes that are easy for humans to interpret. By permitting users to specify constraints on tree size or accuracy, and then building the “best” tree that satisfies the constraints, we ensure that the final tree is both easy to understand and has good accuracy. We develop novel branch-and-bound algorithms for pushing the constraints into the building phase of classifiers, and pruning early tree nodes that cannot possibly satisfy the constraints. Our experimental results with real-life and synthetic data sets demonstrate that significant performance speedups and reductions in the number of nodes expanded can be achieved as a result of incorporating knowledge of the constraints into the building step as opposed to applying the constraints after the entire tree is built.</efrbr-expression:summarizationOfContent><efrbr-expression:useRestrictionsOnTheExpression type="creative-commons">http://creativecommons.org/licenses/by/4.0/</efrbr-expression:useRestrictionsOnTheExpression><efrbr-expression:note type="journal name">Data Mining and Knowledge Discovery</efrbr-expression:note><efrbr-expression:note type="journal volume">7</efrbr-expression:note><efrbr-expression:note type="journal number">2</efrbr-expression:note><efrbr-expression:note type="page range">187-214</efrbr-expression:note></efrbr-expression:expression><efrbr-person:person identifier="http://users.isc.tuc.gr/~mgarofalakis"><efrbr-person:nameOfPerson vocabulary="TUC:LDAP">
            Garofalakis Minos
            Γαροφαλακης Μινως
         </efrbr-person:nameOfPerson></efrbr-person:person><efrbr-person:person identifier="29F225F8-6209-4CFE-BECF-E813A02CC5B1"><efrbr-person:nameOfPerson vocabulary="">
            Hyun Dongjoon 
         </efrbr-person:nameOfPerson></efrbr-person:person><efrbr-person:person identifier="A10FCF9D-1609-40AF-B640-DB26F384CC9D"><efrbr-person:nameOfPerson vocabulary="">
            Rastogi Rajeev
         </efrbr-person:nameOfPerson></efrbr-person:person><efrbr-person:person identifier="B9F22777-9C18-45A4-ABF2-387025BB07FA"><efrbr-person:nameOfPerson vocabulary="">
            Shim Kyuseok
         </efrbr-person:nameOfPerson></efrbr-person:person><efrbr-corporateBody:corporateBody identifier="http://www.wkap.nl/"><efrbr-corporateBody:nameOfTheCorporateBody vocabulary="S/R:PUBLISHERS">
            Kluwer
         </efrbr-corporateBody:nameOfTheCorporateBody></efrbr-corporateBody:corporateBody><efrbr-concept:concept identifier="http://id.loc.gov/authorities/subjects/sh97002073"><efrbr-concept:termForTheConcept>
            Algorithmic knowledge discovery
            Factual data analysis
            KDD (Information retrieval)
            Knowledge discovery in data
            Knowledge discovery in databases
            Mining, Data
            data mining
            algorithmic knowledge discovery
            factual data analysis
            kdd information retrieval
            knowledge discovery in data
            knowledge discovery in databases
            mining data
         </efrbr-concept:termForTheConcept></efrbr-concept:concept><efrbr-concept:concept identifier="D978C409-4B2B-4557-BEE8-2FDE74FF4E20"><efrbr-concept:termForTheConcept>
            Classification 
         </efrbr-concept:termForTheConcept></efrbr-concept:concept><efrbr-concept:concept identifier="BE15657E-21C7-4103-B25A-3827C5FCDD7A"><efrbr-concept:termForTheConcept>
            Decision tree
         </efrbr-concept:termForTheConcept></efrbr-concept:concept><efrbr-concept:concept identifier="41880EEB-9F39-49F6-80DE-0F4FFC4F1499"><efrbr-concept:termForTheConcept>
            Branch-and-bound algorithm
         </efrbr-concept:termForTheConcept></efrbr-concept:concept><efrbr-concept:concept identifier="8F94940A-5155-4812-B131-CBF70A6D4529"><efrbr-concept:termForTheConcept>
            Constraint
         </efrbr-concept:termForTheConcept></efrbr-concept:concept></efrbr:entities><efrbr:relationships><efrbr-structure:structureRelations><efrbr-structure:realizedThrough sourceEntity="work" targetEntity="expression" sourceURI="http://purl.tuc.gr/dl/dias/04355E5F-CBEB-4FC0-A75C-59EF43C5C18F" targetURI="http://purl.tuc.gr/dl/dias/04355E5F-CBEB-4FC0-A75C-59EF43C5C18F"/></efrbr-structure:structureRelations><efrbr-responsible:responsibleRelations><efrbr-responsible:createdBy sourceEntity="work" targetEntity="person" sourceURI="http://purl.tuc.gr/dl/dias/04355E5F-CBEB-4FC0-A75C-59EF43C5C18F" targetURI="http://users.isc.tuc.gr/~mgarofalakis"/><efrbr-responsible:realizedBy sourceEntity="expression" role="author" targetEntity="person" sourceURI="http://purl.tuc.gr/dl/dias/04355E5F-CBEB-4FC0-A75C-59EF43C5C18F" targetURI="http://users.isc.tuc.gr/~mgarofalakis"/><efrbr-responsible:realizedBy sourceEntity="expression" role="author" targetEntity="person" sourceURI="http://purl.tuc.gr/dl/dias/04355E5F-CBEB-4FC0-A75C-59EF43C5C18F" targetURI="29F225F8-6209-4CFE-BECF-E813A02CC5B1"/><efrbr-responsible:realizedBy sourceEntity="expression" role="author" targetEntity="person" sourceURI="http://purl.tuc.gr/dl/dias/04355E5F-CBEB-4FC0-A75C-59EF43C5C18F" targetURI="A10FCF9D-1609-40AF-B640-DB26F384CC9D"/><efrbr-responsible:realizedBy sourceEntity="expression" role="author" targetEntity="person" sourceURI="http://purl.tuc.gr/dl/dias/04355E5F-CBEB-4FC0-A75C-59EF43C5C18F" targetURI="B9F22777-9C18-45A4-ABF2-387025BB07FA"/><efrbr-responsible:realizedBy sourceEntity="expression" role="publisher" targetEntity="person" sourceURI="http://purl.tuc.gr/dl/dias/04355E5F-CBEB-4FC0-A75C-59EF43C5C18F" targetURI="http://www.wkap.nl/"/></efrbr-responsible:responsibleRelations><efrbr-subject:subjectRelations><efrbr-subject:hasSubject sourceEntity="work" targetEntity="concept" sourceURI="http://purl.tuc.gr/dl/dias/04355E5F-CBEB-4FC0-A75C-59EF43C5C18F" targetURI="http://id.loc.gov/authorities/subjects/sh97002073"/><efrbr-subject:hasSubject sourceEntity="work" targetEntity="concept" sourceURI="http://purl.tuc.gr/dl/dias/04355E5F-CBEB-4FC0-A75C-59EF43C5C18F" targetURI="D978C409-4B2B-4557-BEE8-2FDE74FF4E20"/><efrbr-subject:hasSubject sourceEntity="work" targetEntity="concept" sourceURI="http://purl.tuc.gr/dl/dias/04355E5F-CBEB-4FC0-A75C-59EF43C5C18F" targetURI="BE15657E-21C7-4103-B25A-3827C5FCDD7A"/><efrbr-subject:hasSubject sourceEntity="work" targetEntity="concept" sourceURI="http://purl.tuc.gr/dl/dias/04355E5F-CBEB-4FC0-A75C-59EF43C5C18F" targetURI="41880EEB-9F39-49F6-80DE-0F4FFC4F1499"/><efrbr-subject:hasSubject sourceEntity="work" targetEntity="concept" sourceURI="http://purl.tuc.gr/dl/dias/04355E5F-CBEB-4FC0-A75C-59EF43C5C18F" targetURI="8F94940A-5155-4812-B131-CBF70A6D4529"/></efrbr-subject:subjectRelations><efrbr-other:otherRelations/></efrbr:relationships></efrbr:recordSet>