A pareto-efficient algorithm for multiple objective optimization in e-commerce recommendation
Authors:
Open Access
- 10 September 2019
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 20-28
Abstract
No abstract availableKeywords
This publication has 37 references indexed in Scilit:
- Multiobjective Pareto-Efficient Approaches for Recommender SystemsACM Transactions on Intelligent Systems and Technology, 2014
- Latent dirichlet allocation based diversified retrieval for e-commerce search2014
- Personalised ranking with diversity2013
- Supporting keyword search in product databaseProceedings of the VLDB Endowment, 2013
- Adapting boosting for information retrieval measuresInformation Retrieval Journal, 2009
- Learning to rank2007
- Being accurate is not enough2006
- Learning to rank using gradient descent2005
- Item-based collaborative filtering recommendation algorithms2001
- On best approximate solutions of linear matrix equationsMathematical Proceedings of the Cambridge Philosophical Society, 1956