Solving the Sparsity Problem: Collaborative Filtering via Indirect Similarities
2008-12-10
Loading...
View/Download File
Persistent link to this item
Statistics
View StatisticsJournal Title
Journal ISSN
Volume Title
Title
Solving the Sparsity Problem: Collaborative Filtering via Indirect Similarities
Published Date
2008-12-10
Publisher
Type
Report
Abstract
Collaborative filtering is an important technique of information filtering, commonly used to predict the interest of a user for a new item. In collaborative filtering systems, this prediction is made based on user-item preference data involving similar users or items. When the data is sparse, however, direct similarity measures between users or items provide little information that can be used for the prediction. In this paper, we present a new collaborative filtering approach that computes global similarities between pairs of items and users, as the equilibrium point of a system relating user similarities to item similarities. We show how this approach extends the classical techniques based on direct similarity, and illustrate, by testing on various datasets, its advantages over such techniques.
Keywords
Description
Related to
Replaces
License
Series/Report Number
Technical Report; 08-044
Funding information
Isbn identifier
Doi identifier
Previously Published Citation
Other identifiers
Suggested citation
Desrosiers, Chrsistian; Karypis, George. (2008). Solving the Sparsity Problem: Collaborative Filtering via Indirect Similarities. Retrieved from the University Digital Conservancy, https://hdl.handle.net/11299/215787.
Content distributed via the University Digital Conservancy may be subject to additional license and use restrictions applied by the depositor. By using these files, users agree to the Terms of Use. Materials in the UDC may contain content that is disturbing and/or harmful. For more information, please see our statement on harmful content in digital repositories.