MovieLens

swMATH30713MaRDI QIDQ42427FDOQ42427

Author name not available (Why is that?)

Cited In (68)

• Distributed Bayesian matrix factorization with limited communication
• Collaborative filtering recommendation algorithm towards intelligent community
• \(t\)-copula from the viewpoint of tail dependence matrices
• Robust reputation independence in ranking systems for multiple sensitive attributes
• Title not available (Why is that?)
• \textsc{Rankboost} \(+\): an improvement to \textsc{Rankboost}
• Selective inference for latent block models
• Title not available (Why is that?)
• Efficiency and budget balance in general quasi-linear domains
• Decomposition-by-normalization (DBN): leveraging approximate functional dependencies for efficient CP and Tucker decompositions
• Optimized item selection to boost exploration for recommender systems
• A smart privacy-preserving learning method by fake gradients to protect users items in recommender systems
• A differential privacy framework for collaborative filtering
• Adaptive nonnegative matrix factorization and measure comparisons for recommender systems
• Cost-sensitive three-way recommendations by learning pair-wise preferences
• Efficiency and Budget Balance
• Providing reliability in recommender systems through Bernoulli matrix factorization
• Discovering a taste for the unusual: exceptional models for preference mining
• Title not available (Why is that?)
• Argumentative explanations for interactive recommendations
• Structure learning for relational logistic regression: an ensemble approach
• A comparison of instance-level counterfactual explanation algorithms for behavioral and textual data: SEDC, LIME-C and SHAP-C
• Understanding collaborative filtering parameters for personalized recommendations in e-commerce
• A fuzzy content-based group recommender system with dynamic selection of the aggregation functions
• Link prediction via linear optimization
• Profile likelihood biclustering
• Riemannian gradient descent methods for graph-regularized matrix completion
• Title not available (Why is that?)
• Ranking with submodular functions on a budget
• Locality sensitive hashing with extended differential privacy
• Hyperparameter optimization for recommender systems through Bayesian optimization
• SAMBA: A Generic Framework for Secure Federated Multi-Armed Bandits
• Unsupervised dimensionality reduction versus supervised regularization for classification from sparse data
• CayleyNets: Graph Convolutional Neural Networks With Complex Rational Spectral Filters
• HDDA: DataSifter: statistical obfuscation of electronic health records and other sensitive datasets
• Fast Adaptive Non-Monotone Submodular Maximization Subject to a Knapsack Constraint
• FrankWolfe.jl: A High-Performance and Flexible Toolbox for Frank–Wolfe Algorithms and Conditional Gradients
• Title not available (Why is that?)
• Title not available (Why is that?)
• Desingularization of Bounded-Rank Matrix Sets
• The rankability of weighted data from pairwise comparisons
• K-dominance in multidimensional data: theory and applications
• Understanding the Impact of Individual Users’ Rating Characteristics on the Predictive Accuracy of Recommender Systems
• Mixed Integer Programming for Searching Maximum Quasi-Bicliques
• Learning context-dependent choice functions
• A Logistic Factorization Model for Recommender Systems With Multinomial Responses
• Estimating the largest elements of a matrix
• A divide-and-conquer algorithm for binary matrix completion
• Majorized proximal alternating imputation for regularized rank constrained matrix completion
• Title not available (Why is that?)
• A Newton-Based Method for Nonconvex Optimization with Fast Evasion of Saddle Points
• Quantum greedy algorithms for multi-armed bandits
• Matrix Completion With Covariate Information
• Incorporating side information into robust matrix factorization with Bayesian quantile regression
• A framework for parallel second order incremental optimization algorithms for solving partially separable problems
• On the Convergence to Stationary Points of Deterministic and Randomized Feasible Descent Directions Methods
• A nonconvex approach to low-rank matrix completion using convex optimization
• Efficient Algebraic Multigrid Methods for Multilevel Overlapping Coclustering of User-Item Relationships
• On the Convergence of Projected-Gradient Methods with Low-Rank Projections for Smooth Convex Minimization over Trace-Norm Balls and Related Problems
• K-Dominance in Multidimensional Data: Theory and Applications
• Redundancy Techniques for Straggler Mitigation in Distributed Optimization and Learning
• Learning over No-Preferred and Preferred Sequence of Items for Robust Recommendation
• Coalition formation in social environments with logic-based agents1
• Computing Large Market Equilibria Using Abstractions
• Approximate matrix completion based on cavity method
• Title not available (Why is that?)
• Triclustering in Big Data Setting
• An unsupervised outlier detection algorithm for categorical matrix-object data

This page was built for software: MovieLens