Bardaji Goikoetxea, Itziar; Ferrer Sumsi, Miquel; Sanfeliu Cortés, Alberto (Springer Verlag, 2010)
Open AccessIn this paper we consider two existing methods to generate a representative of a given set of graphs, that satisfy the following two conditions. On the one hand, that they are applicable to graphs with any kind of labels ...
Ferrer Sumsi, Miquel; Karatzas, D; Valveny, Ernest; Bardaji Goikoetxea, Itziar; Bunke, Horst (2011)
Open AccessThe 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 ...
Bardaji Goikoetxea, Itziar; Ferrer Sumsi, Miquel; Sanfeliu Cortés, Alberto (2010)
Open AccessThe barycenter graph has been shown as an alternative to obtain the representative of a given set of graphs. In this paper we propose an extension of the original algorithm which makes use of the graph edit distance in ...
Ferrer Sumsi, Miquel; Valveny, Ernest; Serratosa Casanelles, Francesc; Bardaji Goikoetxea, Itziar; Bunke, Horst (Springer Berlin / Heidelberg, 2009)
Part of book or chapter of book
Restricted access - publisher's policyIn 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 ...
Bardaji Goikoetxea, Itziar (Universitat Politècnica de Catalunya, 2008-10)
Open AccessIt was the main objective of this master thesis to determine the position of the holes for sets with small doubling. The answer to this question was given recently by Freiman and in here we generalize it to the case with ...