Mostra el registre d'ítem simple

dc.contributor.authorFerrer Sumsi, Miquel
dc.contributor.authorValveny, Ernest
dc.contributor.authorSerratosa Casanelles, Francesc
dc.contributor.authorRiesen, Kaspar
dc.contributor.authorBunke, Horst
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament d'Arquitectura de Computadors
dc.date.accessioned2013-05-17T13:58:08Z
dc.date.created2008
dc.date.issued2008
dc.identifier.citationFerrer, 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.isbn978-1-4244-2175-6
dc.identifier.urihttp://hdl.handle.net/2117/19342
dc.description.abstractGraphs 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.extent4 p.
dc.language.isoeng
dc.publisherInstitute of Electrical and Electronics Engineers (IEEE)
dc.rightsAttribution-NonCommercial-NoDerivs 3.0 Spain
dc.rights.urihttp://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.lcshComputer algorithms
dc.subject.lcshAlgorithms and architectures for advanced scientific computing
dc.titleAn approximate algorithm for median graph computation using graph embedding
dc.typeConference report
dc.subject.lemacAlgorismes computacionals -- Processament de dades
dc.subject.lemacAlgorismes genètics
dc.contributor.groupUniversitat Politècnica de Catalunya. VIS - Visió Artificial i Sistemes Intel·ligents
dc.identifier.doi10.1109/ICPR.2008.4761354
dc.description.peerreviewedPeer Reviewed
dc.relation.publisherversionhttp://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4761354&isnumber=4760915
dc.rights.accessRestricted access - publisher's policy
local.identifier.drac11078394
dc.description.versionPostprint (published version)
dc.date.lift10000-01-01
local.citation.authorFerrer, M.; Valveny, E.; Serratosa, F.; Riesen, K.; Bunke, H.
local.citation.contributorInternational Conference on Pattern Recognition
local.citation.pubplaceTampa, Florida
local.citation.publicationName19th International Conference on Pattern Recognition, 2008: ICPR 2008: 8-11 Dec. 2008, Tampa, Florida, USA
local.citation.startingPage1
local.citation.endingPage4


Fitxers d'aquest items

Imatge en miniatura

Aquest ítem apareix a les col·leccions següents

Mostra el registre d'ítem simple