Results 111 to 120 of about 58,352 (274)
Local Hypergraph-based Nested Named Entity Recognition as Query-based Sequence Labeling [PDF]
, 2022 Yukun Yan, Sen Song
openalex +1 more source
CoRoFR: Community Detection of Feature Graph Improves Feature Selection Using Robust Fuzzy Rough Set
Advanced Intelligent Systems, Volume 7, Issue 12, December 2025.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
Journal of Combinatorial Designs, Volume 33, Issue 12, Page 456-470, December 2025.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
Tight Euler tours in uniform hypergraphs - computational aspects
, 2017 By a tight tour in a $k$-uniform hypergraph $H$ we mean any sequence of its vertices $(w_0,w_1,\ldots,w_{s-1})$ such that for all $i=0,\ldots,s-1$ the set $e_i=\{w_i,w_{i+1}\ldots,w_{i+k-1}\}$ is an edge of $H$ (where operations on indices are computed ...
Lonc, Zbigniew +2 more
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
PLNet: Persistent Laplacian neural network for protein–protein binding free energy prediction
Protein Science, Volume 34, Issue 12, December 2025.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
The role of twins in computing planar supports of hypergraphs
, 2020 A support or realization of a hypergraph $H$ is a graph $G$ on the same vertex as $H$ such that for each hyperedge of $H$ it holds that its vertices induce a connected subgraph of $G$.
Kanj, Iyad A. +4 more
core
Maximizing spectral radii of uniform hypergraphs with few edges
, 2015 In this paper we investigate the hypergraphs whose spectral radii attain the maximum among all uniform hypergraphs with given number of edges. In particular we characterize the hypergraph(s) with maximum spectral radius over all unicyclic hypergraphs ...
Fan, Yi-Zheng +3 more
core +1 more source
, 2021 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