Mostra el registre d'ítem simple
Median graphs: a genetic approach based on new theoretical properties
dc.contributor.author | Ferrer Sumsi, Miquel |
dc.contributor.author | Valveny, Ernest |
dc.contributor.author | Serratosa Casanelles, Francesc |
dc.contributor.other | Universitat Politècnica de Catalunya. Departament d'Arquitectura de Computadors |
dc.date.accessioned | 2013-05-14T13:20:27Z |
dc.date.created | 2009 |
dc.date.issued | 2009 |
dc.identifier.citation | Ferrer, M.; Valveny, E.; Serratosa, F. Median graphs: a genetic approach based on new theoretical properties. "Pattern recognition", 2009, vol. 42, núm. 9, p. 2003-2012. |
dc.identifier.issn | 0031-3203 |
dc.identifier.uri | http://hdl.handle.net/2117/19211 |
dc.description.abstract | Given a set of graphs, the median graph has been theoretically presented as a useful concept to infer a representative of the set. However, the computation of the median graph is a highly complex task and its practical application has been very limited up to now. In this work we present two major contributions. On one side, and from a theoretical point of view, we show new theoretical properties of the median graph. On the other side, using these new properties, we present a new approximate algorithm based on the genetic search, that improves the computation of the median graph. Finally, we perform a set of experiments on real data, where none of the existing algorithms for the median graph computation could be applied up to now due to their computational complexity. With these results, we show how the concept of the median graph can be used in real applications and leaves the box of the only-theoretical concepts, demonstrating, from a practical point of view, that can be a useful tool to represent a set of graphs. |
dc.format.extent | 10 p. |
dc.language.iso | eng |
dc.rights | Attribution-NonCommercial-NoDerivs 3.0 Spain |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/3.0/es/ |
dc.subject | Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica::Algorísmica i teoria de la complexitat |
dc.subject | Àrees temàtiques de la UPC::Matemàtiques i estadística::Anàlisi numèrica::Modelització matemàtica |
dc.subject.lcsh | Algorithms and architectures for advanced scientific computing |
dc.subject.lcsh | Computer algorithms |
dc.subject.other | Median graph |
dc.subject.other | Genetic search |
dc.subject.other | Maximum common subgraph |
dc.subject.other | Graph matching |
dc.subject.other | Structural pattern recognition |
dc.title | Median graphs: a genetic approach based on new theoretical properties |
dc.type | Article |
dc.subject.lemac | Algorismes computacionals -- Processament de dades |
dc.subject.lemac | Algorismes genètics |
dc.contributor.group | Universitat Politècnica de Catalunya. VIS - Visió Artificial i Sistemes Intel·ligents |
dc.identifier.doi | 10.1016/j.patcog.2009.01.034 |
dc.description.peerreviewed | Peer Reviewed |
dc.relation.publisherversion | http://dx.doi.org/10.1016/j.patcog.2009.01.034 |
dc.rights.access | Restricted access - publisher's policy |
local.identifier.drac | 11077875 |
dc.description.version | Postprint (published version) |
dc.date.lift | 10000-01-01 |
local.citation.author | Ferrer, M.; Valveny, E.; Serratosa, F. |
local.citation.publicationName | Pattern recognition |
local.citation.volume | 42 |
local.citation.number | 9 |
local.citation.startingPage | 2003 |
local.citation.endingPage | 2012 |
Fitxers d'aquest items
Aquest ítem apareix a les col·leccions següents
-
Articles de revista [1.048]
-
Articles de revista [139]