Search Results for author:
Found 1 papers, 1 papers with code
Grafting for Combinatorial Boolean Model using Frequent Itemset Mining
To overcome this computational difficulty, we propose an algorithm GRAB (GRAfting for Boolean datasets), which efficiently learns CBM within the $L_1$-regularized loss minimization framework.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
