Exploració per autor "Bardaji Goikoetxea, Itziar"

Ara es mostren els items 1-6 de 6

    • A comparison between two representatives of a set of graphs: median vs barycenter graph 

      Bardaji Goikoetxea, Itziar; Ferrer Sumsi, Miquel; Sanfeliu Cortés, Alberto (Springer Verlag, 2010)
      Text en actes de congrés
      Accés obert
      In 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 ...

    • 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 obert
      The 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 ...

    • Computing the barycenter graph by means of the graph edit distance 

      Bardaji Goikoetxea, Itziar; Ferrer Sumsi, Miquel; Sanfeliu Cortés, Alberto (2010)
      Text en actes de congrés
      Accés obert
      The 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 ...

    • Graph representatives: two different approaches based on the median and the barycenter concepts 

      Bardaji Goikoetxea, Itziar (Universitat Politècnica de Catalunya, 2009-09)
      Projecte Final de Màster Oficial
      Accés restringit per decisió de l'autor
      The straight advantages of the use of graphs for representation purposes appear to be useless in some applications due to the lack of mathematical structure in graph domains. An illustrative example is the problem of ...

    • 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'editorial
      In 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 ...

    • Structure of sets with small sumset and applications 

      Bardaji Goikoetxea, Itziar (Universitat Politècnica de Catalunya, 2008-10)
      Projecte Final de Màster Oficial
      Accés obert
      It 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 ...