A latent space perturbation algorithm for Boolean Matrix completion based on weighted Frobenius norm
暂无分享,去创建一个
Yi Sun | Guiping Su | Shiwei Ye | Haobo Wang | Yuan Sun | Pan Liao
[1] Pauli Miettinen,et al. The Discrete Basis Problem , 2006, IEEE Transactions on Knowledge and Data Engineering.
[2] Michel C. Desmarais,et al. Mapping question items to skills with non-negative matrix factorization , 2012, SKDD.
[3] Jilles Vreeken,et al. Filling in the Blanks - Krimp Minimisation for Missing Data , 2008, 2008 Eighth IEEE International Conference on Data Mining.
[4] Tao Li,et al. A general model for clustering binary data , 2005, KDD '05.
[5] Yi Sun,et al. Alternating Recursive Method for Q-matrix Learning , 2014, EDM.
[6] Jaideep Vaidya. Boolean Matrix Decomposition Problem: Theory, Variations and Applications to Data Engineering , 2012, 2012 IEEE 28th International Conference on Data Engineering.
[7] Rudolf Wille,et al. Restructuring Lattice Theory: An Approach Based on Hierarchies of Concepts , 2009, ICFCA.
[8] Václav Snásel,et al. Implementing Boolean Matrix Factorization , 2008, ICANN.
[9] Gerhard Weikum,et al. Boolean Matrix Factorization with Missing Values , 2012 .