A Theoretical Analysis of Query Selection for Collaborative Filtering
Explore this paper's citation graph
Summary
It is proved that no polynomial-time algorithm can have a significantly better bound on the number of queries unless all problems in NP have nO(log log n) time algorithms.
- Type
- article
- Published
- 2001-07-16
- Cited by
- 23
- References
- 22
- Access
- Open access
- OpenAlex
- https://openalex.org/W1950670
- Semantic Scholar
- https://api.semanticscholar.org/CorpusID:3113906
Keywords
Combinatorics, Function (biology), Integer (computer science), Mathematics, Polynomial
References
- Malicious Omissions and Errors in Answers to Membership Queries
- Collaborative Filtering Using Weighted Majority Prediction Algorithms
- An open architecture for collaborative filtering of netnews
- Constructing Optimal Binary Decision Trees is NP-Complete
- How many queries are needed to learn?
- Oracles and queries that are sufficient for exact learning (extended abstract)
- A threshold of ln n for approximating set cover (preliminary version)
- Decision trees for geometric models
- Approximation algorithms for combinatorial problems
- Efficient search for approximate nearest neighbor in high dimensional spaces
- Query by committee
- Generalized Teaching Dimensions and the Query Complexity of Learning
- Quantum versus classical learnability
- Queries and concept learning
- An optimal algorithm for approximate nearest neighbor searching fixed dimensions
- Queries revisited
- Empirical Analysis of Predictive Algorithms for Collaborative Filtering
- GroupLens
- Approximate nearest neighbors
- Approximate Nearest Neighbors: Towards Removing the Curse of Dimensionality
Cited by
- Output Divergence Criterion for Active Learning in Collaborative Settings
- Semantic feedback for hybrid recommendations in Recommendz
- Interactive Submodular Set Cover
- The SeniorGezond Recommender: exploration put into practice
- Optimizing hierarchical menus : a usage-based approach
- Recommending Informative Links
- Learning with matrix factorizations
- A general dimension for query learning
- Analysis of a greedy active learning strategy
- Generalization Error Bounds for Collaborative Prediction with Low-Rank Matrices
- WI/IAT 2003 Workshop on Applications, Products and Services of Web-based Support Systems
- Simultaneous Learning and Covering with Adversarial Noise
- Collaborative active learning
- Minimal Interaction Search: Multi-Way Search with Item Categories
- Active Learning and Submodular Functions
- Learning with non-Standard Supervision
- ON THE USE OF SEMANTIC FEEDBACK IN RECOMMENDER SYSTEMS
- Sequential Bayesian Search
- On User Recommendations Based on Multiple Cues
- Recommendation And Visualization Techniques For large Scale Data. (Les Techniques De Recommandation Et De Visualisation Pour Les Données A Une Grande Echelle)
Related papers
- A Note on Integer Solutions of the Diophantine Equation x2-dy2=1
- Small systems of Diophantine equations which have only very large integer solutions
- On an equation involving the Smarandache reciprocal function and its positive integer solutions
- Variational Inference via Rényi Upper-Lower Bound Optimization
- Two open problems on integer arithmetic
- A rail network performance metric to capture passenger experience
- Lower and upper bound shakedown analysis of structures with temperature-dependent yield stress
- On Integer Sequences Associated To Two Distinct Sums