To address the aforementioned challenges, we propose a novel task clustering algorithm based on the theory of matrix completion (Candès and Tao, 2010).
we deal with the huge number of entries by randomly sample task pairs to evaluate the S ij and S ji scores.