Collaborative Filtering with Generalized Laplacian Constraint via Overlapping Decomposition
نویسندگان
چکیده
Real-world data are seldom unstructured, yet traditional Matrix Factorization (MF) models, as one of the most powerful collaborative filtering approaches, generally rely on this assumption to recover the low-rank structures for recommendation. However, few of them are able to explicitly consider structured constraint with the underlying low-rank assumption to model complex user interests. To solve this problem, we propose a unified MF framework with generalized Laplacian constraint for collaborative filtering. We investigate the connection between the recently proposed Laplacian constraint and the classical normalized cut problem, and make it possible to extend the original non-overlapping prior, to capture the overlapping case via learning the decomposed multi-facet graphs. Experiments on realworld datasets demonstrate the effectiveness of the proposed method.
منابع مشابه
Effect of Rating Time for Cold Start Problem in Collaborative Filtering
Cold start is one of the main challenges in recommender systems. Solving sparsechallenge of cold start users is hard. More cold start users and items are new. Sine many general methods for recommender systems has over fittingon cold start users and items, so recommendation to new users and items is important and hard duty. In this work to overcome sparse problem, we present a new method for rec...
متن کاملApplying SVD on Generalized Item-based Filtering
In this paper we examine the use of a matrix factorization technique called Singular Value Decomposition (SVD) along with demographic information in Item-Based Collaborative Filtering. After a brief introduction to SVD and to some of its previous applications in Recommender Systems, we proceed with the presentation of two distinct but related algorithms. The first algorithm uses SVD in order to...
متن کاملModeling Collaborative Similarity with the Signed Resistance Distance Kernel
We extend the resistance distance kernel to the domain of signed dissimilarity values, and show how it can be applied to collaborative rating prediction. The resistance distance is a graph kernel inspired by electrical network models where edges of a graph are interpreted as electrical resistances. We model the similarity between users of a large collaborative rating database using this signed ...
متن کاملAuxiliary Domain Selection in Cross-Domain Collaborative Filtering
The problem of data sparsity largely limits the accuracy of recommender systems in collaborative filtering model. To alleviate the problem, cross-domain collaborative filtering was proposed by harnessing the information from the auxiliary domains. Previous works mainly focused on improving the model of utilizing the auxiliary information yet little on the selection of auxiliary domains, althoug...
متن کاملA generalized model via random walks for information filtering
There could exist a simple general mechanism lurking beneath collaborative filtering and interdisciplinary physics approaches which have been successfully applied to online E-commerce platforms. Motivated by this idea, we propose a generalized model employing the dynamics of the random walk in the bipartite networks. Taking into account the degree information, the proposed generalized model cou...
متن کامل