Por favor, use este identificador para citar o enlazar a este item:
http://hdl.handle.net/10261/30131
COMPARTIR / EXPORTAR:
SHARE BASE | |
Visualizar otros formatos: MARC | Dublin Core | RDF | ORE | MODS | METS | DIDL | DATACITE | |
Título: | A recursive embedding approach to median graph computation |
Autor: | Ferrer, Miquel CSIC ORCID; Karatzas, D.; Valveny, Ernest; Bunke, Horst | Palabras clave: | Pattern recognition Pattern recognition systems |
Fecha de publicación: | 2009 | Editor: | Springer Nature | Citación: | Graph-Based Representations in Pattern Recognition: 113-123 (2009) | Serie: | Lecture Notes in Computer Science 5534 | Resumen: | The median graph has been shown to be a good choice to infer a representative of a set of graphs. It has been successfully applied to graph-based classification and clustering. Nevertheless, its computation is extremely complex. Several approaches have been presented up to now based on different strategies. In this paper We present a new approximate recursive algorithm for median graph computation based on graph embedding into vector spaces. Preliminary experiments oil three databases show that this new approach is able to obtain better medians than the previous existing approaches. | Descripción: | Trabajo presentado al 7th GbRPR celebrado en Venecia del 26 al 28 de mayo de 2009. | Versión del editor: | http://dx.doi.org/10.1007/978-3-642-02124-4_12 | URI: | http://hdl.handle.net/10261/30131 | DOI: | 10.1007/978-3-642-02124-4_12 | ISBN: | 978-3-642-02123-7 |
Aparece en las colecciones: | (IRII) Libros y partes de libros |
Ficheros en este ítem:
Fichero | Descripción | Tamaño | Formato | |
---|---|---|---|---|
recursive embedding.pdf | 252,78 kB | Adobe PDF | Visualizar/Abrir |
CORE Recommender
Page view(s)
294
checked on 16-abr-2024
Download(s)
239
checked on 16-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.