Higher order learning with graphs
Sameer Agarwal, Kristin M. Branson, Serge Belongie · International Conference on Machine Learning · 2006
Recently there has been considerable interest in learning with higher order relations (i.e., three-way or higher) in the unsupervised and semi-supervised settings. Hypergraphs and tensors have been proposed as the natural way of representing these relations and their corresponding algebra as the natural tools for operating on them. In this paper we argue that hypergraphs are not a natural representation for higher order relations, indeed pairwise as well as higher order relations can be handled using graphs. We show that various formulations of the semi-supervised and the unsupervised learning problem on hypergraphs result in the same graph theoretic problem and can be analyzed using existing tools.
Cited by 377 works. doi:10.1145/1143844.1143847
Authors
References
- Normalized cuts and image segmentation
- Spectral Graph Theory
- On Spectral Clustering: Analysis and an algorithm
- Semi-Supervised Learning Literature Survey
- Elements of Algebraic Topology
- Kernels and Regularization on Graphs
- Semi-Supervised Learning on Riemannian Manifolds
- Clustering categorical data: an approach based on dynamical systems
- Spectral partitioning with multiple eigenvectors
- The Laplacian on a Riemannian Manifold