Yuan Sun

most citedImproved Algorithms for Exact and Approximate Boolean Matrix Decomposition

1 citations · 1 across the 2 of their papers we have counts for

collaborators

2 papers

cs.CY2022

Prerequisite-driven Q-matrix Refinement for Learner Knowledge Assessment: A Case Study in Online Learning Context

Wenbin Gan, Yuan Sun

The ever growing abundance of learning traces in the online learning platforms promises unique insights into the learner knowledge assessment (LKA), a fundamental personalized-tuto…

cs.DM2015★ 1 cited

Improved Algorithms for Exact and Approximate Boolean Matrix Decomposition

Yuan Sun, Shiwei Ye, Yi Sun +1

An arbitrary $m \times n$ Boolean matrix $M$ can be decomposed {\em exactly} as $M = U \circ V$ , where $U$ (resp. $V$ ) is an $m \times k$ (resp. $k \times n$ ) Boolean matrix and $\circ$ …