Sciweavers

Share
IJCNN
2008
IEEE

On the sample mean of graphs

10 years 9 months ago
On the sample mean of graphs
— 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.
Brijnesh J. Jain, Klaus Obermayer
Added 31 May 2010
Updated 31 May 2010
Type Conference
Year 2008
Where IJCNN
Authors Brijnesh J. Jain, Klaus Obermayer
Comments (0)
books