NDLI: On the complexity of package recommendation problems

Please wait, while we are loading the content...

What next?: a half-dozen data management research goals for big data and the cloud

Graph sketches: sparsification, spanners, and subgraphs

The ACM PODS Alberto O. Mendelzon test-of-time award 2012

Linguistic foundations for bidirectional transformations: invited tutorial

The power of the dinur-nissim algorithm: breaking privacy of statistical and graph databases

Space-efficient range reporting for categorical data

Approximate computation and implicit regularization for very large-scale data analysis

Query-based data pricing

The wavelet trie: maintaining an indexed sequence of strings in compressed space

Classification of annotation semirings over query containment

Space-efficient estimation of statistics over sub-sampled streams

Approximating and testing k-histogram distributions in sub-linear time

Worst-case optimal join algorithms: [extended abstract]

A rigorous and customizable framework for privacy

Dynamic top-k range reporting in external memory

Max-Sum diversification, monotone submodular functions and dynamic updates

Local transformations and conjunctive-query equivalence

On the optimality of clustering properties of space filling curves

Efficient approximations of conjunctive queries

Rectangle-efficient aggregation in spatial data streams

Mergeable summaries

Deterministic regular expressions in linear time

Static analysis and optimization of semantic web queries

Indexability of 2D range search revisited: constant redundancy and weak indivisibility

A dichotomy in the complexity of deletion propagation with functional dependencies

Nearest-neighbor searching under uncertainty

On the complexity of package recommendation problems

Randomized algorithms for tracking distributed count, frequencies, and ranks

The complexity of evaluating path expressions in SPARQL

Continuous distributed counting for non-monotonic streams

On the complexity of package recommendation problems

Content Provider	ACM Digital Library
Author	Geerts, Floris Deng, Ting Fan, Wenfei
Abstract	Recommendation systems aim to recommend items that are likely to be of interest to users. This paper investigates several issues fundamental to such systems. We model recommendation systems for packages of items. We use queries to specify multi-criteria for item selections and express compatibility constraints on items in a package, and use functions to compute the cost and usefulness of items to a user. We study recommendations of points of interest, to suggest top-k packages. We also investigate recommendations of top-k items, as a special case. In addition, when sensible suggestions cannot be found, we propose query relaxation recommendations to help users revise their selection criteria, or adjustment recommendations to guide vendors to modify their item collections. We identify several problems, to decide whether a set of packages makes a top-k recommendation, whether a rating bound is maximum for selecting top-k packages, whether we can relax the selection query to find packages that users want, and whether we can update a bounded number of items such that the users' requirements can be satisfied. We also study function problems for computing top-k packages, and counting problems to find how many packages meet the user's criteria. We establish the upper and lower bounds of these problems, all matching, for combined and data complexity. These results reveal the impact of variable sizes of packages, the presence of compatibility constraints, as well as a variety of query languages for specifying selection criteria and compatibility constraints, on the analyses of these problems.
Starting Page	261
Ending Page	272
Page Count	12
File Format	PDF
ISBN	9781450312486
DOI	10.1145/2213556.2213592
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2012-05-21
Publisher Place	New York
Access Restriction	Subscribed
Subject Keyword	Recommendation problems Query relaxation Complexity
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

On the Complexity of Package Recommendation Problems

Improving package recommendations through query relaxation

Explorer On the complexity of package recommendation problems

Improving package recommendations through query relaxation

On the Probabilistic Query Complexity of Transitively Symmetric Problems

On the Probabilistic Query Complexity of Transitively Symmetric Problems

Automatic query expansion based on tag recommendation

On the Probabilistic Query Complexity of Transitively Symmetric Problems

Query intent prediction and recommendation

On the complexity of package recommendation problems

Similar Documents

On the Complexity of Package Recommendation Problems

Improving package recommendations through query relaxation

Explorer On the complexity of package recommendation problems

Improving package recommendations through query relaxation

On the Probabilistic Query Complexity of Transitively Symmetric Problems

On the Probabilistic Query Complexity of Transitively Symmetric Problems

Automatic query expansion based on tag recommendation

On the Probabilistic Query Complexity of Transitively Symmetric Problems

Query intent prediction and recommendation

On the complexity of package recommendation problems