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