On the sample mean of graphs
Brijnesh Johannes Jain, Klaus Obermayer · 2008
We present an analytic and geometric view of the sample mean of graphs. The theoretical framework yields efficient subgradient methods for approximating a structural mean and a simple plug-in mechanism to extend existing central clustering algorithms to graphs. Experiments in clustering protein structures show the benefits of the proposed theory.