Results 141 to 150 of about 56,309 (276)
Non-Abelian Topological Approach to Non-Locality of a Hypergraph State
Entropy, 2015 We present a theoretical study of new families of stochastic complex information modules encoded in the hypergraph states which are defined by the fractional entropic descriptor.
Vesna Berec
doaj +1 more source
Multi-grained hypergraph interest modeling for conversational recommendation
AI Open, 2023 Conversational recommender system (CRS) interacts with users through multi-turn dialogues in natural language, which aims to provide high-quality recommendations for user’s instant information need.
Chenzhan Shang +4 more
doaj
AHD-SLE: Anomalous Hyperedge Detection on Hypergraph Symmetric Line Expansion
AxiomsGraph anomaly detection aims to identify unusual patterns or structures in graph-structured data. Most existing research focuses on anomalous nodes in ordinary graphs with pairwise relationships.
Yingle Li +4 more
doaj +1 more source
Journal of Pure and Applied Algebra, 2019 38 ...
Fong, Brendan, Spivak, David I
openaire +3 more sources
EngineeringPractical real-world scenarios such as the Internet, social networks, and biological networks present the challenges of data scarcity and complex correlations, which limit the applications of artificial intelligence. The graph structure is a typical tool
Yue Gao +3 more
doaj
The Existence of Quasi Regular and Bi-Regular Self-Complementary 3-Uniform Hypergraphs
Discussiones Mathematicae Graph Theory, 2016 A k-uniform hypergraph H = (V ;E) is called self-complementary if there is a permutation σ : V → V , called a complementing permutation, such that for every k-subset e of V , e ∈ E if and only if σ(e) ∉ E. In other words, H is isomorphic with H′ = (V ; V(
Kamble Lata N. +2 more
doaj +1 more source
Discrete Mathematics, 1991 AbstractThe class M of finite manuals (i.e. hypergraphs formed by the cliques of finite graphs) is closed under the formation of sums and products. We define the class of constructible hypergraphs to be the smallest subclass of M which contains all finite classical manuals (i.e.
openaire +2 more sources
Discrete Mathematics, 1981 AbstractWe define a new class of hypergraphs (partitive hypergraphs) which generalizes both, the set of all externally related subsets of a graph and the set of all committees of an hypergraph.We give a characterization of the partitive hypergraphs and moreover of those which are associated with hypergraphs or graphs.
M. C. Maurer, Michel Habib, M. Chein
openaire +2 more sources
Discrepancy of Sums of two Arithmetic Progressions
, 2007 Estimating the discrepancy of the hypergraph of all arithmetic progressions in the set $[N]=\{1,2,\hdots,N\}$ was one of the famous open problems in combinatorial discrepancy theory for a long time.
Hebbinghaus, Nils
core +1 more source
Physical Review EHere we introduce simple structures for the analysis of complex hypergraphs, hypergraph animals. These structures are designed to describe the local node neighbourhoods of nodes in hypergraphs. We establish their relationships to lattice animals and network motifs, and we develop their combinatorial properties for sparse and uncorrelated hypergraphs ...
openaire +3 more sources