Studying Recommendation Algorithms by Graph Analysis

  • Authors:
  • Batul J. Mirza;Benjamin J. Keller;Naren Ramakrishnan

  • Affiliations:
  • Department of Computer Science, Virginia Tech, Blacksburg, VA 24061, USA. bmirza@csgrad.cs.vt.edu;Department of Computer Science, Eastern Michigan University, Ypsilanti, MI 48197, USA. Ben.Keller@emich.edu;Department of Computer Science, Virginia Tech, Blacksburg, VA 24061, USA. naren@cs.vt.edu

  • Venue:
  • Journal of Intelligent Information Systems
  • Year:
  • 2003

Quantified Score

Hi-index 0.01

Visualization

Abstract

We present a novel framework for studying recommendation algorithms in terms of the ‘jumps’ that they make to connect people to artifacts. This approach emphasizes reachability via an algorithm within the implicit graph structure underlying a recommender dataset and allows us to consider questions relating algorithmic parameters to properties of the datasets. For instance, given a particular algorithm ‘jump,’ what is the average path length from a person to an artifact? Or, what choices of minimum ratings and jumps maintain a connected graph? We illustrate the approach with a common jump called the ‘hammock’ using movie recommender datasets.