Heat kernel coupling for multiple graph analysis

Michael M. Bronstein, Klaus Glashoff

In this paper, we introduce heat kernel coupling (HKC) as a method of constructing multimodal spectral geometry on weighted graphs of different size without vertex-wise bijective correspondence. We show that Laplacian averaging can be derived as a limit case of HKC, and demonstrate its applications on several problems from the manifold learning and pattern recognition domain.

Knowledge Graph

arrow_drop_up

Comments

Sign up or login to leave a comment