paper-with-me

홈 › Papers

The Total Variation on Hypergraphs - Learning on Hypergraphs Revisited

2013-12-18 · NeurIPS 2013 12 · Matthias Hein, Simon Setzer, Leonardo Jost, Syama Sundar Rangapuram

Hypergraphs allow one to encode higher-order relationships in data and are thus a very flexible modeling tool. Current learning methods are either based on approximations of the hypergraphs via graphs or on tensor methods which are only applicable under special conditions. In this paper, we present a new learning framework on hypergraphs which fully uses the hypergraph structure. The key element is a family of regularization functionals based on the total variation on hypergraphs.

📄 PDF Abstract BibTeX arXiv:1312.5179

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Scalable Hypergraph Structure Learning with Diverse Smoothness Priors

2025-04-04 · Benjamin T. Brown, Haoxiang Zhang, Daniel L. Lau, Gonzalo R. Arce

In graph signal processing, learning the weighted connections between nodes from a set of sample signals is a fundamental task when the underlying relationships are not known a priori. This task is typically addressed by…

Graph Learning

Regularized Recovery by Multi-order Partial Hypergraph Total Variation

2021-02-19 · Ruyuan Qu, Jiaqi He, Hui Feng, Chongbin Xu 외

Capturing complex high-order interactions among data is an important task in many scenarios. A common way to model high-order interactions is to use hypergraphs whose topology can be mathematically represented by tensors…

Random Walks on Hypergraphs with Edge-Dependent Vertex Weights

2019-05-20 · Uthsav Chitra, Benjamin J. Raphael

Hypergraphs are used in machine learning to model higher-order relationships in data. While spectral methods for graphs are well-established, spectral theory for hypergraphs remains an active area of research. In this pa…

BIG-bench Machine Learning

Global and local observability of hypergraphs

2024-05-29 · Chencheng Zhang, Hao Yang, Shaoxuan Cui, Bin Jiang 외

This paper studies observability for non-uniform hypergraphs with inputs and outputs. To capture higher-order interactions, we define a canonical non-homogeneous dynamical system with nonlinear outputs on hypergraphs. We…

Submodular Hypergraphs: p-Laplacians, Cheeger Inequalities and Spectral Clustering

2018-03-10 · ICML 2018 7 · Pan Li, Olgica Milenkovic

We introduce submodular hypergraphs, a family of hypergraphs that have different submodular weights associated with different cuts of hyperedges. Submodular hypergraphs arise in clustering applications in which higher-or…

Clustering