Results 81 to 90 of about 56,309 (276)
Multi-Level Refinement Algorithm of Weighted Hypergraph Partitioning Problem
The formal description of weighted hypergraph partitioning problem is presented. We describe the solution of the weighted hypergraph partitioning problem based on the multi-level method.
Leng Ming, Sun Ling-yu, Guo Kai-qiang
doaj +1 more source
We introduce the notion of an anti-edge of a hypergraph, which is a non-overall polychromatic subset of vertices. The maximal number of colors, for which there exists a coloring of a hypergraph using all colors, is called an upper chromatic number of a ...
V. Voloshin
doaj
On $\alpha$-spectral theory of a directed k-uniform hypergraph [PDF]
In this paper, we study a k-uniform directed hypergraph in general form and introduce its adjacency tensor, Laplacian tensor and signless Laplacian tensor. For the $k$-uniform directed hypergraph $\mathcal{H}$ and $0\leq \alpha
Gholam-Hasan Shirdel+2 more
doaj
Semi-Supervised Classification via Hypergraph Convolutional Extreme Learning Machine
Extreme Learning Machine (ELM) is characterized by simplicity, generalization ability, and computational efficiency. However, previous ELMs fail to consider the inherent high-order relationship among data points, resulting in being powerless on ...
Zhewei Liu+4 more
doaj +1 more source
Hypergraph Modelling for Geometric Model Fitting
In this paper, we propose a novel hypergraph based method (called HF) to fit and segment multi-structural data. The proposed HF formulates the geometric model fitting problem as a hypergraph partition problem based on a novel hypergraph model.
Lai, Taotao+3 more
core +1 more source
Protein-protein interaction (PPI) analysis based on mathematical modeling is an efficient means of identifying hub proteins, corresponding enzymes and many underlying structures.
Sathyanarayanan Gopalakrishnan+1 more
doaj +1 more source
Extreme violation of local realism in quantum hypergraph states
Hypergraph states form a family of multiparticle quantum states that generalizes the well-known concept of Greenberger-Horne-Zeilinger states, cluster states, and more broadly graph states.
Budroni, Costantino+2 more
core +1 more source
Ce‐LLMs: Status and trends of education‐specific large language models developed in China
Abstract The prevalence of AI hallucination in general‐purpose large language models (LLMs) poses significant pedagogical challenges, particularly in terms of content credibility and reliability. In response, China has launched the development of education‐specific LLMs as a national strategic initiative. However, current reports on Chinese educational
Tao Xie, Yingli Zhou, Jiazhen Yu
wiley +1 more source
Completion and decomposition of hypergraphs by domination hypergraphs
A graph consists of a finite non-empty set of vertices and a set of unordered pairs of vertices, called edges. A dominating set of a graph is a set of vertices D such that every vertex not in D is adjacent to some vertex in D. A hypergraph on a finite set X is a collection of subsets of X, none of which is a proper subset of another.
openaire +4 more sources
Random walks on hypergraphs [PDF]
In the last twenty years network science has proven its strength in modelling many real-world interacting systems as generic agents, the nodes, connected by pairwise edges. Yet, in many relevant cases, interactions are not pairwise but involve larger sets of nodes, at a time.
Carletti, Timoteo+3 more
openaire +9 more sources