A Refined SVD Algorithm for Collaborative Filtering

• URL: http://arxiv.org/abs/2012.06923v1
• Date: Sun, 13 Dec 2020 00:04:11 GMT
• Title: A Refined SVD Algorithm for Collaborative Filtering
• Authors: Marko Kabi\'c, Gabriel Duque L\'opez, Daniel Keller
• Abstract summary: Collaborative filtering tries to predict the ratings of a user over some items based on opinions of other users with similar taste. Various approaches to collaborative filtering exist, some of the most popular ones being the Singular Value Decomposition (SVD) and K-means clustering.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Collaborative filtering tries to predict the ratings of a user over some items based on opinions of other users with similar taste. The ratings are usually given in the form of a sparse matrix, the goal being to find the missing entries (i.e. ratings). Various approaches to collaborative filtering exist, some of the most popular ones being the Singular Value Decomposition (SVD) and K-means clustering. One of the challenges in the SVD approach is finding a good initialization of the unknown ratings. A possible initialization is suggested by [1]. In this paper we explain how K-means approach can be used to achieve the further refinement of this initialization for SVD. We show that our technique outperforms both initialization techniques used separately.

Related papers

• CostFilter-AD: Enhancing Anomaly Detection through Matching Cost Filtering [55.06680629960542]
  Unsupervised anomaly detection (UAD) seeks to localize the anomaly mask of an input image with respect to normal samples.<n>We introduce the concept of cost filtering, borrowed from classical matching tasks, into the UAD problem.<n>We propose a cost volume filtering network, guided by the input observation as an attention query across multiple feature layers.
  arXiv  Detail & Related papers  (2025-05-02T14:52:34Z)
• SUnAA: Sparse Unmixing using Archetypal Analysis [62.997667081978825]
  This paper introduces a new geological error map technique using archetypal sparse analysis (SUnAA) First, we design a new model based on archetypal sparse analysis (SUnAA)
  arXiv  Detail & Related papers  (2023-08-09T07:58:33Z)
• Understanding the Covariance Structure of Convolutional Filters [86.0964031294896]
  Recent ViT-inspired convolutional networks such as ConvMixer and ConvNeXt use large-kernel depthwise convolutions with notable structure. We first observe that such learned filters have highly-structured covariance matrices, and we find that covariances calculated from small networks may be used to effectively initialize a variety of larger networks.
  arXiv  Detail & Related papers  (2022-10-07T15:59:13Z)
• Consistent Collaborative Filtering via Tensor Decomposition [0.2578242050187029]
  Collaborative filtering is the de facto standard for analyzing users' activities and building recommendation systems for items. We develop Sliced Anti-symmetric Decomposition (SAD), a new model for collaborative filtering based on implicit feedback. We demonstrate the efficiency of SAD in both simulated and real world datasets containing over 1M user-item interactions.
  arXiv  Detail & Related papers  (2022-01-28T05:14:37Z)
• Adaptive Sampling for Heterogeneous Rank Aggregation from Noisy Pairwise Comparisons [85.5955376526419]
  In rank aggregation problems, users exhibit various accuracy levels when comparing pairs of items. We propose an elimination-based active sampling strategy, which estimates the ranking of items via noisy pairwise comparisons. We prove that our algorithm can return the true ranking of items with high probability.
  arXiv  Detail & Related papers  (2021-10-08T13:51:55Z)
• Fast Variational AutoEncoder with Inverted Multi-Index for Collaborative Filtering [59.349057602266]
  Variational AutoEncoder (VAE) has been extended as a representative nonlinear method for collaborative filtering. We propose to decompose the inner-product-based softmax probability based on the inverted multi-index. FastVAE can outperform the state-of-the-art baselines in terms of both sampling quality and efficiency.
  arXiv  Detail & Related papers  (2021-09-13T08:31:59Z)
• Estimating leverage scores via rank revealing methods and randomization [50.591267188664666]
  We study algorithms for estimating the statistical leverage scores of rectangular dense or sparse matrices of arbitrary rank. Our approach is based on combining rank revealing methods with compositions of dense and sparse randomized dimensionality reduction transforms.
  arXiv  Detail & Related papers  (2021-05-23T19:21:55Z)
• Sequence-Based Filtering for Visual Route-Based Navigation: Analysing the Benefits, Trade-offs and Design Choices [17.48671856442762]
  An emerging trend in Visual Place Recognition (VPR) is the use of sequence-based filtering methods on top of single-frame-based place matching techniques. This paper conducts an in-depth investigation of the relationship between the performance of single-frame-based place matching techniques and the use of sequence-based filtering on top of those methods.
  arXiv  Detail & Related papers  (2021-03-02T19:24:58Z)
• Sparse-Interest Network for Sequential Recommendation [78.83064567614656]
  We propose a novel textbfSparse textbfInterest textbfNEtwork (SINE) for sequential recommendation. Our sparse-interest module can adaptively infer a sparse set of concepts for each user from the large concept pool. SINE can achieve substantial improvement over state-of-the-art methods.
  arXiv  Detail & Related papers  (2021-02-18T11:03:48Z)
• Scalable Initialization Methods for Large-Scale Clustering [0.0]
  Two new methods for K-means clustering are proposed. The proposed methods are scalable and can be run in parallel. Experiments show that the proposed methods compare favorably to the state-of-the-art.
  arXiv  Detail & Related papers  (2020-07-23T11:29:53Z)
• Leveraging Cross Feedback of User and Item Embeddings with Attention for Variational Autoencoder based Collaborative Filtering [25.569930256022925]
  We propose a VAE-based Bayesian MF framework to approximate the user-item joint distribution. The framework is iterative with cross feedback of user and item embeddings into each other's encoders. It reconstructs the data via the matrix factorization over the currently re-sampled user and item embeddings.
  arXiv  Detail & Related papers  (2020-02-21T06:05:06Z)
• A novel initialisation based on hospital-resident assignment for the k-modes algorithm [0.0]
  This paper presents a new way of selecting an initial solution for the k-modes algorithm. It allows for a notion of mathematical fairness and a leverage of the data that the common initialisations from literature do not.
  arXiv  Detail & Related papers  (2020-02-07T10:20:49Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.