RBSC-SubGen

RBSC-SubGen is a recursive deck generation algorithm for deck construction based on rank-biserial correlation (RBSC).

This relies on a simple difference formula. The goal of RBSC-SubGen is to construct a desired number (possibly more than two) of subsets (i.e., decks) with a desired difficulty relation from a large universal set. If it is formulated as a ranking relation RBSC-SubGen is applicable to the subset selection problem if it is formulated as a ranking relation.