Many of the world's recommender systems are based on collaborative filtering techniques.
The basic idea of these techniques is that people who share similar preferences in the past tend to have similar choices in the future.
But Collaborative Filtering techniques have a sparsity problem in that the number of items rated by users is insignificant to the total number of items.
We aim to reduce the sparsity problem and improve the quality of recommendations
We are using Yelp Dataset in this scenario to showcase our methods against methods like matrix factorization as Yelp dataset is very sparse and traditional methods like matrix factorization involves lots of computation when it comes to sparse dataset
The current techniques in recommender systems use collaborative filtering, content based filtering or hybrid methods on ratings explicitly given by the users to each item. But such systems are not robust to problems due to sparsity in the ratings data.
It has been shown that reviews written by users can reveal some information on the customers’ buying and rating behavior, and also reviews written for items may contain information on their features and properties.
So we believe that a large amount of information exists in reviews written by users. This source of information has been ignored by most of the current recommender systems while it can potentially alleviate the sparsity problem and improve the quality of recommendations.
In Jan 2017, Lei et. al. have proposed a deep model (DeepCoNN) to learn item properties and user behaviors jointly from review text. But we noticed that they have completely neglected other user/item profile specific attribute information.
Consider the Yelp Dataset
While there are a lot of attributes in the dataset, Most collaborative filtering techniques consider only the user ratings
But there are attributes that are more relevant in restaurant recommender systems (for example, is time of ordering important, is user sequence of ordering important, is positivity or negativity of user comments important, in what ways can location of the restaurant be used to improve the recommendation quality etc.)?
We capture the contextual information in the review text as well as the restaurant attributes in order to improve the quality of recommmendations
# | Baseline(DeepCoNN) | DeepCoNN+attr | RecCoNN |
---|---|---|---|
Arizona | 0.9374 | 0.9917 | 0.9502 |
North Carolina | 0.8495 | 0.8706 | 0.8475 |
Pennsylvania | 0.8252 | 0.8263 | 0.8232 |
# | Baseline(DeepCoNN) | DeepCoNN+attr | RecCoNN |
---|---|---|---|
Arizona | 1.1831 | 1.204 | 1.181 |
North Carolina | 1.0872 | 1.12 | 1.0929 |
Pennsylvania | 1.0625 | 1.0578 | 1.0502 |
Traditional recommendation methods (e.g., matrix factorization) mainly aim to learn an effective prediction function for characterizing user-item interaction records (e.g., user-item rating matrix). With the rapid development of web services, various kinds of auxiliary data (side information) become available in recommender systems. Although auxiliary data is likely to contain useful information for recommendation, it is difficult to model and utilize these heterogeneous and complex information in recommender systems. Furthermore, it is more challenging to develop a relatively general approach to model these varying data in different systems or platforms.
As a promising direction, heterogeneous information network (HIN), consisting of multiple types of nodes and links, has been proposed as a powerful information modeling method. Due to its flexibility in modeling data heterogeneity, HIN has been adopted in recommender systems to characterize rich auxiliary data. During literature review, we observed multiple movie recommendation papers characterized by HINs. We can see that the HIN contains multiple types of entities connected by different types of relations. Under the HIN based representation, the recommendation problem can be considered as a similarity search task over the HIN.
HIN is a more general model which contains more comprehensive relations among objects and much richer semantic information. It is challenging to develop effective methods for HIN based recommendation in both extraction and exploitation of the information from HINs. Most of HIN based recommendation methods rely on path based similarity, which cannot fully mine latent structure features of users and items.
Due to lack of resources, we have restricted our work to the basics of network embedding. We studied the structure and topology of the Yelp social network. We found evidence of a small world network. A small subset of users act as hubs and the main connected component has a diameter of 6. Lastly, we have generated network graph and did some visualizations.
# | Number of Nodes | Number of Edges | Average Degree | Diameter |
---|---|---|---|---|
Top 10 Users | 5859 | 11057 | 3.7744 | 4 |
Top 100 Users | 10928 | 39759 | 7.2765 | 5 |
Top 1000 Users | 17104 | 94994 | 11.1078 | 6 |
All Users Graph | 30255 | 151516 | 10.0159 | Not available Disconneted Components |
To embed HINs, we would like to use a random walk strategy to generate meaningful node sequences for network embedding. We characterize nodes from HINs with low-dimensional vectors, i.e., embeddings. Instead of relying on explicit path connection, we would like to encode useful information from HINs with latent vectors. The learned node embeddings are first transformed by a set of fusion functions and once we obtain the representations for user u and item i, we would like to integrate them to our RecCoNN model.