Results 1 to 10 of about 10,205 (230)
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
Qionghai Dai, Xiangmin Han, Shuyi Ji
exaly +4 more sources
Spatiotemporal Fusion for Stock Prediction via Hypergraph Attention Gated Recurrent Units [PDF]
EntropyStock prediction requires the joint modeling of temporal dynamics and cross-stock dependence. Existing graph-based and hypergraph-based forecasting methods often process spatial relation modeling and temporal evolution in separate stages, which may ...
Xinmei Cao, Chonghui Qian, Hengjun Huang
doaj +2 more sources
Hypergraph Based Berge Hypergraphs [PDF]
Graphs and Combinatorics, 2021 Fix a hypergraph $\mathcal{F}$. A hypergraph $\mathcal{H}$ is called a {\it Berge copy of $\mathcal{F}$} or {\it Berge-$\mathcal{F}$} if we can choose a subset of each hyperedge of $\mathcal{H}$ to obtain a copy of $\mathcal{F}$. A hypergraph $\mathcal{H}$ is {\it Berge-$\mathcal{F}$-free} if it does not contain a subhypergraph which is Berge copy of $\
Martin Balko +4 more
openaire +3 more sources
On edge product hypergraphs [PDF]
Journal of Hyperstructures, 2021 In this paper we introduced the notion of an edge product hypergraph. A hypergraph H is said to be an edge producthypergraph if edges of hypergraph can be labeled with distinct positive integers such that the product of all the labels of edges incident ...
Kishor F. Pawar, Megha M. Jadhav
doaj +1 more source
Multimodal Data Fusion Algorithm Based on Hypergraph Regularization [PDF]
Jisuanji kexue, 2023 The multi-modal data fusion improves the performance of data classification and prediction by learning the correlation information and complementary information between multiple datasets.However,existing data fusion methods are based on feature pattern ...
CUI Bingjing, ZHANG Yipu, WANG Biao
doaj +1 more source
Journal of Combinatorial Theory, Series B, 2021 The following very natural problem was raised by Chung and Erdős in the early 80's and has since been repeated a number of times. What is the minimum of the Turán number $\text{ex}(n,\mathcal{H})$ among all $r$-graphs $\mathcal{H}$ with a fixed number of edges?
Matija Bucic +3 more
openaire +4 more sources
On domination in an edge product hypergraphs [PDF]
Journal of Hyperstructures, 2021 In this paper, we study domination in an edge product hypergraphs and found some results on it. It is proved that theunit edge in a unit edge product hypergraph is a dominating set of hypergraph H.
Kishor F. Pawar, Megha M. Jadhav
doaj +1 more source
Unified Low-Rank Subspace Clustering with Dynamic Hypergraph for Hyperspectral Image
Remote Sensing, 2021 Low-rank representation with hypergraph regularization has achieved great success in hyperspectral imagery, which can explore global structure, and further incorporate local information.
Jinhuan Xu, Liang Xiao, Jingxiang Yang
doaj +1 more source
Quasirandomness in hypergraphs [PDF]
Electronic Notes in Discrete Mathematics, 2017 An $n$-vertex graph $G$ of edge density $p$ is considered to be quasirandom if it shares several important properties with the random graph $G(n,p)$. A well-known theorem of Chung, Graham and Wilson states that many such `typical' properties are asymptotically equivalent and, thus, a graph $G$ possessing one such property automatically satisfies the ...
Elad Aigner-Horev +4 more
openaire +5 more sources
Infection in hypergraphs [PDF]
Discrete Applied Mathematics, 2018 In this paper a new parameter for hypergraphs called hypergraph infection is defined. This concept generalizes zero forcing in graphs to hypergraphs. The exact value of the infection number of complete and complete bipartite hypergraphs is determined. A formula for the infection number for interval hypergraphs and several families of cyclic hypergraphs
Ryan Bergen +7 more
openaire +2 more sources