Results 91 to 100 of about 2,959 (186)

Cross-modal Hypergraph Optimisation Learning for Multimodal Sentiment Analysis [PDF]

Jisuanji kexue
Sentiment expressions are multimodal,and more accurate emotions can be derived through multiple modalities such as verbal,audio,and visual.Studying the interactions among modalities can effectively improve the accuracy of multimodal sentiment analysis ...
JIANG Kun, ZHAO Zhengpeng, PU Yuanyuan, HUANG Jian, GU Jinjing, XU Dan
doaj   +1 more source

3-Zero-Divisor Hypergraph with Respect to an Element in Multiplicative Lattice

Cumhuriyet Science Journal, 2019
Let be a multiplicative lattice and be a proper element of . We introduce the3-zero-divisor hypergraph of with respect to which is a hypergraph whose vertices areelements of the set where distinct vertices and are adjacent, that is, is a hyperedge if and
Gülşen Ulucak
doaj   +1 more source

Lines in hypergraphs

Combinatorica, 2013
One of the De Bruijn - Erdos theorems deals with finite hypergraphs where every two vertices belong to precisely one hyperedge. It asserts that, except in the perverse case where a single hyperedge equals the whole vertex set, the number of hyperedges is at least the number of vertices and the two numbers are equal if and only if the hypergraph belongs
Laurent Beaudou, J. Adrian Bondy, Xiaomin Chen, Ehsan Chiniforooshan, Maria Chudnovsky, Vasek Chvátal, Nicolas Fraiman, Yori Zwols   +7 more
openaire   +3 more sources

Assigning entities to teams as a hypergraph discovery problem

Communications Physics
Assigning agents to teams under strict task and effort constraints is crucial in business, science, and engineering, where disruptions can cause significant losses.
Guilherme Ferraz de Arruda, Wan He, Nasimeh Heydaribeni, Tara Javidi, Yamir Moreno, Tina Eliassi-Rad   +5 more
doaj   +1 more source

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., Deshpande Charusheela M., Bam Bhagyashree Y.   +2 more
doaj   +1 more source

AHD-SLE: Anomalous Hyperedge Detection on Hypergraph Symmetric Line Expansion

Axioms
Graph 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, Hongtao Yu, Haitao Li, Fei Pan, Shuxin Liu   +4 more
doaj   +1 more source

Hypergraph Convolutional Network with Multi-perspective Topology Refinement forSkeleton-based Action Recognition [PDF]

Jisuanji kexue
Since the human skeleton is a natural topological structure,graph convolutional networks(GCNs) are widely used for skeleton-based human action recognition.In recent research,skeleton sequences are represented as spatio-temporal graphs and topology graphs
HUANG Qian, SU Xinkai, LI Chang, WU Yirui
doaj   +1 more source

Hypergraph animals

Physical Review E
Here 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

Stable Hypergraph Matching in Unimodular Hypergraphs

CoRR
To be published at ICALP ...
Biró, Péter, Csáji, Gergely, Schlotter, Ildikó   +2 more
openaire   +3 more sources

On decomposing a hypergraph into k connected sub-hypergraphs

Discrete Applied Mathematics, 2003
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
András Frank, Tamás Király, Matthias Kriesell   +2 more
openaire   +1 more source