Abstract
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. © 2009 Springer Berlin Heidelberg.
Cite
CITATION STYLE
APA
Jain, B. J., & Obermayer, K. (2009). Algorithms for the sample mean of graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5702 LNCS, pp. 351–359). https://doi.org/10.1007/978-3-642-03767-2_43
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free