Exploring graph-based global similarity estimates for quality recommendations Online publication date: Sat, 24-May-2014
by Deepa Anand; Kamal K. Bharadwaj
International Journal of Computational Science and Engineering (IJCSE), Vol. 9, No. 3, 2014
Abstract: Data sparsity or the insufficiency of past user preferences in predicting future user needs continues to be a major challenge for RS engines. We propose a solution to the sparsity problem by exploring similarity measures that capture the global patterns of commonality between users or items by leveraging on indirect ways of connecting users (items) through a user (item) graph. Entities (users or items) sharing common features are connected to each other by edges weighted by their proximity or distance. Graph-based techniques, for estimating transitive similarity between entities not directly connected, are exploited to bring the entities closer thus facilitating collaboration. Furthermore, we also propose a combined user-item graph approach for exploiting the similarity between users preferring similar items (and vice versa). In this work, we have suggested alternatives to the already existing global similarity assessment and we aim to investigate the appropriateness of the proposed techniques under differing data features.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Computational Science and Engineering (IJCSE):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook