Results 111 to 120 of about 56,011 (266)
Hypergraph Representation via Axis-Aligned Point-Subspace Cover [PDF]
We propose a new representation of $k$-partite, $k$-uniform hypergraphs, that is, a hypergraph with a partition of vertices into $k$ parts such that each hyperedge contains exactly one vertex of each type; we call them $k$-hypergraphs for short.
Oksana Firman, Joachim Spoerhase
doaj +1 more source
A New Transport Distance and Its Associated Ricci Curvature of Hypergraphs
The coarse Ricci curvature of graphs introduced by Ollivier as well as its modification by Lin–Lu– Yau have been studied from various aspects. In this paper, we propose a new transport distance appropriate for hypergraphs and study a generalization of ...
Akamatsu Tomoya
doaj +1 more source
Local Hypergraph-based Nested Named Entity Recognition as Query-based Sequence Labeling [PDF]
Yukun Yan, Sen Song
openalex +1 more source
CoRoFR: Community Detection of Feature Graph Improves Feature Selection Using Robust Fuzzy Rough Set
In machine learning, features often function as communities in many tasks, especially in medicine. However, existing feature selection methods struggle to mine feature collaborations, which can boost predictive performance. Moreover, they are noise‐sensitive, leading to suboptimal feature selection and accuracy degradation.
Duanyang Feng +4 more
wiley +1 more source
Study on the reliability of hypergraphs based on non-backtracking matrix centrality
In recent years, there has been widespread attention on hypergraphs as a research hotspot in network science.The unique structure of hypergraphs, which differs from traditional graphs, is characterized by hyperedges that can connect multiple nodes ...
Hao PENG, Cheng QIAN, Dandan ZHAO, Ming ZHONG, Jianmin HAN, Ziyi XIE, Wei WANG
doaj +3 more sources
On the separability of elements and sets in hypergraphs of models of a theory
We consider topological properties of hypergraphs of models of a theory. The separability of elements in these hypergraphs is characterized in terms of algebraic closures. Similarly we specify the separability of sets by the hypergraphs.
S.V. Sudoplatov
doaj
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
ABSTRACT A family ℱ of subsets of [ n ] = { 1 , 2 , … , n } shatters a set A ⊆ [ n ] if for every A ′ ⊆ A, there is an F ∈ ℱ such that F ∩ A = A '. We develop a framework to analyze f ( n , k , d ), the maximum possible number of subsets of [ n ] of size d that can be shattered by a family of size k.
Noga Alon +2 more
wiley +1 more source
In this paper, we prove that for any $k\ge 3$, there exist infinitely many minimal asymmetric $k$-uniform hypergraphs. This is in a striking contrast to $k=2$, where it has been proved recently that there are exactly $18$ minimal asymmetric graphs. We also determine, for every $k\ge 1$, the minimum size of an asymmetric $k$-uniform hypergraph.
Jiang, Yiting, Nešetřil, Jaroslav
openaire +2 more sources
PLNet: Persistent Laplacian neural network for protein–protein binding free energy prediction
Abstract Recent advances in topology‐based modeling have greatly improved molecular prediction tasks, particularly in protein–ligand binding affinity. However, when the focus shifts to predicting protein–protein interactions (PPIs) binding free energy, the question becomes significantly more challenging due to the ineffective use of topological ...
Xingjian Xu +3 more
wiley +1 more source

