Sciweavers

Share
CAIP
2009
Springer

Algorithms for the Sample Mean of Graphs

9 years 8 months ago
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.
Brijnesh J. Jain, Klaus Obermayer
Added 26 May 2010
Updated 26 May 2010
Type Conference
Year 2009
Where CAIP
Authors Brijnesh J. Jain, Klaus Obermayer
Comments (0)
books