<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/D14B8DFA-E40B-458A-9B24-BEA3BD7B3FB6"><efrbr-work:titleOfTheWork>Optimization of nearest neighbor classifiers via metaheuristic algorithms for credit risk assessment</efrbr-work:titleOfTheWork></efrbr-work:work><efrbr-expression:expression identifier="http://purl.tuc.gr/dl/dias/D14B8DFA-E40B-458A-9B24-BEA3BD7B3FB6"><efrbr-expression:titleOfTheExpression>Optimization of nearest neighbor classifiers via metaheuristic algorithms for credit risk assessment</efrbr-expression:titleOfTheExpression><efrbr-expression:formOfExpression vocabulary="DIAS:TYPES">
            Peer-Reviewed Journal Publication
            Δημοσίευση σε Περιοδικό με Κριτές
         </efrbr-expression:formOfExpression><efrbr-expression:dateOfExpression type="issued">2015-11-18</efrbr-expression:dateOfExpression><efrbr-expression:dateOfExpression type="published">2008</efrbr-expression:dateOfExpression><efrbr-expression:languageOfExpression vocabulary="iso639-1">en</efrbr-expression:languageOfExpression><efrbr-expression:summarizationOfContent>The classification problem consists of using some known objects, usually described by a large vector of features, to induce a model that classifies others into known classes. The present paper deals with the optimization of Nearest Neighbor Classifiers via Metaheuristic Algorithms. The Metaheuristic Algorithms used include tabu search, genetic algorithms and ant colony optimization. The performance of the proposed algorithms is tested using data from 1411 firms derived from the loan portfolio of a leading Greek Commercial Bank in order to classify the firms in different groups representing different levels of credit risk. Also, a comparison of the algorithm with other methods such as UTADIS, SVM, CART, and other classification methods is performed using these data.</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">Journal of Global Optimization</efrbr-expression:note><efrbr-expression:note type="journal volume">42</efrbr-expression:note><efrbr-expression:note type="journal number">2</efrbr-expression:note><efrbr-expression:note type="page range">279-293</efrbr-expression:note></efrbr-expression:expression><efrbr-person:person identifier="http://users.isc.tuc.gr/~kzopounidis"><efrbr-person:nameOfPerson vocabulary="TUC:LDAP">
            Zopounidis Konstantinos
            Ζοπουνιδης Κωνσταντινος
         </efrbr-person:nameOfPerson></efrbr-person:person><efrbr-person:person identifier="http://users.isc.tuc.gr/~mdoubos"><efrbr-person:nameOfPerson vocabulary="TUC:LDAP">
            Michael Doumpos
            Δουμπος Μιχαλης
         </efrbr-person:nameOfPerson></efrbr-person:person><efrbr-person:person identifier="http://users.isc.tuc.gr/~mmarinaki"><efrbr-person:nameOfPerson vocabulary="TUC:LDAP">
            Marinaki Magdalini
            Μαρινακη Μαγδαληνη
         </efrbr-person:nameOfPerson></efrbr-person:person><efrbr-person:person identifier="http://users.isc.tuc.gr/~imarinakis"><efrbr-person:nameOfPerson vocabulary="TUC:LDAP">
            Marinakis Ioannis
            Μαρινακης Ιωαννης
         </efrbr-person:nameOfPerson></efrbr-person:person><efrbr-person:person identifier="http://users.isc.tuc.gr/~nmatsatsinis"><efrbr-person:nameOfPerson vocabulary="TUC:LDAP">
            Matsatsinis Nikolaos
            Ματσατσινης Νικολαος
         </efrbr-person:nameOfPerson></efrbr-person:person><efrbr-corporateBody:corporateBody identifier="http://www.springerlink.com/?MUD=MP"><efrbr-corporateBody:nameOfTheCorporateBody vocabulary="S/R:PUBLISHERS">
            Springer Verlag
         </efrbr-corporateBody:nameOfTheCorporateBody></efrbr-corporateBody:corporateBody><efrbr-concept:concept identifier="5B8931E5-D732-4C39-A25D-FCE7F541F80E"><efrbr-concept:termForTheConcept>
            Metaheuristic algorithms 
         </efrbr-concept:termForTheConcept></efrbr-concept:concept><efrbr-concept:concept identifier="6C37B957-5C93-481A-834C-0A22F6A57F01"><efrbr-concept:termForTheConcept>
            Feature selection
         </efrbr-concept:termForTheConcept></efrbr-concept:concept><efrbr-concept:concept identifier="24C09756-8B2A-4415-B743-F9B1D8D3D612"><efrbr-concept:termForTheConcept>
            Credit risk assessment
         </efrbr-concept:termForTheConcept></efrbr-concept:concept><efrbr-concept:concept identifier="9E00F182-2719-445A-832F-EA177AEDBE89"><efrbr-concept:termForTheConcept>
            Classification 
         </efrbr-concept:termForTheConcept></efrbr-concept:concept></efrbr:entities><efrbr:relationships><efrbr-structure:structureRelations><efrbr-structure:realizedThrough sourceEntity="work" sourceURI="http://purl.tuc.gr/dl/dias/D14B8DFA-E40B-458A-9B24-BEA3BD7B3FB6" targetEntity="expression" targetURI="http://purl.tuc.gr/dl/dias/D14B8DFA-E40B-458A-9B24-BEA3BD7B3FB6"/></efrbr-structure:structureRelations><efrbr-responsible:responsibleRelations><efrbr-responsible:createdBy sourceEntity="work" sourceURI="http://purl.tuc.gr/dl/dias/D14B8DFA-E40B-458A-9B24-BEA3BD7B3FB6" targetEntity="person" targetURI="http://users.isc.tuc.gr/~kzopounidis"/><efrbr-responsible:realizedBy sourceEntity="expression" sourceURI="http://purl.tuc.gr/dl/dias/D14B8DFA-E40B-458A-9B24-BEA3BD7B3FB6" targetEntity="person" targetURI="http://users.isc.tuc.gr/~kzopounidis" role="author"/><efrbr-responsible:realizedBy sourceEntity="expression" sourceURI="http://purl.tuc.gr/dl/dias/D14B8DFA-E40B-458A-9B24-BEA3BD7B3FB6" targetEntity="person" targetURI="http://users.isc.tuc.gr/~mdoubos" role="author"/><efrbr-responsible:realizedBy sourceEntity="expression" sourceURI="http://purl.tuc.gr/dl/dias/D14B8DFA-E40B-458A-9B24-BEA3BD7B3FB6" targetEntity="person" targetURI="http://users.isc.tuc.gr/~mmarinaki" role="author"/><efrbr-responsible:realizedBy sourceEntity="expression" sourceURI="http://purl.tuc.gr/dl/dias/D14B8DFA-E40B-458A-9B24-BEA3BD7B3FB6" targetEntity="person" targetURI="http://users.isc.tuc.gr/~imarinakis" role="author"/><efrbr-responsible:realizedBy sourceEntity="expression" sourceURI="http://purl.tuc.gr/dl/dias/D14B8DFA-E40B-458A-9B24-BEA3BD7B3FB6" targetEntity="person" targetURI="http://users.isc.tuc.gr/~nmatsatsinis" role="author"/><efrbr-responsible:realizedBy sourceEntity="expression" sourceURI="http://purl.tuc.gr/dl/dias/D14B8DFA-E40B-458A-9B24-BEA3BD7B3FB6" targetEntity="person" targetURI="http://www.springerlink.com/?MUD=MP" role="publisher"/></efrbr-responsible:responsibleRelations><efrbr-subject:subjectRelations><efrbr-subject:hasSubject sourceEntity="work" sourceURI="http://purl.tuc.gr/dl/dias/D14B8DFA-E40B-458A-9B24-BEA3BD7B3FB6" targetEntity="concept" targetURI="5B8931E5-D732-4C39-A25D-FCE7F541F80E"/><efrbr-subject:hasSubject sourceEntity="work" sourceURI="http://purl.tuc.gr/dl/dias/D14B8DFA-E40B-458A-9B24-BEA3BD7B3FB6" targetEntity="concept" targetURI="6C37B957-5C93-481A-834C-0A22F6A57F01"/><efrbr-subject:hasSubject sourceEntity="work" sourceURI="http://purl.tuc.gr/dl/dias/D14B8DFA-E40B-458A-9B24-BEA3BD7B3FB6" targetEntity="concept" targetURI="24C09756-8B2A-4415-B743-F9B1D8D3D612"/><efrbr-subject:hasSubject sourceEntity="work" sourceURI="http://purl.tuc.gr/dl/dias/D14B8DFA-E40B-458A-9B24-BEA3BD7B3FB6" targetEntity="concept" targetURI="9E00F182-2719-445A-832F-EA177AEDBE89"/></efrbr-subject:subjectRelations><efrbr-other:otherRelations/></efrbr:relationships></efrbr:recordSet>