Results 151 to 160 of about 2,959 (186)
HGCPep: Hypergraph Deep Learning Identifies Cancer-associated Non-coding Peptides. [PDF]
Genomics Proteomics BioinformaticsLong W +5 more
europepmc +1 more source
One-class edge classification through heterogeneous hypergraph for causal discovery. [PDF]
Sci RepGôlo MPS, Marcacini RM.
europepmc +1 more source
PHScaffolding: a hypergraph clustering and dual-weight integration strategy for scaffolding with Pore-C reads. [PDF]
Brief BioinformSu Q, Luo J, Guo F.
europepmc +1 more source
Adaptive dynamic hypergraph learning for ingredient aware food recommendation. [PDF]
Sci RepAlkhrijah Y +3 more
europepmc +1 more source
Retraction of: Integration of single cell multiomics data by deep transfer hypergraph neural network. [PDF]
Brief Funct Genomicseuropepmc +1 more source
Hypergraph convolution and hypergraph attention [PDF]
Pattern Recognition, 2021 Recently, graph neural networks have attracted great attention and achieved prominent performance in various research fields. Most of those algorithms have assumed pairwise relationships of objects of interest. However, in many real applications, the relationships between objects are in higher-order, beyond a pairwise formulation.
Song Bai, Feihu Zhang
exaly +4 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
The matching polynomials of hypergraphs and weighted hypergraphs
Discrete Mathematics, Algorithms and Applications, 2022Let [Formula: see text] be the set of the connected [Formula: see text]-uniform linear hypergraphs with [Formula: see text] vertices, where [Formula: see text]. The matching polynomial of a hypergraph [Formula: see text] is denoted by [Formula: see text], where [Formula: see text]. Several properties on the roots of [Formula: see text] are derived. We
Jia-Wen Yang, Wen-Huan Wang
openaire +2 more sources
Mathematical Programming, 1997
We consider the capacitated minimum cost flow problem on directed hypergraphs. We define spanning hypertrees so generalizing the spanning tree of a standard graph, and show that, like in the standard and in the generalized minimum cost flow problems, a correspondence exists between bases and spanning hypertrees. Then, we show that, like for the network
CAMBINI, RICCARDO +2 more
openaire +4 more sources
We consider the capacitated minimum cost flow problem on directed hypergraphs. We define spanning hypertrees so generalizing the spanning tree of a standard graph, and show that, like in the standard and in the generalized minimum cost flow problems, a correspondence exists between bases and spanning hypertrees. Then, we show that, like for the network
CAMBINI, RICCARDO +2 more
openaire +4 more sources
2016
We introduce sequence hypergraphs by extending the concept of a directed edge (from simple directed graphs) to hypergraphs. Specifically, every hyperedge of a sequence hypergraph is defined as a sequence of vertices (imagine it as a directed path). Note that this differs substantially from the standard definition of directed hypergraphs.
Böhmová, Katerina +4 more
openaire +5 more sources
We introduce sequence hypergraphs by extending the concept of a directed edge (from simple directed graphs) to hypergraphs. Specifically, every hyperedge of a sequence hypergraph is defined as a sequence of vertices (imagine it as a directed path). Note that this differs substantially from the standard definition of directed hypergraphs.
Böhmová, Katerina +4 more
openaire +5 more sources