Mostra el registre d'ítem simple
An approximate algorithm for median graph computation using graph embedding
dc.contributor.author | Ferrer Sumsi, Miquel |
dc.contributor.author | Valveny, Ernest |
dc.contributor.author | Serratosa Casanelles, Francesc |
dc.contributor.author | Riesen, Kaspar |
dc.contributor.author | Bunke, Horst |
dc.contributor.other | Universitat Politècnica de Catalunya. Departament d'Arquitectura de Computadors |
dc.date.accessioned | 2013-05-17T13:58:08Z |
dc.date.created | 2008 |
dc.date.issued | 2008 |
dc.identifier.citation | Ferrer, M. [et al.]. An approximate algorithm for median graph computation using graph embedding. A: International Conference on Pattern Recognition. "19th International Conference on Pattern Recognition, 2008: ICPR 2008: 8-11 Dec. 2008, Tampa, Florida, USA". Tampa, Florida: Institute of Electrical and Electronics Engineers (IEEE), 2008, p. 1-4. |
dc.identifier.isbn | 978-1-4244-2175-6 |
dc.identifier.uri | http://hdl.handle.net/2117/19342 |
dc.description.abstract | Graphs are powerful data structures that have many attractive properties for object representation. However, some basic operations are difficult to define and implement, for instance, how to obtain a representative of a set of graphs. The median graph has been defined for that purpose, but existing algorithms are computationally complex and have a very limited applicability. In this paper we propose a new approach for the computation of the median graph based on graph embedding in vector spaces. Experiments on a real database containing large graphs show that we succeed to compute good approximations of the median graph. We have also applied the median graph to perform some basic classification tasks achieving reasonable good results. |
dc.format.extent | 4 p. |
dc.language.iso | eng |
dc.publisher | Institute of Electrical and Electronics Engineers (IEEE) |
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::Matemàtiques i estadística::Anàlisi numèrica::Modelització matemàtica |
dc.subject | Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica::Algorísmica i teoria de la complexitat |
dc.subject.lcsh | Computer algorithms |
dc.subject.lcsh | Algorithms and architectures for advanced scientific computing |
dc.title | An approximate algorithm for median graph computation using graph embedding |
dc.type | Conference report |
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.1109/ICPR.2008.4761354 |
dc.description.peerreviewed | Peer Reviewed |
dc.relation.publisherversion | http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4761354&isnumber=4760915 |
dc.rights.access | Restricted access - publisher's policy |
local.identifier.drac | 11078394 |
dc.description.version | Postprint (published version) |
dc.date.lift | 10000-01-01 |
local.citation.author | Ferrer, M.; Valveny, E.; Serratosa, F.; Riesen, K.; Bunke, H. |
local.citation.contributor | International Conference on Pattern Recognition |
local.citation.pubplace | Tampa, Florida |
local.citation.publicationName | 19th International Conference on Pattern Recognition, 2008: ICPR 2008: 8-11 Dec. 2008, Tampa, Florida, USA |
local.citation.startingPage | 1 |
local.citation.endingPage | 4 |