Scalable Collaborative Ranking for Personalized Prediction
From MaRDI portal
Recommendations
Cites work
- A unified convergence analysis of block successive minimization methods for nonsmooth optimization
- Convexity, Classification, and Risk Bounds
- scientific article; zbMATH DE number 1869496 (Why is no real title available?)
- Matrix completion with covariate information
- On Convergence of the Maximum Block Improvement Method
- On ψ-Learning
- Online learning to rank with top-k feedback
- Ranking and empirical minimization of \(U\)-statistics
- Smooth neighborhood recommender systems
- Support-vector networks
- Surrogate regret bounds for bipartite ranking via strongly proper losses
Cited in
(7)- Sibrank: signed bipartite network analysis for neighbor-based collaborative ranking
- Exploiting explicit and implicit feedback for personalized ranking
- Two-level monotonic multistage recommender systems
- Learning over no-preferred and preferred sequence of items for robust recommendation
- Large Scale Ranking Using Stochastic Gradient Descent
- Exemplar-based large-scale low-rank matrix decomposition for collaborative prediction
- Reliable graph-based collaborative ranking
This page was built for publication: Scalable Collaborative Ranking for Personalized Prediction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6040680)