On the complexity of package recommendation problems

DOI10.1137/120904524MaRDI QIDQ5396952zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Ting Deng, Wenfei Fan, Floris Geerts

Publication date 4 February 2014

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://www.pure.ed.ac.uk/ws/files/17627854/Deng_Fan_ET_AL_2012_On_the_Complexity_of_Package_Recommendation_Problems.pdf

zbMATH Keywords

computational complexityrecommendation problems

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Analysis of algorithms and problem complexity (68Q25) Database theory (68P15)

Recommendations

• Composite recommendations: from items to packages
• On the complexity of query result diversification
• scientific article; zbMATH DE number 1804122
• Computational complexity of queries based on itemsets
• Preference reasoning with soft constraints in constraint-based recommender systems

Cited in

(7)

• PackUp: tools for package upgradability solving
• Composite recommendations: from items to packages
• On the complexity of query result diversification
• Preference reasoning with soft constraints in constraint-based recommender systems
• Finding a collective set of items: from proportional multirepresentation to group recommendation
• Local search algorithms for the composite retrieval problem
• Conversational recommendation: theoretical model and complexity analysis

Describes a project that uses

Uses Software

• FlexRecs

This page was built for publication: On the complexity of package recommendation problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5396952)