ROBIN: A novel personal recommendation model based on information propagation

https://doi.org/10.1016/j.eswa.2013.03.039Get rights and content

Highlights

  • In this paper, we propose a novel personal recommendation model, called ROBIN.

  • ROBIN employs Information Propagation and the EM method to implement the recommendation task.

  • Experiment results show that ROBIN achieves good performance.

Abstract

With the rapid development of the Internet technology, we have now entered the era of information overloading. Recommendation System technology can recommend web resources or information to people based on his/her personal preference, and has gotten a great deal of attention and development in recent years. In this paper, by combining collaborative filtering technology and information propagation principle, we proposed ROBIN, a novel recommendation model. The ROBIN model achieves a good recommendation effect by propagating the relationship information between users and resources. Based on the ROBIN model, we designed and implemented tag recommendation algorithm named ROBIN-T. For evaluating our proposed method, we have conducted tag recommendation experiments on three real datasets and the results show that the ROBIN-T algorithm achieves good performance when compared with classical approaches.

Introduction

Because of the rapid development of the Internet technology, there are now so many information in the network that one person cannot look for needed information only depend on his/her own capacity. Because Recommendation System (Mahmood and Ricci, 2009, Resnick and Varian, 1997, Ricci et al., 2011) can recommend web resources or information to people automatically, it help people greatly reducing the cost of searching information. In recent years, recommendation system technology has gotten a great deal of attention and development, and has been used in more and more e-commerce websites.

Existing recommendation systems can be divided into three categories. The first one is non-personal recommendation system. This kind of recommendation system creates the same recommendation for every user with various kinds of ranking lists. Mostly it only uses some simple statistics methods. The second is semi-personal recommendation system. It recommends resources to user based on the resource he/she just look through. Techniques based on association rule mining are often used in such recommendation system. The last one is personal recommendation system. It automatic forms the behavior template for users by analyzing their history behaviors. personal recommendation system have been widely used in Web 2.0 applications such as Bibsonomy (http://bibsonomy.org) (sharing websites and publications), Flickr (http://www.flickr.com/) (sharing photos), Del.icio.us (http://delicious.com/) (sharing bookmarks), Movielens (http://movielens.umn.edu/) (sharing movies), etc.

The general procedure of personal recommendation consists of: (1) record user’s behaviors; generate personal behavior template by user’s history behaviors; (2) maintain behavior template; (3) recommend information to users based on their behavior template. Many technologies are proposed to solve the problem of personal recommendation (Resnick and Varian, 1997, Ricci et al., 2011).

In this paper, we propose a novel personal recommendation model named ROBIN, which is based on the information propagation. In the ROBIN model, a recommendation system is transformed to a bipartite graph, in which nodes of the graph represent users and resources respectively, and edge between a user and a resource represent the user’s potential action on the resource. A potential action is an action, such as tagging or browsing the resource, with a possibility which indicates that the opportunity that the action may be performed by a user on a resource.

The core problem of this paper is how to get a ROBIN model, especially the probability parameters, from the actual action network. For dealing with the problem, we propose an effectively EM algorithm to evaluate the probability parameters. In the algorithm, potential actions are propagated in the bipartite graph circularly. When the network becomes stable, the propagation processing stop, and then we get the ROBIN model.

When we know the potential action of a user from the ROBIN model, we can use it to predict the user’s behavior and get a good recommend result. To evaluate the effectiveness of the ROBIN model, we conduct experiments on three real datasets, which originate from Bibsonomy, Movielens, and Del.icio.us respectively. These experiments aim to personal tag recommendation task. Experimental results show that our method achieves better performance when compared with classical approaches.

The rest of the paper is organized as follows. Section 2 discusses related work. Section 3 presents the preliminaries of our work. In Section 4, we present the ROBIN model. In Section 5, we systematically develop an algorithm based on information propagation to obtain the probability parameters of the ROBIN model. Section 6 presents the experimental evaluation of the ROBIN model in tag recommendation task on three real datasets. Section 7 concludes this study and points out future works.

Section snippets

Related work

Rule-based recommendation systems (Lin and Alvarez, 2004, Smyth et al., 2005) generate user’s behavior rules through user’s history behaviors by using association rule mining technology (Agrawal et al., 1993). It’s simple and understandable, but its effect depends on the quality and quantity of the rules, which are hard to control.

Content-based recommendation systems (Balabanovic and Shoham, 1997, Golder and Huberman, 2006, Symeonidis, 2008) generate recommendation based on the similarity

Preliminaries

In this section, we will introduce some basic concepts including the potential action assumption and the formalization of recommendation systems.

The robin model

In this section, we will introduce our Personal Recommendation Model named ROBIN, which is based on information propagation. A ROBIN model is an information network formed by users, resources and the potential actions between users and resources. Potential actions can be propagated in the network. Fig. 2 shows a simple example of a ROBIN model. In the rest of this section, we first define the feature vector space and entity model in a ROBIN model. Then, we give a system loss function to measure

The algorithm based on information propagation

In this section we describe our information propagation algorithm to obtain a ROBIN model with best parameter setting that minimizes the system loss function.

Experiments

We now study the performance of ROBIN model and compare it with classical algorithms in the area of personal tag recommendation.

Conclusion and future work

Recommendation system has been extensively used in World Wide Web. Many methods or models have been proposed to improve the effectiveness of personal recommendation. In this paper we proposed a novel personal recommendation model named ROBIN, which is based on information propagation. The ROBIN model is a bipartite graph, in which nodes represent users and resources respectively, and edges represent the set of potential actions. A ROBIN model has three properties: (1) similar users should act

Acknowledgements

This work was partially supported by National Natural Science Foundation of China (Grant No. 61170091) and National High Technology Research and Development Program of China (863 Program) (Grant No. 2009AA01Z136).

References (30)

  • S. Brin et al.

    The anatomy of a large-scale hypertextual web search engine

    Computer Networks and ISDN Systems

    (1998)
  • Agrawal, R., Imielinski, T., & Swami, A. (1993). Mining association rules between sets of items in large databases. In...
  • M. Balabanovic et al.

    Fab: Content-based, collaborative recommendation

    Communications of the ACM

    (1997)
  • Breese, J. S., Heckerman, D., & Kadie, C. (1998). Empirical analysis of predictive algorithms for collaborative...
  • Delgado, J., & Ishii, N. (1999). Memory-based weighted-majority prediction for recommender systems. In Proceedings of...
  • X. Fan et al.

    On graph-based name disambiguation

    Journal of Data and Information Quality

    (2011)
  • B.J. Frey et al.

    Clustering by passing messages between data points

    Science

    (2007)
  • Getoor, L., & Sahami, M. (1999). Using probabilistic relational models for collaborative filtering. In Proceedings...
  • S. Golder et al.

    The structure of collaborative tagging systems

    Journal of Information Science

    (2006)
  • Hofmann, T. (2003). Collaborative filtering via gaussian probabilistic latent semantic analysis. In Proceedings of the...
  • J.M. Kleinberg

    Authoritative sources in a hyperlinked environment

    Journal of the ACM

    (1999)
  • I. Konstas et al.

    On social networks and collaborative recommendation

    SIGIR

    (2009)
  • Y. Koren et al.

    Matrix factorization techniques for recommender systems

    Computer

    (2009)
  • W. Lin et al.

    Efficient adaptive-support association rule mining for recommender systems

    Data Mining and Knowledge Discovery Journal

    (2004)
  • Lu, Y. T., Yu, S. I., Chang, T. C., & Hsu, J. (2009). A content-based method to enhance tag recommendation. In...
  • Cited by (0)

    View full text