Evaluating Recommendation Algorithms by Graph Analysis

Details Evaluating Recommendation Algorithms by Graph Analysis Evaluating Recommendation Algorithms by Graph Analysis

2001-04-03

arxiv.org/abs/cs/0104009v1

Computer Science

Information Retrieval

Scientific paper

We present a novel framework for evaluating 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 serves as a complement to evaluation in terms of predictive accuracy. The framework 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.

Affiliated with

Also associated with

No associations

Rating

Evaluating Recommendation Algorithms by Graph Analysis does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Evaluating Recommendation Algorithms by Graph Analysis, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Evaluating Recommendation Algorithms by Graph Analysis will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-291820