Dual-branch differential channel hypergraph convolutional network for human skeleton based action recognition. [PDF]
Graph Convolutional Networks (GCNs) perform well in skeleton action recognition tasks, but their pairwise node connections make it difficult to effectively model high-order dependencies between non-adjacent joints.
Dong Chen +4 more
doaj +2 more sources
Hyperbolic multi-channel hypergraph convolutional neural network based on multilayer hypergraph [PDF]
In recent years, hypergraph neural networks have achieved remarkable success in tasks such as node classification, link prediction, and graph classification, thanks to their powerful computational capabilities.
Libing Bai +4 more
doaj +2 more sources
On edge product hypergraphs [PDF]
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]
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
On domination in an edge product hypergraphs [PDF]
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
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
The treewidth of 2-section of hypergraphs [PDF]
Let $H=(V,F)$ be a simple hypergraph without loops. $H$ is called linear if $|f\cap g|\le 1$ for any $f,g\in F$ with $f\not=g$. The $2$-section of $H$, denoted by $[H]_2$, is a graph with $V([H]_2)=V$ and for any $ u,v\in V([H]_2)$, $uv\in E([H]_2)$ if ...
Ke Liu, Mei Lu
doaj +1 more source
Multi-site Hyper-graph Convolutional Neural Networks and Application [PDF]
Recently,the exploitation of graph neural networks for neurological brain disorder diagnosis has attracted much attention.However,the graphs used in the existing studies are usually based on the pairwise connections of different nodes,and thus cannot ...
ZHOU Hai-yu, ZHANG Dao-qiang
doaj +1 more source
Automatic Software Module Partition Based on Hypergraph Model [PDF]
This paper applies the hypergraph model to design automatic software module partition algorithm.Under the hypergraph modeling,each significant class extracted from the source codes of an analyzing software system is abstracted as a vertex of a hypergraph,
WEI Xiaofeng,HU Jicheng,LUO Yongβen
doaj +1 more source
Super edge-magic labeling for π-uniform, complete π-uniform and complete π-uniform π-partite hypergraphs [PDF]
Let π» be a hypergraph with a vertex set π and a hyperedge set πΈ. Generalized from the super edge-magic in a graph, we say that a hypergraph π» is super edge-magic if there is a bijection π: π βͺ πΈ β {1,2,3, β¦ , |π| + |πΈ|} which satisfies: (i) there exists
Ratinan Boonklurb +2 more
doaj +1 more source

