articleAug 11, 2013Closed access

FISM

University of Minnesota · Princeton University

Indexed incrossref

Abstract

The effectiveness of existing top-N recommendation methods decreases as the sparsity of the datasets increases. To alleviate this problem, we present an item-based method for generating top-N recommendations that learns the item-item similarity matrix as the product of two low dimensional latent factor matrices. These matrices are learned using a structural equation modeling approach, wherein the value being estimated is not used for its own estimation. A comprehensive set of experiments on multiple datasets at three different sparsity levels indicate that the proposed methods can handle sparse datasets effectively and outperforms other state-of-the-art top-N recommendation methods. The experimental results…

Citation impact

671
total citations
FWCI
44.29
Percentile
100%
References
16
Citations per year

Authors

3

Topics & keywords

Keywords
  • Computer science
  • Similarity (geometry)
  • Set (abstract data type)
  • Matrix (chemical analysis)
  • Sparse matrix
  • Matrix decomposition
  • Data mining
  • Product (mathematics)
No related works found for this paper.