Subset Searching Algorithm Using DPP Greedy MAP

Given item set, item representation vector, and item ratings, find a subset with better relevance-diversity trade-off. Also provide machine learning algorithm to learn item representations maximizing log likelihood under DPP assumption. References: [1]Laming Chen, Guoxin Zhang, and Hanning Zhou(2017)<> [2]Laming Chen, Guoxin Zhang, and Hanning Zhou(2018)<> [3]Wilhelm, Mark & Ramanathan, Ajith & Bonomo, Alexander & Jain, Sagar & Chi, Ed & Gillenwater, Jennifer(2018).


Reference manual

It appears you don't have a PDF plugin for this browser. You can click here to download the reference manual.


0.0.2 by Sining Ng, 8 months ago

Browse source code at

Authors: Sining Ng [aut, cre] , Laming Chen [aut] , Guoxin Zhang [aut] , Hanning Zhou [aut] , Jennifer Gillenwater [aut] , Ed H. Chi [aut] , Sagar Jain [aut] , Alexander Bonomo [aut] , Ajith Ramanathan [aut] , Mark Wilhelm [aut] , Antonio Sánchez [cph] ( , Christoph Hertzberg [cph] ( , David Tellenbach [cph] ( , Eigen Bugzilla [cph] ( , Gael Guennebaud [cph] ( , Rasmus Munk Larsen [cph] ( , Guoqiang QI [cph] ( , Konstantinos Margaritis [cph] (

Documentation:   PDF Manual  

MIT + file LICENSE license

Imports Rcpp

Linking to Rcpp

See at CRAN