Results 21 to 30 of about 8,142 (223)

Learning from high-order data: hypergraphs and smart codes [PDF]

open access: yes, 2023
Arce, Gonzalo R.Currently, there is an increasing need to develop tools that allow the processing and exploitation of the massive amount of data available in many fields, such as computer vision, biology, social sciences, computational image, and others.
Pena Pena, Karelia
core   +1 more source

ON THE SPECTRA OF TENSOR JOIN OF HYPERGRAPHS [PDF]

open access: yesJournal of Algebraic Systems
In this paper, we consider certain classes of hypergraphs constructed from the tensor join of hypergraphs, specifically the tensor join of hypergraphs constrained by vertex subsets and the $(H, \mathcal{T}_{\mathcal{S}})$-join of hypergraphs constrained ...
Vishnupriya Ramkumar, Rajkumar Rajendran
doaj   +1 more source

Regular Single Valued Neutrosophic Hypergraphs [PDF]

open access: yesNeutrosophic Sets and Systems, 2016
In this paper, we define the regular and totally regular single valued neutrosophic hypergraphs, and discuss the order and size along with properties of regular and totally regular single valued neutrosophic hypergraphs.
Muhammad Aslam Malik   +3 more
doaj   +1 more source

Legal hypergraphs

open access: yesPhilosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences, 2023
Complexity science provides a powerful framework for understanding physical, biological and social systems, and network analysis is one of its principal tools. Since many complex systems exhibit multilateral interactions that change over time, in recent years, network scientists have become increasingly interested in modelling and ...
Corinna Coupette   +2 more
openaire   +5 more sources

Line hypergraphs [PDF]

open access: yes, 1992
In this paper, we introduce a new multivalued function ℒ called the line hypergraph. The function ℒ generalizes two classical concepts at once, namely, of the line graph and the dual hypergraph. In terms of this function, proofs of some known theorems on
Zverovich, Vadim   +5 more
core   +1 more source

Uniform hypergraphs containing no grids [PDF]

open access: yes, 2013
A hypergraph is called an r×r grid if it is isomorphic to a pattern of r horizontal and r vertical lines, i.e.,a family of sets {A1, ..., Ar, B1, ..., Br} such that Ai∩Aj=Bi∩Bj=φ for 1 ...
Füredi, Zoltán, Ruszinkó, Miklós
core   +1 more source

Coloring directed hypergraphs [PDF]

open access: yes, 2022
Inspired by earlier results about proper and polychromatic coloring of hypergraphs, we investigate such colorings of directed hypergraphs, that is, hypergraphs in which the vertices of each hyperedge is partitioned into two parts, a tail and a head.
Keszegh, Balázs, Balázs Keszegh
core   +2 more sources

Regular Bipolar Single Valued Neutrosophic Hypergraphs [PDF]

open access: yesNeutrosophic Sets and Systems, 2016
In this paper, we define the regular and totally regular bipolar single valued neutrosophic hypergraphs, and discuss the order and size along with properties of regular and totally regular bipolar single valued neutrosophic hypergraphs. We extend work on
Muhammad Aslam Malik   +3 more
doaj   +1 more source

Pattern Hypergraphs [PDF]

open access: yesThe Electronic Journal of Combinatorics, 2010
The notion of pattern hypergraph provides a unified view of several previously studied coloring concepts. A pattern hypergraph $H$ is a hypergraph where each edge is assigned a type $\Pi_i$ that determines which of possible colorings of the edge are proper. A vertex coloring of $H$ is proper if it is proper for every edge.
Zdenek Dvorák 0001   +3 more
openaire   +2 more sources

Learnable Hypergraph Laplacian for Hypergraph Learning

open access: yesICASSP 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.
Jiying Zhang   +4 more
openaire   +3 more sources

Home - About - Disclaimer - Privacy