swMATH12451MaRDI QIDQ24379FDOQ24379
Author name not available (Why is that?)
Official website: http://link.springer.com/article/10.1023%2FA%3A1011419012209
Cited In (64)
- Computing large market equilibria using abstractions
- Improving the performance of video Collaborative Filtering Recommender Systems using Optimization Algorithm
- Flip-flop spectrum-revealing QR factorization and its applications to singular value decomposition
- Title not available (Why is that?)
- Tensor methods for nonlinear matrix completion
- An alternating direction method with continuation for nonconvex low rank minimization
- A taxonomy of weight learning methods for statistical relational learning
- Comparison-based interactive collaborative filtering
- Multilayer tensor factorization with applications to recommender systems
- Generalized rank-breaking: computational and statistical tradeoffs
- A non-convex algorithm framework based on DC programming and DCA for matrix completion
- Fixed point and Bregman iterative methods for matrix rank minimization
- Locally differentially private item-based collaborative filtering
- Finding similar users in social networks
- Efficiency and budget balance in general quasi-linear domains
- Tell me who I am: An interactive recommendation system
- Long-term effects of user preference-oriented recommendation method on the evolution of online system
- Adaptive nonnegative matrix factorization and measure comparisons for recommender systems
- Efficiency and Budget Balance
- Analyzing consumer-product graphs: empirical findings and applications in recommender systems
- Personalized recommendation via network-based inference with time
- Points of view: a conceptual space approach
- Low-rank factorization for rank minimization with nonconvex regularizers
- An accelerated proximal gradient algorithm for nuclear norm regularized linear least squares problems
- Privacy-preserving SVD-based collaborative filtering on partitioned data
- Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm
- Privacy preserving protocols for eigenvector computation
- On exploiting classification taxonomies in recommender systems
- Making sense of sparse rating data in collaborative filtering via topographic organization of user preference patterns
- Comparison-based interactive collaborative filtering
- Matrix completion via a low rank factorization model and an augmented Lagrangean succesive overrelaxation algorithm
- Learning from comparisons and choices
- Algorithm 844
- ParNes
- Optspace
- FlexRecs
- Multilinear Engine
- HyPER
- LibRec
- Surprise
- MovieLens
- ADMiRA
- scPCA
- Eigentaste: A constant time collaborative filtering algorithm
- Auto-Surprise
- RockIt
- Projected Landweber iteration for matrix completion
- CountClust
- sgcen
- Matrix completion via an alternating direction method
- Orthogonal rank-one matrix pursuit for low rank matrix completion
- Optimal social choice functions: a utilitarian view
- Recommender systems research: a connection-centric survey
- Strictly contractive Peaceman-Rachford splitting method to recover the corrupted low rank matrix
- A Logistic Factorization Model for Recommender Systems With Multinomial Responses
- Transfer learning in heterogeneous collaborative filtering domains
- An efficient algorithm for learning to rank from preference graphs
- RAPPOR
- Including item characteristics in the probabilistic latent semantic analysis model for collaborative filtering
- Neighbor selection for user-based collaborative filtering using covering-based rough sets
- IMPROVED COLLABORATIVE FILTERING ALGORITHM VIA INFORMATION TRANSFORMATION
- Recent advances in personal recommender systems
- The distortion of distributed voting
- Riemannian Stochastic Variance Reduced Gradient Algorithm with Retraction and Vector Transport
This page was built for software: Eigentaste
