On the Complexity of Query Result Diversification

DOI10.1145/2602136zbMath1333.68139OpenAlexW2163508424WikidataQ57495327 ScholiaQ57495327MaRDI QIDQ2790132

Ting Deng, Wenfei Fan

Publication date: 2 March 2016

Published in: ACM Transactions on Database Systems (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/20.500.11820/89aee8f1-4349-495b-9e41-6a137b322a6e

zbMATH Keywords

relevancediversityrecommender systemsdata complexitycounting problemsdatabase queriesresult diversificationcombined complexity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Database theory (68P15) Information storage and retrieval of data (68P20)

Uses Software

• FlexRecs

Cites Work

• Unnamed Item
• Unnamed Item
• The complexity of computing the permanent
• Counting feasible solutions of the traveling salesman problem with pickups and deliveries is \#\(P\)-complete
• The equitable dispersion problem
• Optimal aggregation algorithms for middleware.
• Composite recommendations: from items to packages
• Subtractive reductions and complete problems for counting complexity classes
• Polynomial Space Counting Problems
• Max-Sum Diversification, Monotone Submodular Functions, and Dynamic Updates
• On the Complexity of Package Recommendation Problems

This page was built for publication: On the Complexity of Query Result Diversification