MovieLens

swMATH30713MaRDI QIDQ42427FDOQ42427

Author name not available (Why is that?)

Official website: https://grouplens.org/datasets/movielens/

Cited In (only showing first 100 items - show all)

• \(t\)-copula from the viewpoint of tail dependence matrices
• Robust reputation independence in ranking systems for multiple sensitive attributes
• \textsc{Rankboost} \(+\): an improvement to \textsc{Rankboost}
• Selective inference for latent block models
• 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
• Matrix completion with covariate information
• 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
• A Newton-based method for nonconvex optimization with fast evasion of saddle points
• A comparison of instance-level counterfactual explanation algorithms for behavioral and textual data: SEDC, LIME-C and SHAP-C
• 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
• SAMBA
• An ADMM-factorization algorithm for low rank matrix completion
• CayleyNets: Graph Convolutional Neural Networks With Complex Rational Spectral Filters
• dynamicTreeCut
• PrivateLR
• SuLQ
• Eigentaste
• softImpute
• Jellyfish
• trueskill
• Algorithm 674
• CYCLADES
• DeepDive
• LAS
• CINDy
• HDDA: DataSifter: statistical obfuscation of electronic health records and other sensitive datasets
• RTRMC
• TrueSkill
• ChEMBL
• idendr0
• ProdSumNet
• zipcode
• MDL4BMF
• JGibbLDA
• Fast Adaptive Non-Monotone Submodular Maximization Subject to a Knapsack Constraint
• AutoRec
• Bsig
• Surprise
• KGAT
• EigenRank
• PySyft
• HierNMF2
• bcv
• DataSifter
• FrankWolfe.jl: A High-Performance and Flexible Toolbox for Frank–Wolfe Algorithms and Conditional Gradients
• LETOR
• RANKBOOST+
• engsoccerdata
• scikit-optimize
• LightGCN
• CayleyNets
• Title not available (Why is that?)
• JSOSolvers.jl
• sgcen
• flashr
• Vissl
• MultiVis
• LEMP
• The rankability of weighted data from pairwise comparisons
• A nonconvex approach to low-rank matrix completion using convex optimization.
• Learning context-dependent choice functions
• DeepFM
• MABWiser
• RelNN
• Estimating the largest elements of a matrix
• RAPPOR
• On the Convergence to Stationary Points of Deterministic and Randomized Feasible Descent Directions Methods
• Desingularization of bounded-rank matrix sets
• Efficient Algebraic Multigrid Methods for Multilevel Overlapping Coclustering of User-Item Relationships
• Computing large market equilibria using abstractions
• Distributed Bayesian matrix factorization with limited communication
• Collaborative filtering recommendation algorithm towards intelligent community
• DeeperGCN
• RPLIB
• Title not available (Why is that?)
• K-Dominance in Multidimensional Data: Theory and Applications
• A smart privacy-preserving learning method by fake gradients to protect users items in recommender systems
• A differential privacy framework for collaborative filtering
• Representation learning for dynamic graphs: a survey
• Title not available (Why is that?)
• Argumentative explanations for interactive recommendations
• Structure learning for relational logistic regression: an ensemble approach
• Understanding collaborative filtering parameters for personalized recommendations in e-commerce
• On the convergence of projected-gradient methods with low-rank projections for smooth convex minimization over trace-norm balls and related problems
• Understanding the impact of individual users' rating characteristics on the predictive accuracy of recommender systems

This page was built for software: MovieLens