Eigentaste

swMATH12451MaRDI QIDQ24379FDOQ24379

Author name not available (Why is that?)

Cited In (48)

• Title not available (Why is that?)
• Title not available (Why is that?)
• 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
• Improving the performance of video Collaborative Filtering Recommender Systems using Optimization Algorithm
• Multilayer tensor factorization with applications to recommender systems
• A non-convex algorithm framework based on DC programming and DCA for matrix completion
• Fixed point and Bregman iterative methods for matrix rank minimization
• Title not available (Why is that?)
• Locally differentially private item-based collaborative filtering
• Title not available (Why is that?)
• Finding similar users in social networks
• Comparison-Based Interactive Collaborative Filtering
• 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
• Personalized recommendation via network-based inference with time
• Points of view: a conceptual space approach
• Low-rank factorization for rank minimization with nonconvex regularizers
• Orthogonal Rank-One Matrix Pursuit for Low Rank Matrix Completion
• Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm
• Making sense of sparse rating data in collaborative filtering via topographic organization of user preference patterns
• Matrix completion via a low rank factorization model and an augmented Lagrangean succesive overrelaxation algorithm
• Analyzing Consumer-Product Graphs: Empirical Findings and Applications in Recommender Systems
• Eigentaste: A constant time collaborative filtering algorithm
• Tensor Methods for Nonlinear Matrix Completion
• Computing Large Market Equilibria Using Abstractions
• Projected Landweber iteration for matrix completion
• Title not available (Why is that?)
• Matrix completion via an alternating direction method
• Optimal social choice functions: a utilitarian view
• Privacy Preserving Protocols for Eigenvector Computation
• Title not available (Why is that?)
• 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
• PRIVACY-PRESERVING SVD-BASED COLLABORATIVE FILTERING ON PARTITIONED DATA
• Transfer learning in heterogeneous collaborative filtering domains
• An efficient algorithm for learning to rank from preference graphs
• 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
• Flip-flop spectrum-revealing QR factorization and its applications to singular value decomposition
• The distortion of distributed voting
• Riemannian Stochastic Variance Reduced Gradient Algorithm with Retraction and Vector Transport

This page was built for software: Eigentaste