English   español  
Please use this identifier to cite or link to this item: http://hdl.handle.net/10261/130241
Share/Impact:
Statistics
logo share SHARE logo core CORE   Add this article to your Mendeley library MendeleyBASE

Visualizar otros formatos: MARC | Dublin Core | RDF | ORE | MODS | METS | DIDL
Exportar a otros formatos:

Title

A semantic network-based evolutionary algorithm for computational creativity

AuthorsBaydin, Atilim Güneş; López de Mántaras, Ramón ; Ontañón, Santiago
KeywordsComputational creativities
Commonsense reasoning
Analogical reasoning
Crossover and mutation
Memetic algorithms
Memetics
Semantic network
Variation operator
Issue Date2015
PublisherSpringer
CitationEvolutionary Intelligence 8: 3- 21 (2015)
AbstractWe introduce a novel evolutionary algorithm (EA) with a semantic network-based representation. For enabling this, we establish new formulations of EA variation operators, crossover and mutation, that we adapt to work on semantic networks. The algorithm employs commonsense reasoning to ensure all operations preserve the meaningfulness of the networks, using ConceptNet and WordNet knowledge bases. The algorithm can be interpreted as a novel memetic algorithm (MA), given that (1) individuals represent pieces of information that undergo evolution, as in the original sense of memetics as it was introduced by Dawkins; and (2) this is different from existing MA, where the word “memetic” has been used as a synonym for local refinement after global optimization. For evaluating the approach, we introduce an analogical similarity-based fitness measure that is computed through structure mapping. This setup enables the open-ended generation of networks analogous to a given base network. © 2014, Springer-Verlag Berlin Heidelberg.
URIhttp://hdl.handle.net/10261/130241
DOI10.1007/s12065-014-0119-1
Identifiersdoi: 10.1007/s12065-014-0119-1
issn: 1864-5917
Appears in Collections:(IIIA) Artículos
Files in This Item:
File Description SizeFormat 
accesoRestringido.pdf15,38 kBAdobe PDFThumbnail
View/Open
Show full item record
Review this work
 

Related articles:


WARNING: Items in Digital.CSIC are protected by copyright, with all rights reserved, unless otherwise indicated.