<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/91C7E257-A537-4E01-8DEC-41A8451D677B"><efrbr-work:titleOfTheWork>A stochastic nature inspired metaheuristic for clustering analysis</efrbr-work:titleOfTheWork></efrbr-work:work><efrbr-expression:expression identifier="http://purl.tuc.gr/dl/dias/91C7E257-A537-4E01-8DEC-41A8451D677B"><efrbr-expression:titleOfTheExpression>A stochastic nature inspired metaheuristic for clustering analysis</efrbr-expression:titleOfTheExpression><efrbr-expression:formOfExpression vocabulary="DIAS:TYPES">
            Peer-Reviewed Journal Publication
            Δημοσίευση σε Περιοδικό με Κριτές
         </efrbr-expression:formOfExpression><efrbr-expression:dateOfExpression type="issued">2015-11-05</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>This paper presents a new stochastic nature inspired methodology, which is based on the concepts of Particle Swarm Optimization (PSO) and Ant Colony Optimization (ACO), for optimally clustering N objects into K clusters. Due to the nature of stochastic and population-based search, the proposed algorithm can overcome the drawbacks of traditional clustering methods. Its performance is compared with other popular stochastic/metaheuristic methods like genetic algorithm and Tabu search. The proposed algorithm has been implemented and tested on several datasets with very good results.</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">International Journal of Business Intelligence and Data Mining</efrbr-expression:note><efrbr-expression:note type="journal volume">1</efrbr-expression:note><efrbr-expression:note type="journal number">3</efrbr-expression:note><efrbr-expression:note type="page range">30-44 </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/~nmatsatsinis"><efrbr-person:nameOfPerson vocabulary="TUC:LDAP">
            Matsatsinis Nikolaos
            Ματσατσινης Νικολαος
         </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-corporateBody:corporateBody identifier="http://www.inderscience.com/"><efrbr-corporateBody:nameOfTheCorporateBody vocabulary="S/R:PUBLISHERS">
            Inderscience
         </efrbr-corporateBody:nameOfTheCorporateBody></efrbr-corporateBody:corporateBody><efrbr-concept:concept identifier="4EE9E0BB-861E-4EE4-87B4-789C130C2F26"><efrbr-concept:termForTheConcept>
            Genetic algorithms
         </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/91C7E257-A537-4E01-8DEC-41A8451D677B" targetURI="http://purl.tuc.gr/dl/dias/91C7E257-A537-4E01-8DEC-41A8451D677B"/></efrbr-structure:structureRelations><efrbr-responsible:responsibleRelations><efrbr-responsible:createdBy sourceEntity="work" targetEntity="person" sourceURI="http://purl.tuc.gr/dl/dias/91C7E257-A537-4E01-8DEC-41A8451D677B" targetURI="http://users.isc.tuc.gr/~imarinakis"/><efrbr-responsible:realizedBy sourceEntity="expression" role="author" targetEntity="person" sourceURI="http://purl.tuc.gr/dl/dias/91C7E257-A537-4E01-8DEC-41A8451D677B" targetURI="http://users.isc.tuc.gr/~imarinakis"/><efrbr-responsible:realizedBy sourceEntity="expression" role="author" targetEntity="person" sourceURI="http://purl.tuc.gr/dl/dias/91C7E257-A537-4E01-8DEC-41A8451D677B" targetURI="http://users.isc.tuc.gr/~nmatsatsinis"/><efrbr-responsible:realizedBy sourceEntity="expression" role="author" targetEntity="person" sourceURI="http://purl.tuc.gr/dl/dias/91C7E257-A537-4E01-8DEC-41A8451D677B" targetURI="http://users.isc.tuc.gr/~mmarinaki"/><efrbr-responsible:realizedBy sourceEntity="expression" role="publisher" targetEntity="person" sourceURI="http://purl.tuc.gr/dl/dias/91C7E257-A537-4E01-8DEC-41A8451D677B" targetURI="http://www.inderscience.com/"/></efrbr-responsible:responsibleRelations><efrbr-subject:subjectRelations><efrbr-subject:hasSubject sourceEntity="work" targetEntity="concept" sourceURI="http://purl.tuc.gr/dl/dias/91C7E257-A537-4E01-8DEC-41A8451D677B" targetURI="4EE9E0BB-861E-4EE4-87B4-789C130C2F26"/></efrbr-subject:subjectRelations><efrbr-other:otherRelations/></efrbr:relationships></efrbr:recordSet>