Algorithms for the Sample Mean of Graphs

Measures of central tendency for graphs are important for protoype construction, frequent substructure mining, and multiple alignment of protein structures. This contribution proposes subgradient-based methods for determining a sample mean of graphs. We assess the performance of the proposed algorithms in a comparative empirical study.

[1]  Francesc d'ASSIS Serratosa Casanelles,et al.  Theory and algorithms on the median graph , 2009 .

[2]  Klaus Obermayer,et al.  On the sample mean of graphs , 2008, 2008 IEEE International Joint Conference on Neural Networks (IEEE World Congress on Computational Intelligence).

[3]  Horst Bunke,et al.  On Median Graphs: Properties, Algorithms, and Applications , 2001, IEEE Trans. Pattern Anal. Mach. Intell..

[4]  Klaus Obermayer,et al.  Multiple alignment of contact maps , 2009, 2009 International Joint Conference on Neural Networks.

[5]  Miquel Ferrer Sumsi.  Theory and Algorithms on the Median Graph: application to Graph-Based Classification and Clustering , 2008 .

[6]  Jiming Peng,et al.  Generalized median graphs and applications , 2009, J. Comb. Optim..

[7]  P. Neittaanmäki,et al.  Nonsmooth Optimization: Analysis and Algorithms with Applications to Optimal Control , 1992 .

[8]  Horst Bunke,et al.  Self-organizing map for clustering in the graph domain , 2002, Pattern Recognit. Lett..

[9]  Andrea Torsello,et al.  Clustering shock trees , 2001 .

[10]  Steven Gold,et al.  A Graduated Assignment Algorithm for Graph Matching , 1996, IEEE Trans. Pattern Anal. Mach. Intell..

[11]  N. Saitou,et al.  The neighbor-joining method: a new method for reconstructing phylogenetic trees. , 1987, Molecular biology and evolution.