The recommender problem with convex hulls

DOI10.1080/03155986.2024.2303906MaRDI QIDQ6557743zbMATH OpenFDO

Authors Marie-Laure Bougnol, José H. Dulá

Publication date 18 June 2024

Published in INFOR: Information Systems and Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/03155986.2024.2303906

Mathematics Subject Classification ID

Computer science (68-XX)

Cites work

• A Bibliographical Survey On Some Well-Known Non-Standard Knapsack Problems
• A multi-class SVM approach based on the \( l_1\)-norm minimization of the distances between the reduced convex hulls
• Adaptive nonnegative matrix factorization and measure comparisons for recommender systems
• An Algorithm for Identifying the Frame of a Pointed Finite Conical Hull
• Eigentaste: A constant time collaborative filtering algorithm
• K-best feasible clusters - ranking optimal solutions from an infeasible LP
• Linear and Nonlinear Separation of Patterns by Linear Programming
• Linear programming support vector machines
• Quadratic problems defined on a convex hull of points
• Translation invariance in data envelopment analysis
• Translation invariance in data envelopment analysis: A generalization

This page was built for publication: The recommender problem with convex hulls

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