Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

10

CAIP
2009
Springer

favoriteEmaildiscussreport

155views Image Analysis» more CAIP 2009»

Algorithms for the Sample Mean of Graphs

13 years 11 months ago

Algorithms for the Sample Mean of Graphs

Download user.cs.tu-berlin.de

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

Real-time Traffic

CAIP 2009 | Central Tendency | Comparative Empirical Study | Frequent Substructure Mining | Pattern Recognition |

claim paper

Related Content

» On the sample mean of graphs

» A Comparison Between ANN Generation and Training Methods and Their Development by Means of...

» Improving the Efficiency of Gibbs Sampling for Probabilistic Logical Models by Means of Pr...

» Metropolis Algorithms for Representative Subgraph Sampling

» A Graph Matching Algorithm using DataDriven Markov Chain Monte Carlo Sampling

» Lower Bounds for Howards Algorithm for Finding Minimum MeanCost Cycles

» Bounds on the Geometric Mean of Arc Lengths for BoundedDegree Planar Graphs

» Graph Matching With a DualStep EM Algorithm

» Rapid mixing of Gibbs sampling on graphs that are sparse on average

Post Info
More Details (n/a)

Added	26 May 2010
Updated	26 May 2010
Type	Conference
Year	2009
Where	CAIP
Authors	Brijnesh J. Jain, Klaus Obermayer

Comments (0)