A PhD thesis from Virginia Tech, published in 2001. (The PDF file is 3.8 MB, so be patient.) Abstract: Recommender systems have become paramount to customize information access and reduce information overload. They serve multiple uses, ranging from suggesting products and artifacts (to consumers), to bringing people together by the connections induced by (similar) reactions to products and services. This thesis presents a graph-theoretic model that casts recommendation as a process of `jumping connections' in a graph. In addition to emphasizing the social network aspect, this viewpoint provides a novel evaluation criterion for recommender systems. Algorithms for recommender systems are distinguished not in terms of predicted ratings of services/artifacts, but in terms of the combinations of people and artifacts that they bring together. We present an algorithmic framework drawn from random graph theory and outline an analysis for one particular form of jump called a `hammock.' Experimental results on two datasets collected over the Internet demonstrate the validity of this approach. Jumping Connections: A Graph-Theoretic Model for Recommender Systems [PDF] | 
