Results 111 to 120 of about 10,299 (219)
Identifiability conditions in cognitive diagnosis: Implications for Q‐matrix estimation algorithms
Abstract The Q‐matrix of a cognitively diagnostic assessment (CDA), documenting the item‐attribute associations, is a key component of any CDA. However, the true Q‐matrix underlying a CDA is never known and must be estimated—typically by content experts.
Hyunjoo Kim +2 more
wiley +1 more source
Weak saturation numbers of K2 , t and K p ⋃ K q
A graph G is weakly F-saturated if G contains no copy of F, and there is an ordering of all edges of G¯so that if they are added one at a time, they form a complete graph and each edge added creates a new copy of F.
Yajuan Cui, Liqun Pu
doaj +1 more source
Predicting lncRNA-protein interactions with bipartite graph embedding and deep graph neural networks. [PDF]
Ma Y, Zhang H, Jin C, Kang C.
europepmc +1 more source
Story2Board: A Training‐Free Approach for Expressive Visual Storytelling
Abstract We present Story2Board, a training‐free framework for expressive storyboard generation from natural language. Existing methods narrowly focus on subject identity, overlooking key aspects of visual storytelling such as spatial composition, background evolution, and narrative pacing.
D. Dinkevich +4 more
wiley +1 more source
scBGEDA: deep single-cell clustering analysis via a dual denoising autoencoder with bipartite graph ensemble clustering. [PDF]
Wang Y +6 more
europepmc +1 more source
On bipartite tetravalent graphs
In this paper the determination of all distance-transitive graphs of valency four is completed.
openaire +1 more source
Quantitative Metrics for Edge Bundling of Network Visualizations
Abstract Edge bundling is widely used for reducing visual clutter in large 2D network and trajectory visualizations. Various edge bundling methods have been proposed, each producing qualitatively distinct outputs for the same data; however, few quantitative metrics exist for systematic evaluation. In this paper, we propose a set of quantitative metrics
M. Wallinger +3 more
wiley +1 more source
Annihilating Graph of Abelian Groups
In [18], the author associated a graph to an R -module M which is precisely a generalization of annihilating ideal graph of a commutative ring, see [15] and [16]. Inasmuch as Abelian groups are precisely Z-modules, in this paper we relate an annihilating
saeed safaeeyan, Soraya Barzegar
doaj
Tumor relevant protein functional interactions identified using bipartite graph analyses. [PDF]
Venkatraman DL +3 more
europepmc +1 more source
Let \(A_{ij}\) be a binary triangle with base \(a_{1j}\), \(1\leq j\leq n\) such that \(a_{ij}=a_{i-1,j-1}+a_{i-1,j}\) for ...
openaire +2 more sources

