Incremental Set Recommendation Based on Class Differences
暂无分享,去创建一个
[1] Aditya G. Parameswaran,et al. Recommendation systems with complex constraints: A course recommendation perspective , 2011, TOIS.
[2] S. Minato. Implicit manipulation of polynomials using zero-suppressed BDDs , 1995, Proceedings the European Design and Test Conference. ED&TC 1995.
[3] Donald Ervin Knuth,et al. The Art of Computer Programming , 1968 .
[4] Shin-ichi Minato,et al. VSOP (Valued-Sum-of-Products) Calculator for Knowledge Processing Based on Zero-Suppressed BDDs , 2005, Federation over the Web.
[5] Jinyan Li,et al. CAEP: Classification by Aggregating Emerging Patterns , 1999, Discovery Science.
[6] Shin-ichi Minato,et al. Zero-Suppressed BDDs for Set Manipulation in Combinatorial Problems , 1993, 30th ACM/IEEE Design Automation Conference.
[7] Randal E. Bryant,et al. Graph-Based Algorithms for Boolean Function Manipulation , 1986, IEEE Transactions on Computers.
[8] Laks V. S. Lakshmanan,et al. Breaking out of the box of recommendations: from items to packages , 2010, RecSys '10.
[9] Paul Resnick,et al. Recommender systems , 1997, CACM.
[10] Cai-Nicolas Ziegler,et al. On Recommender Systems , 2013 .
[11] Nicolas Spyratos,et al. Federation over the Web - International Workshop, Dagstuhl Castle, Germany, May 1-6, 2005. Revised Selected Papers , 2010, Federation over the Web.
[12] Taghi M. Khoshgoftaar,et al. A Survey of Collaborative Filtering Techniques , 2009, Adv. Artif. Intell..
[13] Gonzalo Navarro,et al. A guided tour to approximate string matching , 2001, CSUR.
[14] Gediminas Adomavicius,et al. Toward the next generation of recommender systems: a survey of the state-of-the-art and possible extensions , 2005, IEEE Transactions on Knowledge and Data Engineering.
[15] Donald E. Knuth,et al. The Art of Computer Programming, Volume 4, Fascicle 2: Generating All Tuples and Permutations (Art of Computer Programming) , 2005 .