From Tapestry to SVD: A Survey of the Algorithms That Power Recommender Systems

TriCollege Digital Repository

Show simple item record

dc.contributor.advisor Lindell, Steven Huttner, Joseph 2009-07-06T12:54:09Z 2009-07-06T12:54:09Z 2009
dc.description.abstract This paper is a survey of the algorithms that power recommender systems. To start, the social and monetary relevance of recommender systems is outlined. Then we delve into the specifics of how the first recommender system, Tapestry, coined the idea of numerically defining customer similarity. Moving forward, we show how this central concept of similarity is re-hashed in present day recommender systems, namely that of Specifically, we examine the complexity of a user-based approach in a large scale system such as Amazon's, identify its weaknesses, and see how these weaknesses are overcome using an item-based approach. The last component of this paper focuses on the Netflix Prize™ and investigates the single most important algorithm in the contest so far: an incremental approach to finding the singular value decomposition (SVD) of a mostly-blank matrix. en
dc.description.sponsorship Haverford College. Dept. of Computer Science en
dc.language.iso en en
dc.subject.lcsh Recommender systems (Information filtering)
dc.subject.lcsh Computer algorithms
dc.subject.lcsh Electronic information resource searching
dc.title From Tapestry to SVD: A Survey of the Algorithms That Power Recommender Systems en
dc.type Thesis (B.A.) en

Files in this item

Files Description Size Format
2009HuttnerJ.pdf Thesis 429.2Kb PDF
2009HuttnerJ_release.pdf ** Archive Staff Only ** 79.22Kb PDF

This item appears in the following Collection(s)

Show simple item record Except where otherwise noted, this item's license is described as


Advanced Search


My Account