Please use this identifier to cite or link to this item: http://hdl.handle.net/10553/54673
DC FieldValueLanguage
dc.contributor.authorMartínez-Romero, Marcosen_US
dc.contributor.authorVázquez-Naya, José Manuelen_US
dc.contributor.authorNóvoa, Francisco Javieren_US
dc.contributor.authorVázquez, Guillermoen_US
dc.contributor.authorPereira, Javieren_US
dc.date.accessioned2019-02-18T12:25:05Z-
dc.date.available2019-02-18T12:25:05Z-
dc.date.issued2013en_US
dc.identifier.isbn9783642386787en_US
dc.identifier.issn0302-9743en_US
dc.identifier.urihttp://hdl.handle.net/10553/54673-
dc.languagespaen_US
dc.publisher0302-9743en_US
dc.relation.ispartofLecture Notes in Computer Scienceen_US
dc.sourceLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)[ISSN 0302-9743],v. 7902 LNCS, p. 435-444en_US
dc.titleA genetic algorithms-based approach for optimizing similarity aggregation in ontology matchingen_US
dc.typeinfo:eu-repo/semantics/conferenceObjecten_US
dc.typeConferenceObjecten_US
dc.identifier.doi10.1007/978-3-642-38679-4_43en_US
dc.identifier.scopus84880068583-
dc.contributor.authorscopusid36515327900-
dc.contributor.authorscopusid6506216621-
dc.contributor.authorscopusid16837150200-
dc.contributor.authorscopusid55755675400-
dc.contributor.authorscopusid7401895307-
dc.description.lastpage444-
dc.description.firstpage435-
dc.relation.volume7902 LNCS-
dc.type2Actas de congresosen_US
dc.identifier.ulpgces
dc.description.sjr0,329
dc.description.sjrqQ3
item.grantfulltextnone-
item.fulltextSin texto completo-
crisitem.author.deptGIR IUIBS: Diabetes y endocrinología aplicada-
crisitem.author.deptIU de Investigaciones Biomédicas y Sanitarias-
crisitem.author.orcid0000-0003-3629-8120-
crisitem.author.parentorgIU de Investigaciones Biomédicas y Sanitarias-
crisitem.author.fullNameNovoa Mogollón,Francisco-
Appears in Collections:Actas de congresos
Show simple item record

Google ScholarTM

Check

Altmetric


Share



Export metadata



Items in accedaCRIS are protected by copyright, with all rights reserved, unless otherwise indicated.