<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/360A0C4B-2010-4FDE-B0CA-E36F00363B3B"><efrbr-work:titleOfTheWork>A honey bees mating optimization algorithm for the multigroup credit risk assessment problem</efrbr-work:titleOfTheWork></efrbr-work:work><efrbr-expression:expression identifier="http://purl.tuc.gr/dl/dias/360A0C4B-2010-4FDE-B0CA-E36F00363B3B"><efrbr-expression:titleOfTheExpression>A honey bees mating optimization algorithm for the multigroup credit risk assessment problem</efrbr-expression:titleOfTheExpression><efrbr-expression:formOfExpression vocabulary="DIAS:TYPES">
            Πλήρης Δημοσίευση σε Συνέδριο
            Conference Full Paper
         </efrbr-expression:formOfExpression><efrbr-expression:dateOfExpression type="issued">2015-11-06</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>In this paper, a new procedure for solving the Feature Subset Selection problem is presented. This procedure utilizes a honey bees mating optimization algorithm. The Honey Bees Mating Op- timization algorithm simulates the mating process of the queen of the hive. The mating process of the queen begins when the queen flights away from the nest performing the mating flight during which the drones follow the queen and mate with her in the air. The proposed honey bees mating optimization-based classification algorithm is combined with a number of nearest neighbour based classifiers and is tested in a very significant financial classification task, involving the multigroup credit risk assessment problem. The algorithm is compared with a classic genetic algorithm and other metaheuristic algorithms, like Ant Colony Optimization and Particle Swarm Optimization.
 

</efrbr-expression:summarizationOfContent><efrbr-expression:useRestrictionsOnTheExpression type="creative-commons">http://creativecommons.org/licenses/by/4.0/</efrbr-expression:useRestrictionsOnTheExpression><efrbr-expression:note type="conference name">7th Conference of the Hellenic Finance and Accounting Association, 12-13 December 2008, Chania, Crete, Greece.</efrbr-expression:note></efrbr-expression:expression><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/~mmarinaki"><efrbr-person:nameOfPerson vocabulary="TUC:LDAP">
            Marinaki Magdalini
            Μαρινακη Μαγδαληνη
         </efrbr-person:nameOfPerson></efrbr-person:person><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:entities><efrbr:relationships><efrbr-structure:structureRelations><efrbr-structure:realizedThrough sourceEntity="work" sourceURI="http://purl.tuc.gr/dl/dias/360A0C4B-2010-4FDE-B0CA-E36F00363B3B" targetEntity="expression" targetURI="http://purl.tuc.gr/dl/dias/360A0C4B-2010-4FDE-B0CA-E36F00363B3B"/></efrbr-structure:structureRelations><efrbr-responsible:responsibleRelations><efrbr-responsible:createdBy sourceEntity="work" sourceURI="http://purl.tuc.gr/dl/dias/360A0C4B-2010-4FDE-B0CA-E36F00363B3B" targetEntity="person" targetURI="http://users.isc.tuc.gr/~imarinakis"/><efrbr-responsible:realizedBy sourceEntity="expression" sourceURI="http://purl.tuc.gr/dl/dias/360A0C4B-2010-4FDE-B0CA-E36F00363B3B" targetEntity="person" targetURI="http://users.isc.tuc.gr/~imarinakis" role="author"/><efrbr-responsible:realizedBy sourceEntity="expression" sourceURI="http://purl.tuc.gr/dl/dias/360A0C4B-2010-4FDE-B0CA-E36F00363B3B" targetEntity="person" targetURI="http://users.isc.tuc.gr/~mmarinaki" role="author"/><efrbr-responsible:realizedBy sourceEntity="expression" sourceURI="http://purl.tuc.gr/dl/dias/360A0C4B-2010-4FDE-B0CA-E36F00363B3B" targetEntity="person" targetURI="http://users.isc.tuc.gr/~kzopounidis" role="author"/></efrbr-responsible:responsibleRelations><efrbr-subject:subjectRelations/><efrbr-other:otherRelations/></efrbr:relationships></efrbr:recordSet>