Por favor, use este identificador para citar o enlazar a este item:
http://hdl.handle.net/10261/130241
COMPARTIR / EXPORTAR:
SHARE CORE BASE | |
Visualizar otros formatos: MARC | Dublin Core | RDF | ORE | MODS | METS | DIDL | DATACITE | |
Campo DC | Valor | Lengua/Idioma |
---|---|---|
dc.contributor.author | Baydin, Atilim Güneş | - |
dc.contributor.author | López de Mántaras, Ramón | - |
dc.contributor.author | Ontañón, Santiago | - |
dc.date.accessioned | 2016-03-17T17:20:13Z | - |
dc.date.available | 2016-03-17T17:20:13Z | - |
dc.date.issued | 2015 | - |
dc.identifier | doi: 10.1007/s12065-014-0119-1 | - |
dc.identifier | issn: 1864-5917 | - |
dc.identifier.citation | Evolutionary Intelligence 8: 3- 21 (2015) | - |
dc.identifier.uri | http://hdl.handle.net/10261/130241 | - |
dc.description.abstract | We 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. | - |
dc.description.sponsorship | This work was supported by a JAE-Predoc fellowship from CSIC, and the research grants: 2009-SGR-1434 from the Generalitat de Catalunya, CSD2007-0022 from MICINN, and Next-CBR TIN2009-13692-C03-01 from MICINN. | - |
dc.publisher | Springer Nature | - |
dc.rights | closedAccess | - |
dc.subject | Computational creativities | - |
dc.subject | Common sense reasoning | - |
dc.subject | Analogical reasoning | - |
dc.subject | Crossover and mutation | - |
dc.subject | Memetic algorithms | - |
dc.subject | Memetics | - |
dc.subject | Semantic networks | - |
dc.subject | Variation operator | - |
dc.title | A semantic network-based evolutionary algorithm for computational creativity | - |
dc.type | artículo | - |
dc.identifier.doi | 10.1007/s12065-014-0119-1 | - |
dc.date.updated | 2016-03-17T17:20:13Z | - |
dc.description.version | Peer Reviewed | - |
dc.language.rfc3066 | eng | - |
dc.contributor.funder | Ministerio de Ciencia e Innovación (España) | - |
dc.contributor.funder | Consejo Superior de Investigaciones Científicas (España) | - |
dc.contributor.funder | Generalitat de Catalunya | - |
dc.relation.csic | Sí | - |
dc.identifier.funder | http://dx.doi.org/10.13039/501100004837 | es_ES |
dc.identifier.funder | http://dx.doi.org/10.13039/501100003339 | es_ES |
dc.identifier.funder | http://dx.doi.org/10.13039/501100002809 | es_ES |
dc.type.coar | http://purl.org/coar/resource_type/c_6501 | es_ES |
item.openairetype | artículo | - |
item.grantfulltext | none | - |
item.cerifentitytype | Publications | - |
item.openairecristype | http://purl.org/coar/resource_type/c_18cf | - |
item.fulltext | No Fulltext | - |
Aparece en las colecciones: | (IIIA) Artículos |
Ficheros en este ítem:
Fichero | Descripción | Tamaño | Formato | |
---|---|---|---|---|
accesoRestringido.pdf | 15,38 kB | Adobe PDF | Visualizar/Abrir |
CORE Recommender
SCOPUSTM
Citations
2
checked on 06-abr-2024
Page view(s)
278
checked on 19-abr-2024
Download(s)
103
checked on 19-abr-2024
Google ScholarTM
Check
Altmetric
Altmetric
NOTA: Los ítems de Digital.CSIC están protegidos por copyright, con todos los derechos reservados, a menos que se indique lo contrario.