Results 71 to 80 of about 11,124 (213)
CAAI Transactions on Intelligence Technology, EarlyView.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
SIAM Journal on Discrete Mathematics, 2008 Generalizing the notion of split graphs to uniform hypergraphs, we prove that the class of these hypergraphs can be characterized by a finite list of excluded induced subhypergraphs. We show that a characterization by generalized degree sequences is impossible, unlike in the well-known case of split graphs. We also give an algorithm to decide whether a
openaire +2 more sources
Clusterix: A Hybrid Visualization Model for Hierarchically Clustered Networks
Computer Graphics Forum, EarlyView.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
Constructing Union-Free pairs of K-Element subsets [PDF]
, 2013 It is proved that one can choose [1/2(n/k)] disjoint pairs of k-element subsets of an n-element set in such a way that the unions of the pairs are all different, supposing that n > n(k)
Katona, Gyula
core
Hyper-Null Models and Their Applications
Entropy, 2023 Null models are crucial tools for investigating network topological structures. However, research on null models for higher-order networks is still relatively scarce.
Yujie Zeng +3 more
doaj +1 more source
Journal of Time Series Analysis, EarlyView.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
Networks, Volume 88, Issue 3, Page 331-353, October 2026.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
Series–parallel chromatic hypergraphs [PDF]
, 2010 In this paper two-terminal series–parallel chromatic hypergraphs are introduced and for this class of hypergraphs it is shown that the chromatic polynomial can be computed with polynomial complexity.
Bokhary, Syed Ahtsham Ul Haq +1 more
core +1 more source
Bounded diameter monochromatic component covers
Mathematika, Volume 72, Issue 4, October 2026.Abstract Ryser conjectured that every r$r$‐edge‐coloured complete graph can be covered by r−1$r-1$ monochromatic trees. Motivated by a question of Austin in analysis, Milićević predicted something stronger — that every r$r$‐edge‐coloured complete graph can be covered by r−1$r-1$ monochromatic trees of bounded diameter.
Alexey Pokrovskiy
wiley +1 more source
Journal of Physics: Complexity, 2023 Most real-world networks are endowed with the small-world property, by means of which the maximal distance between any two of their nodes scales logarithmically rather than linearly with their size.
Tanu Raghav +2 more
doaj +1 more source