Results 61 to 70 of about 56,309 (276)
Preventing Over-Smoothing for Hypergraph Neural Networks [PDF]
arXiv.org, 2022 In recent years, hypergraph learning has attracted great attention due to its capacity in representing complex and high-order relationships. However, current neural network approaches designed for hypergraphs are mostly shallow, thus limiting their ...
Guan-Wun Chen, Jiying Zhang
semanticscholar +1 more source
Learnable Hypergraph Laplacian for Hypergraph Learning
ICASSP 2022 - 2022 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), 2022 HyperGraph Convolutional Neural Networks (HGCNNs) have demonstrated their potential in modeling high-order relations preserved in graph structured data. However, most existing convolution filters are localized and determined by the pre-defined initial hypergraph topology, neglecting to explore implicit and long-ange relations in real-world data.
Zhang, Jiying +4 more
openaire +3 more sources
Hypergraph Structure Learning for Hypergraph Neural Networks
International Joint Conference on Artificial Intelligence, 2022 Hypergraphs are natural and expressive modeling tools to encode high-order relationships among entities. Several variations of Hypergraph Neural Networks (HGNNs) are proposed to learn the node representations and complex relationships in the hypergraphs.
D. Cai +5 more
semanticscholar +1 more source
Connectivity in Hypergraphs [PDF]
Canadian Mathematical Bulletin, 2018 AbstractIn this paper we consider two natural notions of connectivity for hypergraphs: weak and strong. We prove that the strong vertex connectivity of a connected hypergraph is bounded by its weak edge connectivity, thereby extending a theorem of Whitney from graphs to hypergraphs.
David A. Pike, Megan Dewar, John Proos
openaire +4 more sources
Approximate Hypergraph Coloring under Low-discrepancy and Related Promises [PDF]
, 2015 A hypergraph is said to be $\chi$-colorable if its vertices can be colored with $\chi$ colors so that no hyperedge is monochromatic. $2$-colorability is a fundamental property (called Property B) of hypergraphs and is extensively studied in combinatorics.
Bhattiprolu, Vijay V. S. P. +2 more
core +3 more sources
Combinatorica, 2013 One of the De Bruijn - Erdos theorems deals with finite hypergraphs where every two vertices belong to precisely one hyperedge. It asserts that, except in the perverse case where a single hyperedge equals the whole vertex set, the number of hyperedges is at least the number of vertices and the two numbers are equal if and only if the hypergraph belongs
Beaudou, Laurent +7 more
openaire +3 more sources
The -annihilating-ideal hypergraph of commutative ring
AKCE International Journal of Graphs and Combinatorics, 2019 The concept of the annihilating-ideal graph of a commutative ring was introduced by Behboodi et. al in 2011. In this paper, we extend this concept to the hypergraph for which we define an algebraic structure called -annihilating-ideal of a commutative ...
K. Selvakumar, V. Ramanathan
doaj +1 more source
Semisupervised Hypergraph Discriminant Learning for Dimensionality Reduction of Hyperspectral Image
IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing, 2020 Semisupervised learning is an effective technique to represent the intrinsic features of a hyperspectral image (HSI), which can reduce the cost to obtain the labeled information of samples.
Fulin Luo +4 more
doaj +1 more source
Hypergraph coverings and Ramanujan Hypergraphs
, 2023 In this paper we investigate Ramanujan hypergraphs by using hypergraph coverings. We first show that the spectrum of a $k$-fold covering $\bar{H}$ of a connected hypergraph $H$ contains the spectrum of $H$, and that it is the union of the spectrum of $H$ and the spectrum of an incidence-signed hypergraph with $H$ as underlying hypergraph if $k=2 ...
Song, Yi-Min +2 more
openaire +2 more sources
A Note on Set Systems with no Union of Cardinality 0 modulo m [PDF]
Discrete Mathematics & Theoretical Computer Science, 2003 Alon, Kleitman, Lipton, Meshulam, Rabin and Spencer (Graphs. Combin. 7 (1991), no. 2, 97-99) proved, that for any hypergraph F ={F 1,F 2,…, F d(q-1)+1 }, where q is a prime-power, and d denotes the maximal degree of the hypergraph, there exists
Vince Grolmusz
doaj +2 more sources