Local learning of item dissimilarity using content and link structure

Authors:
Abir De;Maunendra Sankar Desarkar;Niloy Ganguly;Pabitra Mitra
Affiliations:
Indian Institute of Technology Kharagpur, Kharagpur, India;Indian Institute of Technology Kharagpur, Kharagpur, India;Indian Institute of Technology Kharagpur, Kharagpur, India;Indian Institute of Technology Kharagpur, Kharagpur, India
Venue:
Proceedings of the sixth ACM conference on Recommender systems
Year:
2012

Citing 4
Cited 1

The link prediction problem for social networks

CIKM '03 Proceedings of the twelfth international conference on Information and knowledge management
Feature weighting in content based recommendation system using social network analysis

Proceedings of the 17th international conference on World Wide Web
Choosing attribute weights for item dissimilarity using clikstream data with an application to a product catalog map

Proceedings of the 2008 ACM conference on Recommender systems
Supervised random walks: predicting and recommending links in social networks

Proceedings of the fourth ACM international conference on Web search and data mining

Comparing context-aware recommender systems in terms of accuracy and diversity

User Modeling and User-Adapted Interaction

Quantified Score

Hi-index	0.00

Visualization

Abstract

In the Recommendation Problem, it is often important to find a set of items similar to a particular item or a group of items. This problem of finding similar items for the recommendation task may also be viewed as a link prediction problem in a network, where the items can be treated as the nodes. The strength of the edge connecting two items represents the similarity between the items. In this context, a central challenge is to suitably define an appropriate dissimilarity function between the items. For content based recommender systems, the dissimilarity function should take into account the individual attributes of the items. The same attribute may have different importances in different parts of the underlying network. We focus on the problem of learning a suitable dissimilarity function between items and address it by formulating it as a constrained optimization problem which captures the local weightages of the attributes in different regions of the graph. The constraints are imposed in such a way that the non-connected nodes show higher value of dissimilarity than the connected nodes. The local tuning of the weights learns the optimal value of weights in various parts of the network: from the portions having rich graph information to the portions having only content information. Detailed experimentation shows the superiority of the proposed algorithm over the Adamic Adar metric as well as logistic regression methodology.