Results 81 to 90 of about 14,067 (220)
Hypergraph Learning: From Algorithms to Applications [PDF]
Graphs are a general language for describing and modeling interconnected systems. To learn graph data, Graph Neural Networks (GNNs) have been introduced.
Saifuddin, Khaled Mohammed
core +1 more source
Weak hypergraph regularity and linear hypergraphs
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yoshiharu Kohayakawa +3 more
openaire +3 more sources
ABSTRACT In this work, we introduce and study the p$$ p $$‐α$$ \alpha $$‐closest‐center problem (pα$$ p\alpha $$CCP), which is a generalization of the p$$ p $$‐second‐center problem, a recently emerged variant of the classical (discrete) p‐center problem.
Elisabeth Gaar +2 more
wiley +1 more source
Person Re-identification by Multi-hypergraph Fusion
Matching people across nonoverlapping cameras, also known as person re-identification, is an important and challenging research topic. Despite its great demand in many crucial applications such as surveillance, person re-identification is still far ...
Chen, Xiaojing (xchen010@ucr.edu) +4 more
core +1 more source
ABSTRACT Cognitive diagnosis aims to infer learners' knowledge states from their exercise responses, enabling personalised education at scale. Existing methods represent exercises solely by coarse‐grained knowledge component annotations, overlooking semantic content and step‐level cognitive processes.
Youheng Bai +4 more
wiley +1 more source
Application of hypergraphs in decomposition of discrete systems [PDF]
seria: Lecture Notes in Control and Computer Science ; vol ...
Wiśniewska, Monika
core
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
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
Clusterix: A Hybrid Visualization Model for Hierarchically Clustered Networks
Abstract We introduce Clusterix, a novel hybrid visualization model for representing hierarchically clustered networks, which also supports directed and weighted edges. Clusterix offers an integrated view of both the network and its full cluster hierarchy by compactly visualizing the cluster inclusion tree enriched with links of the network.
Carla Binucci +6 more
wiley +1 more source
ABSTRACT Traditional graph representations are insufficient for modelling real‐world phenomena involving multi‐entity interactions, such as collaborative projects or protein complexes, necessitating the use of hypergraphs. While hypergraphs preserve the intrinsic nature of such complex relationships, existing models often overlook temporal evolution in
Xianghe Zhu, Qiwei Yao
wiley +1 more source

