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.

• Type: Conference
• Year: 2009
• Where: CAIP
• Authors: Brijnesh J. Jain, Klaus Obermayer
• Keywords: CAIP 2009, Central Tendency, Comparative Empirical Study, Frequent Substructure Mining, Pattern Recognition