Exploració per autor "Bunke, Horst"
Ara es mostren els items 1-7 de 7
-
A generic framework for median graph computation based on a recursive embedding approach
Ferrer Sumsi, Miquel; Karatzas, D; Valveny, Ernest; Bardaji Goikoetxea, Itziar; Bunke, Horst (2011)
Article
Accés obertThe median graph has been shown to be a good choice to obtain a representative of a set of graphs. However, its computation is a complex problem. Recently, graph embedding into vector spaces has been proposed to obtain ... -
A recursive embedding approach to median graph computation
Ferrer Sumsi, Miquel; Valveny, Ernest; Bunke, Horst (Springer Verlag, 2009-06-12)
Capítol de llibre
Accés obertThe 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 ... -
An approximate algorithm for median graph computation using graph embedding
Ferrer Sumsi, Miquel; Valveny, Ernest; Serratosa Casanelles, Francesc; Riesen, Kaspar; Bunke, Horst (Institute of Electrical and Electronics Engineers (IEEE), 2008)
Text en actes de congrés
Accés restringit per política de l'editorialGraphs 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 ... -
An iterative algorithm for approximate median graph computation
Ferrer Sumsi, Miquel; Bunke, Horst (Institute of Electrical and Electronics Engineers (IEEE), 2010)
Text en actes de congrés
Accés restringit per política de l'editorialRecently, the median graph has been shown to be a good choice to obtain a representative of a given set of graphs. It has been successfully applied to graph-based classification and clustering. In this paper we exploit a ... -
Generalized median graph computation by means of graph embedding in vector spaces
Ferrer Sumsi, Miquel; Valveny, Ernest; Serratosa Casanelles, Francesc; Riesen, Kaspar; Bunke, Horst (2010)
Article
Accés restringit per política de l'editorialThe median graph has been presented as a useful tool to represent a set of graphs. Nevertheless its computation is very complex and the existing algorithms are restricted to use limited amount of data. In this paper we ... -
Graph-based k-means clustering: A comparison of the set versus the generalized median graph
Ferrer Sumsi, Miquel; Valveny, Ernest; Serratosa Casanelles, Francesc; Bardaji Goikoetxea, Itziar; Bunke, Horst (Springer Berlin / Heidelberg, 2009)
Capítol de llibre
Accés restringit per política de l'editorialIn this paper we propose the application of the generalized median graph in a graph-based k-means clustering algorithm. In the graph-based k-means algorithm, the centers of the clusters have been traditionally represented ... -
Rule-based fuzzy object similarity
Bunke, Horst; Fàbregas, Xavier; Kandel, Abraham (Universitat Politècnica de Catalunya. Secció de Matemàtiques i Informàtica, 2001)
Article
Accés obertA new similarity measure for objects that are represented by feature vectors of fixed dimension is introduced. It can simultaneously deal with numeric and symbolic features. Also, it can tolerate missing feature values. ...