mlsanityData to 14 Oct 2026

Fair Recommendation by Geometric Interpretation and Analysis of Matrix Factorization

arXiv 2301.03791 ↗First posted 10 Jan 2023cs.IR cs.AIcited by 0

Not on the map. Why?

Abstract (arXiv)

Matrix factorization-based recommender system is in effect an angle preserving dimensionality reduction technique. Since the frequency of items follows power-law distribution, most vectors in the original dimension of user feature vectors and item feature vectors lie on the same hyperplane. However, it is very difficult to reconstruct the embeddings in the original dimension analytically, so we reformulate the original angle preserving dimensionality reduction problem into a distance preserving dimensionality reduction problem. We show that the geometric shape of input data of recommender system in its original higher dimension are distributed on co-centric circles with interesting properties, and design a paraboloid-based matrix factorization named ParaMat to solve the recommendation problem. In the experiment section, we compare our algorithm with 8 other algorithms and prove our new method is the most fair algorithm compared with modern day recommender systems such as ZeroMat and DotMat Hybrid.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 9 of its 14 references that are in the map. First posted on arXiv 10 Jan 2023.

Builds on

9 of 14 references.

References · 9

  1. 2017DeepFM: A Factorization-Machine based Neural Network for CTR Predictioncited by 676
  2. 2020Controlling Fairness and Bias in Dynamic Learning-to-Rankcited by 68
  3. 2021Modeling Dynamic Attributes for Next Basket Recommendationcited by 6
  4. 2020MatRec: Matrix Factorization for Highly Skewed Datasetcited by 4
  5. 2021Zipf Matrix Factorization : Matrix Factorization with Matthew Effect Reductioncited by 4
  6. 2021ZeroMat: Solving Cold-start Problem of Recommender System with No Input Datacited by 4
  7. 2022KL-Mat : Fair Recommender System via Information Geometrycited by 3
  8. 2022DotMat: Solving Cold-start Problem and Alleviating Sparsity Problem for Recommender Systemscited by 3
  9. 2022PoissonMat: Remodeling Matrix Factorization using Poisson Distribution and Solving the Cold Start Problem without Input Datacited by 1

Built on by

Not cited yet.