Attribute-Aware Recommender System Based on Collaborative Filtering: Survey and Classification

Attribute-aware CF models aim at rating prediction given not only the historical rating given by users to items but also the information associated with users (e.g., age), items (e.g., price), and ratings (e.g., rating time). This paper surveys work in the past decade to develop attribute-aware CF systems and finds that they can be classified into four different categories mathematically. We provide readers not only with a high-level mathematical interpretation of the existing work in this area but also with mathematical insight into each category of models. Finally, we provide in-depth experiment results comparing the effectiveness of the major models in each category.

1. Introduction

Collaborative filtering is arguably the most effective method for building a recommender system. It assumes that a user's preferences regarding items can be inferred collaboratively from other users' preferences. In practice, users' past records regarding items, such as explicit ratings or implicit feedback (e.g., binary access records), are typically used to infer similarity of taste among users for the purposes of recommendation. In the past decade, matrix factorization (MF) has become a widely adopted method of collaborative filtering. Specifically, MF learns a latent representation vector for a user and an item and computes their inner products as the predicted rating. The learned latent user/item factors are supposed to embed specific information about the user/item. That is, two users with similar latent representations will have similar tastes regarding items with similar latent vectors.

In the big data era, classical MF using only ratings suffers a serious drawback, as such a method is unable to exploit other accessible information such as the attributes of users/items/ratings. For instance, data could contain the location and time that a user rated an item. These rating-relevant attributes, or contexts, could be useful in determining the scale of user liking for an item. The side information or attributes relevant to users or items (e.g., the demographic information of users or the item genre) can also reveal useful information. Such side information is particularly useful for situations where the ratings of a user or an item are sparse, which is known as the cold-start problem for recommender systems. Therefore, researchers have formulated attribute-aware recommender systems (see Figure 1) aiming at leveraging not only the rating information but also the attributes associated with ratings/users/items to improve the quality of recommendation.

FIGURE 1

Figure 1. Interpretation of inputs, including ratings and attributes, in attribute-aware collaborative filtering-based recommender systems.

Researchers have proposed different methods to extend existing collaborative filtering models in recent years, such as factorization machines, probabilistic graphical models, kernel tricks, and models based on deep neural networks. We notice that those papers can also be categorized based on the type of attributes incorporated into the models. A class of recommender systems considers relevant side information, such as age, gender, the occupation of users, or the expiration and price of items when predicting ratings (e.g., Adams et al., 2010; Porteous et al., 2010; Fang and Si, 2011; Ning and Karypis, 2012; Zhou et al., 2012; Park et al., 2013; Xu et al., 2013; Kim and Choi, 2014; Lu et al., 2016; Zhao et al., 2016; Feipeng Zhao, 2017; Guo, 2017; Yu et al., 2017; Zhou T. et al., 2017). On the other hand, context-aware recommender systems (e.g., Shin et al., 2009; Karatzoglou et al., 2010; Li et al., 2010b; Baltrunas et al., 2011; Rendle et al., 2011; Hidasi and Tikk, 2012, 2016; Shi et al., 2012a, 2014a; Liu and Aberer, 2013; Chen et al., 2014; Nguyen et al., 2014; Hidasi, 2015; Liu and Wu, 2015) enhance themselves by considering the attributes appended to each rating (e.g., rating time, rating location). Other terms may be used to indicate attributes interchangeably such as metadata (Kula, 2015), features (Chen et al., 2012), taxonomy (Koenigstein et al., 2011), entities (Yu et al., 2014), demographic data (Safoury and Salah, 2013), categories (Chen et al., 2016), contexture information (Weng et al., 2009), etc. The above setups all share the same mathematical representation; thus, technically, we do not distinguish them in this paper. That is, we regard whichever information is associated with a user/item/rating as user/item/rating attributes, regardless of its nature. Therefore, a CF model that takes advantage of ratings as well as associated attributes is called an attribute-aware recommender in this paper.

Note that the attribute-aware recommender systems discussed in this paper are not equivalent to hybrid recommender systems. The former treat additional information as attributes, while the latter emphasize the combination of collaborative filtering-based methods and content-based methods. To be more precise, this review covers only works that assume unstructured and independent attributes, either in binary or numerical format, for each user, item, or rating. The reviewed models do not have prior knowledge of the dependency between attributes, such as the adjacent terms in a document or user relationships in a social network.

This review covers more than one hundred papers in this area in the past decade. We find that the majority of the works propose an extension of matrix factorization to incorporate attribute information in collaborative filtering. The main contribution of this paper is to not only provide a comprehensive review, but also provide a means to classify these works into four categories: (I) discriminative matrix factorization, (II) generative matrix factorization, (III) generalized factorization, and (IV) heterogeneous graphs. For each category, we provide the probabilistic interpretation of the models. The major distinction of these four categories lies in their representation of the interactions between users, items, and attributes. Discriminative matrix factorization models extend the traditional MF by treating the attributes as prior knowledge to learn the latent representation of users or items. Generative matrix factorization further considers the distributions of attributes and learns such, together with the rating distributions. Generalized factorization models view the user/item identity simply as a kind of attribute, and various models have been designed for determining the low-dimensional representation vectors for rating prediction. The last category of models proposes to represent the users, items, and attributes using a heterogeneous graph, where a recommendation task can be cast into a link-prediction task on the heterogeneous graph. In the following sections, we will elaborate on general mathematical explanations of the four types of model designs and discuss the similarities/differences among the models.

There have been four prior reviews (Adomavicius and Tuzhilin, 2011; Verbert et al., 2012; Bobadilla et al., 2013; Shi et al., 2014b) introducing attribute-aware recommender systems. We claim three major differences between our work and the existing papers. First, previous review papers mainly focused on grouping different types of attributes and discussing the distinctions of memory-based collaborative filtering and model-based collaborative filtering. In contrast, we are the first that have aimed at classifying the existing works based on the methodology proposed instead of the type of data used. We further provide mathematical connections for different types of models so that the readers can better understand the spirit of the design of different models as well as their technical differences. Second, we are the first to provide thorough experiment results (seven different models on eight benchmark datasets) to compare different types of attribute-award recommendation systems. Note that Bobadilla et al. (2013) is the only previous review work with experimental results. However, for that study, experiments were performed to compare different similarity measures in collaborative filtering algorithms instead of directly verifying the effectiveness of different attribute-aware recommender systems. Finally, we cover the latest work on attribute-aware recommender systems. We note that the existing review papers do not include forty papers after 2015. In recent years, several deep neural network-based solutions (Zhang et al., 2017) have achieved state-of-the-art performance for this task.

Table 1 shows comparisons between our work and previous reviews.

TABLE 1

Table 1. Differences between previous works and our work.

We will introduce the basic concepts behind recommender systems in section 2, followed by formal analyses of attribute-aware recommender systems in sections 3 and 4. A series of experiments detailed in section 5 were conducted to compare the accuracy and parameter sensitivity of six widely adopted models. Finally, section 6 concludes this review and identifies work to be done in the future.

2. Preliminaries

2.1. Problem Definition of Recommender Systems

Recommender systems act as skilled agents to assist users to conquer information overload while making selection decisions over items by providing customized recommendations. Users and items are general phrases denoting, respectively, entities actively browsing and making choices and entities being selected, such as goods and services.

Formally, recommender systems leverage one or more of the following three information sources to discover user preferences and generate recommendations: user-item interactions, side information, and contexts. User-item interactions, or ratings, are collected explicitly by prompting users to provide numerical feedback on items and are acquired implicitly by tracking user behaviors such as clicks, browsing time, or purchase history. The data are commonly represented as a matrix that encodes the preferences of users and is naturally sparse, since users normally interact with a limited fraction of items. Side information is rich information attached to an individual user or item that depicts user characteristics such as education and job or item properties such as description and product categories. Side information can take diverse structures with rich meaning, ranging over numerical status, texts, and images to videos, locations, and networks. On the other hand, context refers to all the information collected when a user interacts with an item, such as timestamps, locations, or textual reviews. This contextual information usually serves as an additional information source appended to the user-item interaction matrix.

The goal of recommender systems is to disclose unknown user preferences over items that users never interact with and recommend the most preferred items to them. In practice, recommender systems learn to generate recommendations based on three types of approaches: pointwise, pairwise, and listwise. The pointwise approach is the most common approach and demands recommendation systems to provide accurate numerical predictions on observed ratings. Items that a user never interacts with are then sorted by their rating predictions, and a number of items with the highest ratings are recommended to the user. On the other hand, a pairwise approach seeks to preserve the ordering of any pair of items based on ratings, while in the listwise approach, recommender systems aim to preserve the relative order of all rated items as a list for each user. The pairwise approach and listwise approach are together considered item rankings that only require recommender systems to output the ordering of items but not ratings for individual items.

In most of the works covered in this paper, the task of attribute-aware recommendation is defined as predicting unknown ratings, that is: given N_u users, N_i items, a user-item rating matrix $\text{R}\in {ℝ}^{N_u\times N_i}$ with only a small portion N_r ratings observed (i.e., there are a total of N_u × N_i − N_r missing ratings), side information of users $\text{X}\in {ℝ}^{K_X\times N_u}$ (assuming each user has K_X attributes), side information of items $\text{Y}\in {ℝ}^{K_Y\times N_i}$, and contexts $\text{Z}\in {ℝ}^{K_Z\times N_r}$, the goal is to build a model that is capable of predicting each of the unknown ratings in R.

Then, given any specific user, a recommender system can make recommendations based on the predicted ratings. Normally, items with higher ratings are recommended first. Note that the dimension K_X, K_Y of side information attribute matrix X, Y might be zero, denoting that there is no side information about users or items. Likewise, if there is no contextual information about user-item interactions, K_Z will be zero.

The core techniques or algorithms for realizing recommender systems are generally classified into three categories: content-based filtering, collaborative filtering, and hybrid filtering (Bobadilla et al., 2013; Shi et al., 2014b; Isinkaye et al., 2015). Content-based filtering generates recommendations based on properties of items and user-item interactions. Content-based techniques exploit domain knowledge and seek to transform item properties in raw attribute structures such as texts, images, or locations into numerical item profiles. Each item is represented as a vector, and the matrix of side information of items Y is constructed. A representation of each user is then created by aggregating profiles of items that this user interacted with, and a similarity measure is leveraged to retrieve a number of the most similar items as recommendations. Note that content-based filtering does not require information from any other user to make recommendations. Collaborative filtering strives to identify a group of users with similar preferences based on past user-item interactions and recommends items preferred by these users. Since discovering users with common preferences is generally based on user-item ratings R, collaborative filtering becomes the first choice when item properties are inadequate in describing their content, such as movies or songs. Hybrid filtering is the extension or combination of content-based and collaborative filtering. Examples of this are building an ensemble of the two techniques, using the item rating history of collaborative filtering as part of the item profiles for content-based filtering or extending collaborative filtering to incorporate user characteristics X or item properties Y. This review focuses on attribute-aware recommender systems that shed light not only on user-item interactions R but also on the side information of users or items X, Y and contexts Z, which is a subset of hybrid filtering.

2.2. Collaborative Filtering and Matrix Factorization

Collaborative filtering (CF) has become the prevailing technique for realizing recommender systems in recent years (Adomavicius and Tuzhilin, 2005, 2011; Shi et al., 2014b; Isinkaye et al., 2015). It assumes that the preferences users exhibit for items they have interacted with can be generalized and used to infer their preferences regarding items they have never interacted with by leveraging the records of other users with similar preferences. This section briefly introduces conventional CF techniques, which assume the availability of only user-item interactions or the rating matrix R. In practice, they are commonly categorized into memory-based CF and model-based CF (Adomavicius and Tuzhilin, 2005; Shi et al., 2014b; Isinkaye et al., 2015).

Memory-based CF directly exploits rows or columns in the rating matrix R as representations of users or items and identifies a group of similar users or items using a pre-defined similarity measure. Commonly used similarity metrics include the Pearson correlation, the Jaccard similarity coefficient, the cosine similarity, or their variants. Memory-based CF techniques can be divided into user-based and item-based approaches, which identify either a group of similar users or similar items, respectively. For user-based approaches, K nearest neighbors—or the K most similar users—are extracted, and their preferences or ratings regarding a target item are aggregated into a rating prediction using similarities between users as weights. The rating prediction for user u on item i, ${\widehat{r}}_{ui}$, can be formulated as:

$\begin{array}{ll}{\widehat{r}}_{ui}=\frac{1}{Z}{\displaystyle \sum _{v\in U_u}}\text{sim}(u,v)r_{vi},& (1)\end{array}$

where function sim(·) is a similarity measure, Z is the normalization constant, and U_u is the set of similar users to user u (Shi et al., 2014b). Rating predictions of item-based approaches can be formulated in a similar way. The calculated pairwise similarities between users or items act as the memory of the recommender system since they can be saved for generating later recommendations.

Model-based CF, on the other hand, takes the rating matrix R to train a predictive model with a set of parameters θ to make recommendations (Adomavicius and Tuzhilin, 2005; Shi et al., 2014b). Predictive models can be formulated as a function that outputs ratings for rating predictions or numerical preference scores for item ranking given a user-item pair (u, i):

$\begin{array}{ll}{\widehat{r}}_{ui}=f_{\theta }(u,i).& (2)\end{array}$

Model-based CF then ranks and selects the K items with the highest ratings or scores r_ui as recommendations. Common core algorithms for model-based CF involve Bayesian classifiers, clustering techniques, graph-based approaches, genetic algorithms, and dimension-reduction methods such as Singular Value Decomposition (SVD) (Adomavicius and Tuzhilin, 2005, 2011; Bobadilla et al., 2013; Shi et al., 2014b; Isinkaye et al., 2015). Over the last decade, a class of latent factor models, called matrix factorization, has been popularized and is commonly adopted as the basis of advanced techniques because of its success in the development of algorithms for the Netflix competition (Koren et al., 2009; Koren and Bell, 2011). In general, latent factor models aim to learn a low-dimensional representation, or latent factor, for each entity and combine the latent factors of different entities using specific methods such as inner product, bilinear map, or neural networks to make predictions. As one of these latent factor models, matrix factorization for recommender systems characterizes each user and item by a low-dimensional vector and predicts ratings based on inner product.

Matrix factorization (MF) (Paterek, 2007; Koren et al., 2009; Koren and Bell, 2011; Shi et al., 2014b), in the basic form, represents each user u as a parameter vector ${\text{w}}_u\in {ℝ}^K$ and each item i as ${\text{h}}_i\in {ℝ}^K$, where K is the dimension of latent factors. The prediction of user u's rating or preference regarding item i, denoted as ${\widehat{r}}_{ui}$, can be computed using the inner product:

$\begin{array}{ll}{\widehat{r}}_{ui}=w_u^{\top }{h}_i,& (3)\end{array}$

which captures the interaction between them. MF seeks to generate rating predictions that are as close as possible to those recorded ratings. In matrix form, it can be written as finding W, H such that R ≈ W^⊤H where $\text{R}\in {ℝ}^{N_u\times N_i}$. MF is essentially learning a low-rank approximation of the rating matrix, since the dimension of representations K is usually much smaller than the number of users N_u and items N_i. To learn the latent factors of users and items, the system tries to find W, H that minimizes the regularized square error on the set of entries of known ratings in R [denoted as δ(R)]:

$\begin{array}{l}{W}^{*},H^{*}={\displaystyle \underset{W,H}{argmin}}{\displaystyle \sum _{(u,i)\in \delta (R)}}\frac{1}{2}{\left(r_{ui}-w_u^{\top }{h}_i\right)}^2+\frac{{\lambda }_W}{2}{\displaystyle \sum _{u=1}^{N_u}}||w_u{||}_2^2\\ +\frac{{\lambda }_H}{2}{\displaystyle \sum _{i=1}^{N_i}}||h_i{||}_2^2,& (4)\end{array}$

where λ_W and λ_H are regularization parameters. MF tends to cluster users or items with similar rating configurations into groups in the latent factor space, which implies that similar users or items will be close to each other. Furthermore, MF assumes that the rank of rating matrix R or the dimension of the vector space generated by the rating configuration of users is far smaller than the number of users N_u. This implies that each user's rating configuration can be obtained by a linear combination of ratings from a group of other users since they are all generated by K principal vectors. Thus, MF is in the spirit of collaborative filtering, which is to infer a user's unknown ratings by the ratings of several other users.

Biased matrix factorization (Paterek, 2007; Koren et al., 2009; Koren and Bell, 2011), an improvement of MF, models the characteristics of each user and each item and the global tendency that are independent of user-item interactions. The obvious drawback of MF is that only user-item interactions ${\text{w}}_u^{\top }{\text{h}}_i$ are considered in rating predictions. However, ratings usually contain universal shifts or exhibit systematic tendencies with respect to users and items. For instance, there might be a group of users inclined to give significantly higher ratings than others or a group of items widely considered to be of high-quality and that receive higher ratings. Besides, it is common that all ratings are non-negative, which implies that the overall average might not be close to zero and causes a difficulty for training small-value-initialized representations. Due to the issues mentioned above, biased MF augments MF rating predictions with linear biases that account for user-related, item-related, and global effects. The rating prediction is extended as follows:

$\begin{array}{ll}{\widehat{r}}_{ui}=\mu +c_u+d_i+w_u^{\top }{h}_i,& (5)\end{array}$

where μ, c_i, d_j are global bias, bias of user i, and bias of item j, respectively. Biased MF then finds the optimal W, H, c, d, μ that minimizes the regularized square error as follows:

$\begin{array}{l}{W}^{*},H^{*},c^{*},d^{*},{\mu }^{*}\\ =\underset{W,H,c,d,\mu }{\text{argmin}}{\displaystyle \sum _{(u,i)\in \delta (R)}{(r_{ui}-\mu -c_u-d_i-w_u^{\top }{h}_i)}^2+\text{λ}(||W{||}_F^2}\\ +||H{||}_F^2+||c{||}_2^2+||d{||}_2^2),& (6)\end{array}$

where $||\text{W}{||}_F^2=\sum _{u=1}^{N_u}||{\text{w}}_u{||}_2^2$ denotes the squared Frobenius norm. The regularization parameter λ is tuned by cross-validation.

Probabilistic matrix factorization (PMF, Figure 2 and Biased PMF, Figure 3) (Salakhutdinov and Mnih, 2007, 2008) is a probabilistic linear model with observed Gaussian noise and can be viewed as a probabilistic extension of MF. PMF adopts the assumption that users and items are independent and represents each user or each item with a zero-mean spherical multivariate Gaussian distribution as follows:

$\begin{array}{l}p\left(W\mid {\sigma }_W^2\right)={\displaystyle \prod _{u=1}^{N_u}{N}\left(w_u\mid 0,{\sigma }_W^{2}I\right)},p\left(H\mid {\sigma }_H^2\right)\\ ={\displaystyle \prod _{i=1}^{N_i}}{N}\left(h_i\mid 0,{\sigma }_H^{2}I\right),& (7)\end{array}$

where ${\sigma }_W^2$ and ${\sigma }_H^2$ are observed user-specific and item-specific noise. PMF then formulates the conditional probability over the observed ratings as

$\begin{array}{ll}p(R\mid W,H,{\sigma }^2)={\displaystyle \prod _{(i,j)\in \delta (R)}}{N}\left(r_{ui}\mid w_u^{\top }{h}_i,{\sigma }_R^2\right),& (8)\end{array}$

where δ(R) is the set of known ratings and ${N}(x\mid \mu ,{\sigma }^2)$ denotes the Gaussian distribution with mean μ and variance σ². Learning in PMF is conducted by maximum a posteriori (MAP) estimation, which is equivalent to maximizing the log of the posterior distribution of W, H:

$\begin{array}{l}\log p\left(W,H\mid R,{\sigma }_R^2,{\sigma }_W^2,{\sigma }_H^2\right)=\log p\left(R\mid W,H,{\sigma }_R^2\right)\\ +\log p\left(W\mid {\sigma }_W^2\right)+\log p\left(H\mid {\sigma }_H^2\right)+C\\ =-\frac{1}{2{\sigma }_R^2}{\displaystyle \sum _{(u,i)\in \delta (R)}{\left(r_{ui}-w_u^{\top }{h}_i\right)}^2}-\frac{1}{2{\sigma }_W^2}{\displaystyle \sum _{u=1}^{N_u}{w}_u^{\top }{w}_u}\\ -\frac{1}{2{\sigma }_H^2}{\displaystyle \sum _{i=1}^{N_i}{h}_i^{\top }{h}_i}-\frac{1}{2}(|\delta (R)|\log {\sigma }_R^2+N_{u}K\log {\sigma }_W^2\\ +N_{i}K\log {\sigma }_H^2)+C& (9)\end{array}$

where C is a constant independent of all parameters and K is the dimension of user or item representations. With Gaussian noise ${\sigma }_R^2,{\sigma }_W^2,{\sigma }_H^2$ observed, maximizing the log-posterior is identical to minimizing the objective function with the form:

$\begin{array}{ll}{\displaystyle \sum _{(u,i)\in \delta (R)}}\frac{1}{2}{(r_{ui}-w_u^{\top }{h}_i)}^2+\frac{{\lambda }_W}{2}{\displaystyle \sum _{u=1}^{N_u}}||w_u{||}_2^2+\frac{{\lambda }_H}{2}{\displaystyle \sum _{i=1}^{N_i}}||h_i{||}_2^2,& (10)\end{array}$

where ${\lambda }_W={\sigma }_R^2/{\sigma }_W^2,{\lambda }_H={\sigma }_R^2/{\sigma }_H^2$. Note that (10) has exactly the same form as the regularized square error of MF, and gradient descent or its extensions can then be applied in training PMF.

FIGURE 2

Figure 2. PMF.

FIGURE 3

Figure 3. Biased PMF.

Since collaborative filtering techniques only consider rating matrix R in making recommendations, they cannot discover the preferences of users or for items with scant user-item interactions. This problem is referred as the cold-start issue. In section 3, we will review recommendation systems that extend CF to incorporate contexts or rich side information regarding users and items to alleviate the cold-start problem.

3. Attribute-Aware Recommender Systems

3.1. Overview

Attribute-aware recommendation models are proposed to tackle the challenges of integrating additional information from user/item/rating. There are two strategies for designing attribute-aware collaborative filtering-based systems. One direction is to combine content-based recommendation models with CF models, which can directly accept attributes as content to perform recommendation. On the other hand, researchers also try to extend an existing collaborative filtering algorithm such that it leverages attribute information.

Rather, we will focus on four important factors in the design of an attribute-aware recommender system in current research, as shown in Figure 4. They are specifically discussed from sections 3.2 to 3.5. With respect to input data, attribute sources determine whether an attribute vector is relevant to users, items, or ratings. For example, age describes a user instead of an item; rating time must be appended to ratings, representing when the rating event occurred. Different models impose distinct strategies to integrate attributes of specific sources. Additionally, a model may constrain attribute types that can be used. For instance, graph-based collaborative filtering realizations define attributes as node types, which is not appropriate for numerical attributes. Rating type is the factor that is emphasized by most model designers. Besides usual numerical ratings, many recommendation models concentrate on binary rating data, where the ratings represent whether users interact with items. Finally, different recommender systems emphasize different recommendation goals. One is to predict the ratings from users to items through minimizing the error between the predicted and real ratings. Another is to produce the ranking among items given a user instead of caring about the real rating value of a single item. We then summarize the design categories of all the surveyed papers in a table in section 3.6.

FIGURE 4

Figure 4. Model design flow of an attribute-aware collaborative filtering-based recommender system. When reading ratings and attributes for a proposed approach, we have to consider the sources and the types of attributes or ratings, which could affect the recommendation goals and model designs. The evaluation of a proposed recommender system depends heavily on the chosen recommendation goals.

Throughout this paper, we will use $\text{X}=\left[\begin{array}{c}{\text{x}}_1{\text{x}}_2\dots {\text{x}}_N\end{array}\right]\in {ℝ}^{K\times N}$ to denote the attribute matrix, where each column x_i represents a K-dimensional attribute vector of entity i. Here, an entity can refer to a user, an item, or a rating, determined by attribute sources (discussed in section 3.2). If attributes are limited categorically, then X ∈ {0, 1}^K×N can be represented by one-hot encoding (discussed in section 3.3). Note that our survey does not include models designed specifically for a certain type of attribute but rather covers models that are general enough to accept different types of attributes. For example, Collaborative Topic Regression (CTR) (Wang and Blei, 2011) extends matrix factorization with Latent Dirichlet Allocation (LDA) to import text attributes. Social Regularization (Ma et al., 2011a) specifically utilizes user social networks to regularize the learning of matrix factorization. Neither model is included since they are not general enough to deal with general attributes.

3.2. Sources of Attributes

Attributes usually come from a variety of sources. Typically, side information refers to the attributes appended to users or items. In contrast, keyword contexts indicate the attributes relevant to ratings. Ratings from the same user can be attached to different contexts, such as “locations where users rate items.” Recommendation models considering rating-relevant attributes are usually called context-aware recommender systems. Although contexts in some papers could include user-relevant or item-relevant ones, in this paper, we tend to be precise and use the term contexts only for rating-relevant attributes.

Sections 3.2.1 and 3.2.2, respectively introduce different attribute sources. It is worth mentioning our observation as follows. Even though some of the models we surveyed demand side information while others require context information, we discover that the two sets of attributes can be represented in a unified manner and thus that both types of models can be applied. We will discuss such unified representation in sections 3.2.3 and 3.2.4.

3.2.1. Side Information: User-Relevant or Item-Relevant Attributes

In the surveyed papers, side information could refer to user-relevant attributes, item-relevant attributes, or both. User-relevant attributes determine the characteristics of a user, such as “age,” “gender,” “education,” etc. In contrast, item-relevant attributes describe the properties of an item, like “movie running time,” “product expiration data,” etc. Below, we discuss user-relevant attributes, but all the statements can be applied to item-relevant attributes. Given user-relevant attributes, we can express them with matrix $\text{X}\in {ℝ}^{K\times N_u}$, where N_u is the number of users. Each column of X corresponds to K attribute values of a specific user. The most important characteristic of user-relevant attributes is that they are assumed unchanged with the rating process of a user. For example, every rating from the same user shares the identical user-relevant attribute “age.” In other words, even without any ratings from a user in collaborative filtering, the user's rating behaviors on items could be still extracted from other users that have similar user-relevant attribute values. Attribute-aware recommender systems that address the cold-start user problems (i.e., there are few ratings of a user) typically adopt user-relevant attributes as their auxiliary information under collaborative filtering. The attribute leverage methods are presented in section 4.

Readers may ask why user-relevant attributes and item-relevant attributes are not distinguished. Our observations during this survey indicate that most of the recommendation approaches have symmetric model designs for users and items. In matrix factorization-based methods, rating matrix R is factorized into two matrices W and H, referring to user and item latent factors, respectively. However, matrix factorization does not change its learning results if we exchange the rows and columns of R. Despite the exchange of rows and columns, W and H just exchange what they learn from ratings: W for items but H for users.

On the basis of the above conclusions, some of the related work could be further extended, in our opinion. If one attribute-aware recommender system claims to be designed only for user-relevant attributes, then readers could use a symmetric model design for item-relevant attributes to obtain a more general model.

3.2.2. Contexts: Rating-Relevant Attributes

Collaborative filtering-based recommender systems usually define ratings as the interaction between users and items, though it is likely to have more than one interaction. Since ratings are still the focus of recommender systems, other types of interactions, or rating-relevant attributes, are called contexts in related work. For example, the “time” and the “location” that a user rates an item are recorded with the occurrence of the rating behavior. Rating-relevant attributes change with rating behaviors, and thus they could offer auxiliary data on why a user decides to give a rating to an item. Moreover, rating-relevant attributes could capture the rating preference change of a user. If we have time information appended to ratings, then attribute-aware recommender systems could discover users' preferences at different times.

The format of rating-relevant attributes is potentially more flexible than that of user-relevant or item-relevant ones. In section 4.3, we will introduce a factorization-based generalization of matrix factorization. In this class of attribute-aware recommender systems, even the user and item latent factors are not required to predict ratings; mere rating-relevant attributes can do it, using their corresponding latent factor vectors.

3.2.3. Converting Side Information to Contexts

Most attribute-aware recommender systems choose to leverage one of the attribute sources. Some proposed approaches specifically incorporate user- or item-relevant attributes, while others are designed for rating-relevant attributes only. It seems that existing approaches should be applied according to which attribute sources they use. However, we argue that the usage of attribute-aware recommender systems could be independent of attribute sources if we convert them to each other using a simple method.

Let $\text{X}\in {ℝ}^{K_X\times N_u}$ be the user-relevant attribute matrix, where each column ${\text{x}}_u\in {ℝ}^{K_X}$ is the attribute set of user u. Similarly, let $Y\in {ℝ}^{K_Y\times N_i},Z\in {ℝ}^{K_Z\times N_r}$ be the matrices of item-relevant attributes and rating-relevant attributes, respectively. Note that a column index of matrix Z is denoted by π(u, i), which is associated with user u and item i. A simple concatenation with respect to users and items can achieve the goal of expressing X or Y as Z, as shown below:

$\begin{array}{ll}{z}_{\pi (u,i)}^{\prime }=\left[\begin{array}{c}{z}_{\pi (u,i)}\\ x_u\\ y_i\end{array}\right]\in {ℝ}^{K_Z+K_X+K_Y}.& (11)\end{array}$

Equation (11) implies that we just extend the current rating-relevant attributes z_π(u,i) to ${\text{z}}_{\pi (u,i)}^{\prime }$ using the attributes x_u, y_i from corresponding users or items. If training data do not consist of z_π(u,i), x_u or y_i, we can eliminate the notations on the right-hand side of (11). Advanced attribute selection or dimensionality reduction methods could extract effective dimensions in ${\text{z}}_{\pi (u,i)}^{\prime }$, but further improvement is beyond our scope. If missing attribute values exist in ${\text{z}}_{\pi (u,i)}^{\prime }$, then we suggest directly filling these attributes with 0. Please refer to section 3.2.4 for our reasoning.

3.2.4. Converting Contexts to Side Information

Following the topic in section 3.2.3, the reader may be curious about how to reversely convert rating-relevant attributes to user- or item-relevant ones. In the following paragraphs, we adopt the same notations as in section 3.2.3. Due to symmetric designs for X and Y, we demonstrate only the conversion from Z to X. Concatenation is still the simplest way to express Z as a part of X:

$\begin{array}{ll}{x}_u^{\prime }={\left[\begin{array}{c}{x}_u^{\top }{z}_{\pi (u,1)}^{\top }{z}_{\pi (u,2)}^{\top }\dots z_{\pi (u,i)}^{\top }\dots z_{\pi (u,N_i)}^{\top }\end{array}\right]}^{\top }\in {ℝ}^{K_X+K_Z{N}_i}.& (12)\end{array}$

All the rating-relevant attributes z_(u,1), z_(u,2), …, z_(u,Ni) from N_i items must be associated with user u. x_u is thus extended to ${\text{x}}_u^{\prime }$ by appending these attributes. Note that there are a large number of missing attributes on the right-hand side of (12), since most items are never rated by user u in real-world data. Eliminating missing z_π(u,i), as what we do in section 3.2.3, reveals different dimensions between two user-relevant attributes ${\text{x}}_u^{\prime },{\text{x}}_v^{\prime }$. To our knowledge, there is no user-relevant attribute-aware recommender system allowing individual dimensions of user-relevant attributes.

Readers can use attribute imputation approaches to remove missing values in ${\text{x}}_u^{\prime }$. However, we argue that simply filling missing elements with 0 is sufficient for attribute-aware recommender systems. We explain our reasons through the observations in section 3.3. For numerical attributes, (13)–(15) show the various attribute modeling methods. If attributes X are mapped through function f like (13) or (15), then zero attributes in f will cause no mapping effect (except constant intercept of f). If attributes X are fitted by latent factors onto function f such as (14), then typically in the objective design, we can skip the objective computation of missing attributes. As for categorical attributes, we exploit one-hot encoding to represent them with numerical values. Categorical attributes can then be handled as numerical attributes.

3.3. Attribute Types

In most cases, attribute-aware recommender systems accept a real-value attribute matrix X. However, we notice that some attribute-aware recommender systems require attributes to be categorical, which is typically represented by binary encoding. Specifically, this approach demands a binary attribute matrix where attributes of value 1 are modeled as discrete latent information in some way. A summary of the two types of attributes is given in sections 3.3.1 and 3.3.2.

It is trivial to put one-hot categorical attributes into numerical attribute-aware recommender systems, since binary values {0, 1} ⊂ ℝ. Nonetheless, putting numerical attributes into categorical attribute-aware recommendation systems runs the risk of losing attribute information (e.g., quantization processing).

3.3.1. Numerical Attributes

In our paper, numerical attributes refer to the set of real-valued attributes, i.e., attribute matrix X ∈ ℝ^K×N. We also classify integer attributes (like movie ratings {1, 2, 3, 4, 5}) to numerical attributes. Most of the relevant papers model numerical attributes as their default inputs in recommender systems, as is common in machine learning approaches.

There are three common model designs through which numerical attributes X affect recommender systems. First, we can map X to latent factor space by function f_θ with parameters θ, and then fit the corresponding user or item latent factor vectors:

$\begin{array}{l}{\displaystyle \underset{\theta ,W}{argmin}}||f_{\theta }(X)-W||\text{or }W=f_{\theta }(X)\text{ for user-relevant attributes},\\ {\displaystyle \underset{\theta ,H}{argmin}}||f_{\theta }(X)-H||\text{or }H=f_{\theta }(X)\text{ for item-relevant attributes}.& (13)\end{array}$

Second, like the reverse of (13), we define a mapping function f_θ such that mapped values from user or item latent factors can be close to observed attributes:

$\begin{array}{l}{\displaystyle \underset{\theta ,W}{argmin}}||f_{\theta }(W)-X||\text{or }X=f_{\theta }(W)\text{ for user-relevant attributes},\\ {\displaystyle \underset{\theta ,H}{argmin}}||f_{\theta }(H)-X||\text{or }X=f_{\theta }(H)\text{ for item-relevant attributes}.& (14)\end{array}$

Finally, numerical attributes can be put into function f_θ, which is independent of existing user or item latent factors in matrix factorization:

$\begin{array}{ll}{\displaystyle \underset{\theta ,W,H}{argmin}}||f_{\theta }(X)+W^{\top }H-R||.& (15)\end{array}$

Equations (13) and (14) are typically seen in user-relevant or item-relevant attributes, while rating-relevant attributes are often put into (15)-like formats. However, we emphasize that attribute-aware recommender systems are not limited to these three model designs.

3.3.2. Categorical Attributes

The values of a numerical attribute are ordered, while, on the other hand, the values of a categorical attribute show no ordered relations with each other. Given a categorical attribute Food ∈ {Rice, Noodles, Other}, the meanings of the values do not imply which one is larger than the other. Thus, it is improper to give categorical attributes ordered dummy variables, like Rice = 0, Noodles = 1, Other = 2, which could incorrectly imply Rice < Noodles < Other, misleading machine learning models. The most common solution to categorical attribute transformation is one-hot encoding. We generate d-dimensional binary attributes that correspond to the d values of a categorical attribute. Each of the d binary attributes indicates the current value of a categorical attribute. For example, we express attribute Food ∈ {{1, 0, 0}, {0, 1, 0}, {0, 0, 1}}. These correspond to the original values {Rice, Noodles, Other}. Since the values of the categorical attribute are unique, the mapped binary attributes contain only a 1, and others, 0. Once all the categorical attributes are converted to one-hot encoding expressions, we can apply them to existing numerical attribute-aware recommender systems.

Certain relevant papers are suitable for, or even adversely limited to, categorical attributes. Heterogeneous graph-based methods (section 4.4) add new nodes (e.g., Rice, Noodles, Other) to represent the values of categorical attributes. Following the concept of latent factor in matrix factorization, some methods propose to assign each categorical attribute value a low-dimensional latent factor vector (e.g., each of Rice, Noodles, Other has a latent factor vector w ∈ ℝ^K). These vectors are then jointly learned with classical user or item latent factors in attribute-aware recommender systems.

3.4. Rating Types

Although we always define the term ratings as the interactions between users and items in this paper, some previous works claim a difference between explicit opinions and implicit feedback. Taking the dataset MovieLens, for example, a user gives a rating value in {1, 2, 3, 4, 5} toward an item. The value denotes the explicit opinion, which quantifies the preference of the user for that item. How recommendation methods handle such type of ratings will be introduced in section 3.4.1.

Even though modeling explicit opinions is more beneficial for future recommendation, such data is more difficult to gather from users. Users may hesitate to show their preferences due to privacy considerations, or they may not be willing to spend time labeling explicit ratings. Instead, recommender systems are more likely to collect implicit feedback, such as user browsing logs. Such datasets record a series of binary values, each of which implies whether a user ever saw an item. User preferences behind implicit feedback assume that the items seen by a user must be more preferred by the user than those items that have never been seen. We discuss this type of rating in detail in section 3.4.2.

Some numerical rating data are controversial, like “the number of times a user clicks on the hyperlink to visit the page of an item.” Some of the related work may define such data as implicit feedback because the number of clicks is not equivalent to explicit user preferences. However, in this paper, we still identify them as explicit opinions. With respect to model designs, related recommendation approaches do not differentiate such data.

3.4.1. Explicit Opinions: Numerical Ratings

A numerical rating matrix r ∈ ℝ expresses users' opinions on items. Actually, numerical ratings in real-world scenarios are often represented by positive integers, such as MovieLens ratings r ∈ {1, 2, 3, 4, 5}. Though there are no explicit statements in related work, we suppose that a higher rating implies a more positive opinion.

Since, in most datasets, the gathered rating values are positive, there could be an unbiased learning problem. Matrix factorization could not learn the rating bias due to the non-zero mean of ratings $\text{E}$(r) ≠ 0. Specifically, in vanilla matrix factorization, we have regularization terms $||\text{W}{||}_F^2$ and $||\text{H}{||}_F^2$ for user and item latent factor matrix W, H. That is, we require the expected value $\text{E}$(W) = $\text{E}$(H) = 0 from the viewpoint of corresponding normal distributions. Given rating r_ui of user u to item i, and assuming the independence of W, H as probabilistic matrix factorization does, we obtain the expected value of rating estimate $\text{E}({\widehat{r}}_{ui})=\text{E}({\text{w}}_u^{\top }{\text{h}}_i)=0\forall (u,i)$, which cannot closely fit true ratings if $\text{E}$(r_ui) ≠ 0. Biased matrix factorization can alleviate the problem by absorbing the non-zero mean with additional bias terms. Besides, we are able to normalize all the ratings (subtract the rating mean from every rating) to make matrix factorization prediction unbiased. Real-world numerical ratings also have finite maximum and minimum values. Some recommendation models choose to normalize the ratings to range r ∈ [0, 1] and then constrain the range of rating estimate $\mathrm{\text{sig}}(\widehat{r})\in (0,1)$ using the sigmoid function $\mathrm{\text{sig}}(x)=\frac{1}{1+exp(-x)}$.

3.4.2. Implicit Feedback: Binary Ratings

Today, more and more researchers are interested in the scenario of binary ratings r ∈ {0, 1} (i.e., implicit feedback), since such rating data are more accessible, for instance, “whether a user browsed the information about an item.” Online services do not require users to give explicit numerical ratings, which are often harder to gather than binary ones.

We observe only positive ratings r = 1; negative ratings r = 0 do not exist in training data. Taking browsing logs as an example, the data include the items that are browsed by a user (i.e., positive examples). Items not being in the browsing data could imply that they are either absolutely unattractive (r = 0) or just unknown (r ∈ {0, 1}) to the user. One-class collaborative filtering methods are proposed to address the problem. Such methods often claim two assumptions:

• An item must be attractive to a user (r = 1) as long as the user has seen the item.

• Since we cannot distinguish between the two reasons (absolutely unattractive or just unknown) why an item is unseen, such methods suppose that all the unseen items are less attractive (r = 0). However, the number of unseen items is practically much larger than that of seen items. To alleviate the problem of learning bias toward r = 0 together with learning speed, we exploit negative sampling, which sub-samples partial unseen ratings for training.

To build an objective function satisfying the above assumptions, we can choose either pointwise learning (section 3.5.1) or pairwise learning (section 3.5.2). The Area Under the ROC Curve (AUC), Normalized Discounted Cumulative Gain (NDCG), Mean Average Precision (MAP), precision, and recall are often used to justify the quality of recommender systems for binary ratings.

3.5. Recommendation Goals

Any recommender system needs human intervention to set up a training goal. Since collaborative filtering-based recommender systems rely on ratings, the most straightforward goal is to infer what rating will be given by a user for an unseen item, called rating prediction. If the ratings of every item can be accurately predicted, then for any user, a recommender system can just sort and recommend items based on highest predicted rating. In machine learning, such a goal for model-based recommender systems can be described as pointwise learning. That is, given a user-item pair, a pointwise learning recommendation model directly minimizes the error of predicted ratings and true ones. The related mathematical details are presented in section 3.5.1.

However, in general, our ultimate goal is to recommend unseen items to users without being concerned about how these items are rated. All unseen items in pointwise learning are finally ranked in descending order of their ratings. In other words, what we truly care about is the order of ratings, but not the true rating values. Also, some research papers figure out that a low error of rating prediction is not always equivalent to a high quality of recommended item lists. Recent model-based collaborative filtering models have begun to set optimization goals of item ranking. That is, for the same user, such models maximize the differences between high-rated items and low-rated ones in training data. The implementation of item ranking includes pairwise learning and listwise learning in machine-learning domains. Both learning ideas try to compare the potentially related ranks between at least two items for the same user. section 3.5.2 will present how to define optimization criteria for item ranking.

3.5.1. Rating Prediction: Pointwise Learning

In the training stage, given a ground-truth rating r, a recommender system needs to make a rating estimate $\widehat{r}$ that is expected to predict r. Model-based collaborative filtering methods (e.g., matrix factorization) build an objective function to be optimized (either maximization or minimization) for recommendation goals. For numerical ratings r ∈ ℝ (section 3.4.1) of users u to items i, we can minimize the error between the ground truth and the estimate as follows:

$\begin{array}{l}{\displaystyle \underset{\widehat{r}}{argmin}}{\displaystyle \sum _{(u,i)\mid r_{ui}\in \delta (R)}}{\left({\widehat{r}}_{ui}-r_{ui}\right)}^2,\\ {\displaystyle \underset{\widehat{r}}{argmin}}{\displaystyle \sum _{(u,i)\mid r_{ui}\in \delta (R)}}{\left(\text{sig}({\widehat{r}}_{ui})-r_{ui}\right)}^2.& (16)\end{array}$

δ(R) is the set of training ratings, which are the non-missing entries in rating matrix R. As mentioned in section 3.4.1, if ground-truth ratings r are normalized to [0, 1] in data pre-processing, then in (16) we can put sigmoid function $\mathrm{\text{sig}}(x)=\frac{1}{1+exp(-x)}\in (0,1)$ onto rating estimate $\widehat{r}$ that fits r more closely. With respect to probability, (16) is equivalent to maximizing normal likelihood:

$\begin{array}{l}{\displaystyle \underset{\widehat{r}}{\text{argmax}}}{\displaystyle \prod _{(u,i)\mid r_{ui}\in \delta (R)}}{N}\left(r_{ui}\mid \mu ={\widehat{r}}_{ui},{\sigma }^2\right)\\ {\displaystyle \underset{\widehat{r}}{\text{argmax}}}{\displaystyle \prod _{(u,i)\mid r_{ui}\in \delta (R)}}{N}\left(r_{ui}\mid \mu =\text{sig}({\widehat{r}}_{ui}),{\sigma }^2\right)& (17)\end{array}$

where ${N}$ is the probability density function of a normal distribution with mean $\mu =\widehat{r}$ and variance σ² is a predefined uncertainty between r and $\widehat{r}$. Taking (−log) on (17) will give (16). Evidently the rating prediction problem can be addressed by regression models over ratings R with both (16) and (17).

For binary ratings r ∈ {0, 1} (section 3.4.2), other than (16) with the sigmoid function, such data can also be modeled as a binary classification problem. Specifically, we model r = 1 as the positive set and r = 0 as the negative set. A logistic regression (or Bernoulli likelihood) is then built for rating prediction:

$\begin{array}{l}{\displaystyle \underset{\widehat{r}}{\text{argmax}}}{\displaystyle \prod _{(u,i)\mid 1=r_{ui}\in \delta (R)}}Pr\left({\widehat{r}}_{ui}=1\right){\displaystyle \prod _{(u,i)\mid 0=r_{ui}\in \delta (R)}}Pr\left({\widehat{r}}_{ui}=0\right)\\ ={\displaystyle \underset{\widehat{r}}{\text{argmax}}}{\displaystyle \underset{\text{Positive set}}{{\displaystyle \underbrace{{\displaystyle \prod _{(u,i)\mid 1=r_{ui}\in \delta (R)}}\text{sig}\left({\widehat{r}}_{ui}\right)}}}}{\displaystyle \underset{\text{Negative set}}{{\displaystyle \underbrace{{\displaystyle \prod _{(u,i)\mid 0=r_{ui}\in \delta (R)}}\left(1-\text{sig}\left({\widehat{r}}_{ui}\right)\right)}}}}.& (18)\end{array}$

The optimizations of (16) and (17) are based on an evaluation metric: Root Mean Squared Error (RMSE), whose formal definition is as follows:

$\begin{array}{ll}\text{RMSE}=\sqrt{\frac{1}{\left|\delta (R)\right|}{\displaystyle \sum _{(u,i)\mid r_{ui}\in \delta (R)}}{\left({\widehat{r}}_{ui}-r_{ui}\right)}^2}.& (19)\end{array}$

For convenience of optimization, the regression models eliminate the root function from RMSE, essentially optimizing the MSE. Since the root function is monotonically increasing, minimizing MSE is equivalent to minimizing RMSE (19).

Even though a recommender system elects to optimize (18), the binary classification also attempts to minimize RMSE, except that rating estimate $\widehat{r}$ is replaced with sigmoid-applied version $\mathrm{\text{sig}}\left(\widehat{r}\right)$. Observing the maximization of (18), we obtain a conclusion: $\mathrm{\text{sig}}\left(\widehat{r}\right)\to 1$ as r = 1, or $\mathrm{\text{sig}}\left(\widehat{r}\right)\to 0$ as r = 0. In other words, (18) tries to minimize the error between $\mathrm{\text{sig}}\left(\widehat{r}\right)\in (0,1)$ and r ∈ {0, 1}, which has the same optimization goal as RMSE (19).

3.5.2. Item Ranking: Pairwise Learning and Listwise Learning

This class of recommendation goal requires a model to correctly rank two items in the training data, even though the model could inaccurately predict the value of a single rating. Since recommender systems are more concerned about item ranking for the same user u than ranking for different users, existing approaches sample item pairs (i, j) where r_ui > r_uj, given fixed user u (i.e., item i is ranked higher than item j for user u), and then let rating estimate pair $({\widehat{r}}_{ui},{\widehat{r}}_{uj})$ learn to rank the two items with ${\widehat{r}}_{ui}>{\widehat{r}}_{uj}$. In particular, we can use the sigmoid function $\mathrm{\text{sig}}(x)=\frac{1}{1+exp(-x)}$ to model the probabilities in the pairwise comparison likelihood:

$\begin{array}{l}\underset{\widehat{r}}{\text{argmax}}{\displaystyle \prod _{(u,i,j){|}_{r_{ui}>r_{uj}}^{\{r_{ui},r_{uj}\}\subseteq \delta (R),}}\mathrm{Pr}\left({\widehat{r}}_{ui}>{\widehat{r}}_{uj}\right)}\\ =\underset{\widehat{r}}{\text{argmax}}{\displaystyle \prod _{(u,i,j){|}_{r_{ui}>r_{uj}}^{\{r_{ui},r_{uj}\}\subseteq \delta (R),}}\text{sig}\left({\widehat{r}}_{ui}>{\widehat{r}}_{uj}\right).}& (20)\end{array}$

Taking (−log) on objective function (20) will give the log-loss function. Bayesian Personalized Ranking (BPR) (Rendle et al., 2009) first investigated the usage and the optimization of (20) for recommender systems. BPR shows that (20) maximizes a differentiable smoothness of the evaluation metric Area Under the ROC Curve (AUC):

$\begin{array}{ll}\text{AUC}=\frac{1}{T}{\displaystyle \sum _{(u,i,j){|}_{r_{ui}>r_{uj}}^{\{r_{ui},r_{uj}\}\subseteq \delta (R),}}\text{I}\left({\widehat{r}}_{ui}>{\widehat{r}}_{uj}\right)},& (21)\end{array}$

where T is the number of training instances {(u, i, j) ∣ {r_ui, r_uj} ⊆ δ(R), r_ui > r_uj}. $\text{I}$(x) ∈ {0, 1} denotes an indicator function whose output is 1 if and only if condition x is judged true. We show the connection between (20) and (21) below:

$\begin{array}{l}\underset{\widehat{r}}{\text{argmax}}(21)=\underset{\widehat{r}}{\text{argmax}}{\displaystyle \sum _{(u,i,j){|}_{r_{ui}>r_{uj}}^{\{r_{ui},r_{uj}\}\subseteq \delta (R),}}\text{I}\left({\widehat{r}}_{ui}-{\widehat{r}}_{uj}>0\right)}\\ \approx \underset{\widehat{r}}{\text{argmax}}{\displaystyle \sum _{(u,i,j){|}_{r_{ui}-r_{uj}>0}^{\{r_{ui},r_{uj}\}\subseteq \delta (R),}}\text{sig}\left({\widehat{r}}_{ui}-{\widehat{r}}_{uj}\right)}\\ \approx \underset{\widehat{r}}{\text{argmax}}{\displaystyle \sum _{(u,i,j){|}_{r_{ui}-r_{uj}>0}^{\{r_{ui},r_{uj}\}\subseteq \delta (R),}}\text{log sig}\left({\widehat{r}}_{ui}-{\widehat{r}}_{uj}\right)}\\ =\underset{\widehat{r}}{\text{argmax }\log }{\displaystyle \prod _{(u,i,j){|}_{r_{ui}-r_{uj}>0}^{\{r_{ui},r_{uj}\}\subseteq \delta (R),}}\text{sig}\left({\widehat{r}}_{ui}-{\widehat{r}}_{uj}\right)}.& (22)\end{array}$

Under the condition of argmax, we approximate non-differentiable indicator function $\text{I}$(x) by differentiable sigmoid function sig(x). The maximization of (22) is equivalent to optimizing (20) due to the monotonically increasing logarithmic function. AUC evaluates whether all the predicted item pairs follow the ground-truth rating comparisons in the whole item list. Our observations indicate that most of the reviewed approaches based on item ranking build their objective functions with AUC optimization. There are other choices of optimization functions to approximately maximize AUC, such as hinge loss:

$\begin{array}{ll}\underset{\widehat{r}}{\text{argmin}}{\displaystyle \sum _{(u,i,j){|}_{r_{ui}>r_{uj}}^{\{r_{ui},r_{uj}\}\subseteq \delta (R),}}\text{max}\left\{0,{\widehat{r}}_{uj}-{\widehat{r}}_{ui}\right\}}.& (23)\end{array}$

In the domain of top-N recommendation, the item order outside top-N ranks is unimportant for recommender systems. Maximizing AUC could fail to recommend items, since AUC gives the same penalty to all items. That is, a recommender system could gain high AUC when it accurately ranks the bottom-N items, but it is not beneficial for real-world recommendation, since a user only pays attention to the top-N items. Listwise evaluation metrics like Mean Reciprocal Rank (MRR), Normalized Discounted Cumulative Gain (NDCG), and Mean Average Precision (MAP) are proposed to give different penalty values to item ranking positions. There have been attempts to optimize differential versions of the above metrics, such as CliMF (Shi et al., 2012b), SoftRank (Taylor et al., 2008), and TFMAP (Shi et al., 2012a).

Our observations of the surveyed papers indicate that recommender systems reading binary ratings (section 3.4.2) prefer to optimize an item-ranking objective function. Compared with numerical ratings (section 3.4.1), a single binary rating reveals less information on a user's absolute preference. Pairwise learning methods can capture more information by modeling a user's relative preferences, because the number of rating pairs r_ui = 1 > 0 = r_uj is more than the number of ratings for each user.

3.6. Summary of Related Work

Having introduced the above categories for attribute-aware recommender systems, we list which category each publication we have surveyed belongs to in Tables 2–4. We trace back 10 years to summarize the recent trends in attribute-aware recommender systems.

TABLE 2

Table 2. List of model categories.

TABLE 3

Table 3. List of model categories.

TABLE 4

Table 4. List of model categories.

4. Common Model Designs of Attribute-Aware Recommender Systems

In this section, we formally introduce the common attribute integration methods of existing attribute-aware recommender systems. If collaborative filtering approaches are modeled by user or item latent factor structures like matrix factorization, then attribute matrices become either the prior knowledge of the latent factors (section 4.1) or the generation outputs from the latent factors (section 4.2). On the other hand, some approaches used are actually generalizations of matrix factorization (section 4.3). Besides, the interactions between users and items can be recorded by a heterogeneous network, which can incorporate attributes by simply adding attribute-representing nodes (section 4.4). The major distinction of these four categories lies in the representation of the interactions of users, items, and attributes. The discriminative matrix factorization models extend the traditional MF by learning the latent representation of users or items from the input attribute prior knowledge. Generative matrix factorization further considers the distributions of attributes and learns such together with the rating distributions. Generalized factorization models view the user/item identity simply as a kind of attribute, and various models have been designed for learning the low-dimensional representation vectors for rating prediction. The last category of models propose to represent the users, items, and attributes using a heterogeneous graph, where a recommendation task can be cast into a link prediction task on the heterogeneous graph. We classify each model into these categories in Table 5.

TABLE 5

Table 5. Classification of attribute-aware recommender systems.

4.1. Discriminative Matrix Factorization

Intuitively, the goal of an attribute-aware recommender system is to import attributes to improve recommendation performance (either rating prediction or item ranking). In the framework of matrix factorization, an item is rated or ranked according to the latent factors of the item and its corresponding users. In order words, the learning of latent factors in classical matrix factorization depends only on ratings. Thus, the learning may fail due to a lack of training ratings. If we can regularize the latent factors using attributes or make attributes determine how to rate items then matrix factorization methods can be more robust to compensate for the lack of rating information in the training data, especially for those users or items that have very few ratings. In the following, we choose to describe attribute participation from probabilistic perspectives. Learning in Probabilistic Matrix Factorization (PMF) tries to maximize the posterior probability p(W, H ∣ R) of two latent factor matrices W (for users) and H (for items) given observed entries of training rating matrix R. Clearly, attribute-aware recommender systems claim that we are given an extra attribute matrix X. Then by Bayes' rule, the posterior probability can be shown as follows:

$\begin{array}{l}{\displaystyle \underset{W,H}{\text{argmax }}}{\displaystyle \underset{\text{Posterior}}{{\displaystyle \underbrace{p(W,H\mid R,X)}}}}={\displaystyle \underset{W,H}{\text{argmax }}}\frac{p(R\mid W,H,X)p(W,H\mid X)}{p(R\mid X)}\\ ={\displaystyle \underset{W,H}{\text{argmax }}}p(R\mid W,H,X)p(W,H\mid X)\\ ={\displaystyle \underset{W,H}{\text{argmax }}}{\displaystyle \underset{\text{Likelihood}}{{\displaystyle \underbrace{p(R\mid W,H,X)}}}}{\displaystyle \underset{\text{Prior}}{{\displaystyle \underbrace{p(W\mid X)p(H\mid X)}}}}.& (24)\end{array}$

We eliminate the denominator p(R ∣ X) since it does not contain variables W, H for maximization. At the prior part, we follow the independence assumption W⊥H of PMF, though here the independence is given attribute matrix X. Now, compared with classical PMF, both likelihood p(R ∣ W, H, X) and prior p(W ∣ X)p(H ∣ X) could be affected by attributes X. Attributes in the likelihood can directly help predict or rank ratings, while attributes in the priors regularize the learning directions of latent factors. Moreover, some current works assume additional independence between attributes and the matrix factorization formulation. We give graphical interpretation of Discriminative Matrix Factorization in Figure 5. For ease of explanation, we suppose that all the random variables follow a normal distribution $p(x)={N}(x\mid \mu ,{\sigma }^2)$ with mean μ and variance σ², or a multivariate normal distribution $p(\text{x})={N}(\text{x}\mid \mu ,\Sigma )$ with mean vector μ and covariance matrix Σ. Theoretically, the following models accept other probability distributions.

FIGURE 5

Figure 5. Graphical interpretation of a discriminative probabilistic matrix factorization whose attributes X, Y, Z are given for ratings and latent factors. User and item-relevant attributes X, Y could affect the generation of latent factors W, H, or ratings R, while rating-relevant attributes Z typically determine the rating prediction R. The models of this class may eliminate some of the gray arrows to imply additional independence assumptions between attributes and other factors.

We further introduce the sub-categories below.

4.1.1. Attributes in a Linear Model

This is the generalized form to utilize attributes in this category. Given the attributes, a weight vector is applied to perform linear regression together with classical matrix factorization ${\text{w}}_u^{\top }{\text{h}}_i$. Its characteristics in mathematical form are shown in likelihood functions:

$\begin{array}{l}{\displaystyle \underset{W,H,\theta }{argmax}}{\displaystyle \underset{\text{Likelihood}}{{\displaystyle \underbrace{{\displaystyle {\prod }_{(u,i)\mid r_{ui}\in \delta (R)}}{N}(r_{ui}\mid {\mu }_R=w_u^{\top }{h}_i+\alpha (x_u)+\beta (y_i)+\gamma (z_{\pi (u,i)}),{\sigma }_R^2)}}}}\\ {\displaystyle \underset{\text{Prior}}{{\displaystyle \underbrace{p(W\mid X)p(H\mid Y)}}}};,& (25)\end{array}$

where θ = {α, β, γ}, while δ(R) denotes the non-missing ratings in the training data, and π(u, i) is the column index corresponding to user u and item i. $\text{X}\in {ℝ}^{K\times N_u},\text{Y}\in {ℝ}^{K\times N_i},\text{Z}\in {ℝ}^{K\times \left|\delta (\text{R})\right|}$ denote attribute matrices relevant to user, item, and ratings, respectively, while α, β, γ are their corresponding transformation functions, where attribute space is mapped toward the rating space identical with ${\text{w}}_u^{\top }{\text{h}}_i$. Most early models select simple linear transformations, i.e., α(x) = a^⊤x, β(y) = b^⊤y, γ(z) = c^⊤z, which has shown a boost in performance, but recent works consider neural networks for non-linear α, β, γ mapping functions. A simple linear regression model can be expressed as a likelihood function of normal distribution ${N}(r\mid \mu ,{\sigma }^2)$ with mean μ and variance σ². Ideally, the distributions of latent factors W, H will have prior knowledge from attributes X, Y, but we have not yet observed an approach aiming at designing attribute-aware priors as the last two terms of (25).

• Bayesian Matrix Factorization with Side Information (BMFSI) (Porteous et al., 2010) is an example in this sub-category. On the basis of Bayesian Probabilistic Matrix Factorization (BPMF) (Salakhutdinov and Mnih, 2008), BMFSI uses a linear combination like (25) to introduce attribute information to rating prediction. It is formulated as:

$\begin{array}{l}{\displaystyle \underset{W,H,\theta }{\text{argmax }}}{\displaystyle \underset{\text{Likelihood}}{{\displaystyle \underbrace{p(R\mid W,H,\theta )}}}}{\displaystyle \underset{\text{Priors}}{{\displaystyle \underbrace{p(W)p(H)}}}}\\ ={\displaystyle \underset{W,H,\theta }{\text{argmax}}}{\displaystyle \underset{\text{Matrix factorization using attributes}}{{\displaystyle \underbrace{{\displaystyle \prod _{(u,i)\mid r_{ui}\in \delta (R)}}{N}\left(r_{ui}\mid w_u^{\top }{h}_i+a_u^{\top }{x}_u+b_i^{\top }{y}_i,{\sigma }_R^2\right)}}}}\\ {\displaystyle \underset{\text{Regularization}}{{\displaystyle \underbrace{{\displaystyle \prod _u}{N}\left(w_u\mid {\mu }_u,{\Sigma }_u\right){\displaystyle \prod _i}{N}\left(h_i\mid {\mu }_i,{\Sigma }_i\right)}}}},& (26)\end{array}$

where θ = {a, b} and δ(R) is the set of training ratings. The difference from (25) is that rating attributes z will be concatenated with either x_u or y_u, and thus we drop independent weight variable c in BMFSI. We ignore other attribute-free designs of BMFSI (e.g., the Dirichlet process).

4.1.2. Attributes in a Bilinear Model

This is a popular method when two kinds of attributes (usually user and item) are provided. Given user attribute matrix X and item attribute matrix Y, a matrix A is used to model the relation between them. The mathematical form can be viewed as follows:

$\begin{array}{l}{\displaystyle \underset{W,H,\theta }{\text{argmax}}}{\displaystyle \underset{\text{Likelihood}}{{\displaystyle \underbrace{{\displaystyle \prod _{(u,i)\mid r_{ui}\in \delta (R)}}{N}\left(r_{ui}\mid {\mu }_R=\alpha (x_u,y_i)+\beta (x_u)+\gamma (y_i)+b,{\sigma }_R^2\right)}}}}\\ {\displaystyle \underset{\text{Prior}}{{\displaystyle \underbrace{p(W|X)p(H|Y)}}}},& (27)\end{array}$

where θ = {α, β, γ} are transformation functions from attribute space to rating space. In particular, function α learns the interior dependency between user attributes x and item attributes y, while β and γ find the extra factors by which x or y itself affects the rating result. Compared with (25), the advantage of (27) is that it further considers a set of rating factors that come from the intersections between user and item attributes. However, such a modeling approach cannot work if either user attributes or item attributes are not provided by training data. Prior studies commonly select a simple linear form, called bilinear regression:

$\begin{array}{l}{\mu }_R=\alpha \left(x_u,y_i\right)+\beta \left(x_u\right)+\gamma \left(y_i\right)+b\\ =x_u^{\top }A{y}_i+c_u^{\top }{x}_u+d_i^{\top }{y}_i+b\\ ={\tilde{x}}_u^{\top }\tilde{A}{\tilde{y}}_i.& (28)\end{array}$

In fact, as mentioned in Lu et al. (2016), ${\text{c}}_u^{\top }{\text{x}}_u+{\text{d}}_i^{\top }{\text{y}}_i+\text{b}$ can be absorbed into ${\text{x}}_u^{\top }\text{A}{\text{y}}_i$ and written in the form ${\tilde{x}}_u^{\top }\tilde{A}{\tilde{y}}_i$ by appending a new dimension whose value is fixed to 1 for each x and y.

Works in this category differ on whether the bilinear term is explicit or implicit. Also, the latent factor matrices W, H are inherently included in the bilinear form. Specifically, (28) implies that the form of the dot product of two linear-transformed attributes w_u = Sx_u and h_i = Ty_i since it can be reformed as ${\text{w}}_u^{\top }{\text{h}}_i={\text{x}}_u^{\top }({\text{S}}^{\top }\text{T}){\text{y}}_i$ where A = S^⊤T. Some works such as the Regression-based Latent Factor Model (see below) choose to softly constrain w_u ≈ Sx_u and h_i ≈ Ty_i using priors p(W ∣ X) and, p(H ∣ Y).

• Matchbox (Stern et al., 2009) (Figure 6). Let X, Y, Z be the attribute matrices with respect to users, items, and ratings, respectively. Matchbox assumes a rating is predicted by the linear combinations of X, Y, Z:

$\begin{array}{l}{\displaystyle \underset{A,B,c}{\text{argmax }}}{\displaystyle \underset{\text{Likelihood}}{{\displaystyle \underbrace{p(R\mid A,B,c,X,Y,Z)}}}}{\displaystyle \underset{\text{Prior}}{{\displaystyle \underbrace{p(c)p(A)p(B)}}}}\\ ={\displaystyle \underset{A,B,c}{\text{argmax}}}{\displaystyle \underset{\text{Matrix factorization using attributes}}{{\displaystyle \underbrace{{\displaystyle \prod _{(u,i)\mid r_{ui}\in \delta (R)}}{N}\left(r_{ui}\mid x_u^{\top }{A}^{\top }B{y}_i+c^{\top }{z}_{\pi (u,i)},{\sigma }_R^2\right)}}}}\\ {\displaystyle \underset{\text{Regularization}}{{\displaystyle \underbrace{\begin{array}{c}{\displaystyle {\prod }_m}{N}(c_m\mid {\mu }_{cm},{\sigma }_{cm}^2){\displaystyle {\prod }_{(u,k)}}{N}(a_{uk}\mid {\mu }_{Auk},{\sigma }_{Auk}^2){\displaystyle {\prod }_{(i,l)}}{N}(b_{il}\mid {\mu }_{Bil},{\sigma }_{Bil}^2)\end{array}}}}}& (29)\end{array}$

where δ(R) is the set of non-missing entries in rating matrix R. x_u, y_i represents the attribute set of user u or item i. z_(u,i) denotes the rating-relevant attributes associated with user u and item i. Note that (29) defines latent factors W = AX, H = BY, and then we just have to learn the shared weight matrices A, B. The prior distributions of A, B, c are further factorized, which assumes that all the weight entries in these matrices are independent of each other.

• Friendship-Interest Propagation (FIP) (Yang et al., 2011) (Figure 7). Following the notations from the previous RLFM introduction, FIP considers two types of attribute matrices: X and Y. Based on vanilla matrix factorization, FIP encodes attribute information by modeling the potential correlations between X and Y:

$\begin{array}{l}{\displaystyle \underset{W,H,A,B,C}{\text{argmax}}}{\displaystyle \underset{\text{Likelihood}}{{\displaystyle \underbrace{p(R\mid W,H,C,X,Y)}}}}{\displaystyle \underset{\text{Prior}}{{\displaystyle \underbrace{p(W\mid A,X)p(H\mid B,Y)}}}}\\ ={\displaystyle \underset{W,H,A,B,C}{\text{argmax}}}{\displaystyle \underset{\text{Matrix factorization using attributes}}{{\displaystyle \underbrace{{\displaystyle \prod _{(u,i)\mid r_{ui}\in \delta (R)}}{N}\left(r_{ui}\mid w_u^{\top }{h}_i+x_u^{\top }C{y}_i,{\sigma }_R^2\right)}}}}\\ {\displaystyle \underset{\text{Regularization using attributes}}{{\displaystyle \underbrace{{\displaystyle \prod _u}{N}(w_u\mid A{x}_u,{\Sigma }_W){\displaystyle \prod _i}{N}\left(h_i\mid B{y}_i,{\Sigma }_H\right)}}}}& (30)\end{array}$

where matrix C forms the correlations between attribute matrices X and Y.

• Regression-based Latent Factor Model (RLFM) (Agarwal and Chen, 2009) (Figure 8). Given three types of attribute matrices: user-relevant X, item-relevant Y, and rating-relevant Z, RLFM models them in different parts of biased matrix factorization. X, Y serve as the hyperparameters of latent factors, while Z joins the regression framework to predict ratings together with latent factors. RLFM can be written as:

$\begin{array}{l}{\displaystyle \underset{W,H,\theta }{\text{argmax }}}{\displaystyle \underset{\text{Likelihood}}{{\displaystyle \underbrace{p(R\mid W,H,c,d,\gamma ,Z)}}}}\\ {\displaystyle \underset{\text{Prior}}{{\displaystyle \underbrace{p(W\mid A,X)p(H\mid B,Y)p(c\mid \alpha ,X)p(d\mid \beta ,Y)}}}}\\ ={\displaystyle \underset{W,H,\theta }{\text{argmax}}}{\displaystyle \underset{\text{Matrix factorization using attributes}}{{\displaystyle \underbrace{{\displaystyle \prod _{(u,i)\mid r_{ui}\in \delta (R)}}{N}\left(r_{ui}\mid w_u^{\top }{h}_i+c_u+d_i+{\gamma }^{\top }{z}_{\pi (u,i)},{\sigma }_R^2\right)}}}}\\ {\displaystyle \underset{\text{Regularization using attributes}}{{\displaystyle \underbrace{\begin{array}{c}{\displaystyle {\prod }_u}{N}(w_u\mid A{x}_u,{\Sigma }_W){N}\left(c_u\mid {\alpha }^{\top }{x}_u,{\sigma }_c^2\right){\displaystyle {\prod }_i}{N}(h_i\mid B{y}_i,{\Sigma }_H){N}\left(d_i\mid {\beta }^{\top }{y}_i,{\sigma }_d^2\right)\end{array}}}}}& (31)\end{array}$

where θ = {c, d, A, B, α, β, γ} and δ(R) is the set of non-missing ratings for training. Biased matrix factorization adds two vectors c, d to learn the biases for each user or item. Parameters A, B, α, β, γ map attributes with latent factors (for X, Y) or rating prediction (for Z).

FIGURE 6

Figure 6. Matchbox.

FIGURE 7

Figure 7. KPMF.

FIGURE 8

Figure 8. RLFM.

4.1.3. Attributes in a Similarity Matrix

In this case, a similarity matrix that measures the closeness of attributes between users or between items is presented. Given the user attribute matrix $\text{X}\in {ℝ}^{D\times N_u}$, where N_u is the number of users and D is the user attribute dimension, a similarity matrix $\text{S}\in {ℝ}^{N_u\times N_u}$ is computed. There are many metrics for similarity calculation, such as Euclidean distance and kernel functions. The similarity matrix is then used for matrix factorization or other solutions. The special quality of this case is that human knowledge is involved in determining how the interactions between attributes should be modeled. One example is Kernelized Probabilistic Matrix Factorization, which utilizes both a user similarity matrix and item a similarity matrix.

• Kernelized Probabilistic Matrix Factorization (KPMF) (Zhou et al., 2012) (Figure 9). Let K, N_u, N_i be the number of latent factors, users, and items. Given user-relevant attribute matrix $\text{X}\in {ℝ}^{K\times N_u}$ or item-relevant attribute matrix $\text{Y}\in {ℝ}^{K\times N_i}$, we can always obtain a similarity matrix ${\text{S}}_{\text{X}}\in {ℝ}^{N_u\times N_u}$ or ${\text{S}}_{\text{Y}}\in {ℝ}^{N_i\times N_i}$ where each entry stores a pre-defined similarity between a pair of users or items. KPMF then formulates the similarity matrix as the prior of its corresponding latent factor matrix:

$\begin{array}{l}{\displaystyle \underset{W,H}{\text{argmax }}}{\displaystyle \underset{\text{Likelihood}}{{\displaystyle \underbrace{p(R\mid W,H)}}}}{\displaystyle \underset{\text{Prior}}{{\displaystyle \underbrace{p(W\mid X)p(H\mid Y)}}}}\\ ={\displaystyle \underset{W,H}{\text{argmax}}}{\displaystyle \underset{\text{Matrix factorization}}{{\displaystyle \underbrace{{\displaystyle \prod _{(u,i)\mid r_{ui}\in \delta (R)}}{N}\left(r_{ui}\mid w_u^{\top }{h}_i,{\sigma }_R^2\right)}}}}\\ {\displaystyle \underset{\text{Regularization using attributes}}{{\displaystyle \underbrace{{\displaystyle \prod _k}{N}\left(w^k\mid 0,S_X\right){\displaystyle \prod _l}{N}\left(h^l\mid 0,S_Y\right).}}}}& (32)\end{array}$

Here, we use subscripts w_u to denote the u-th column vector of a matrix W, while superscripts w^k imply the k-th row vector of W. Intuitively, the similarity matrices control the learning preferences of user or item latent factors. If two users have similar user-relevant attributes (i.e., they have a higher similarity measure in S_X), then their latent factors are forced to be closer during the matrix factorization learning.

FIGURE 9

Figure 9. FIP.

Neural Collaborative Filtering (He et al., 2017) (NCF) is a model that combines a linear structure and a neural network. He et al. (2018) further improves it by using CNN on top of the outer product of user and item embeddings. However, the authors only used user and item one-hot encoding vectors as their input. Though they mentioned that it could be easily modified to accommodate additional attributes, it was not clearly demonstrated. Therefore, we do not include it in either of the categories since it is beyond the scope of our survey (though it is similar to Discriminative Matrix Factorization). We still include NCF as a baseline model in the empirical comparison section, as well as including a slight modification of the model that takes additional attributes as inputs as a competitor. A brief introduction of the model and its variance will be given in section 5.1.1.

4.2. Generative Matrix Factorization

In Probabilistic Matrix Factorization (PMF), ratings are generated by the interactions of user or item latent factors. However, the PMF latent factors are not limited to rating generation. We can also generate attributes from latent factors. Mathematically, using Bayes' rule, we maximize a posteriori as follows:

$\begin{array}{l}{\displaystyle \underset{W,H}{\text{argmax }}}{\displaystyle \underset{\text{Posterior}}{{\displaystyle \underbrace{p(W,H\mid R,X)}}}}={\displaystyle \underset{W,H}{\text{argmax}}}\frac{p(R,X\mid W,H)p(W,H)}{p(R,X)}\\ ={\displaystyle \underset{W,H}{\text{argmax }}}p(R,X\mid W,H)p(W,H)\\ ={\displaystyle \underset{W,H}{\text{argmax }}}{\displaystyle \underset{\text{Likelihood}}{{\displaystyle \underbrace{p(R\mid W,H)p(X\mid W,H)}}}}\\ {\displaystyle \underset{\text{Prior}}{{\displaystyle \underbrace{p(W)p(H)}}}}.& (33)\end{array}$

where p(R, X) does not affect the posterior maximization. We again assume independence R⊥X given latent factors W, H in (33), which is commonly adopted in related work. Furthermore, X may share either latent factors W [i.e., p(X ∣ W)] or H [i.e., p(X ∣ H)] with R but not both due to matrix factorization having more generalization capability. We give the graphical interpretation of Generative Matrix Factorization in Figure 10.

FIGURE 10

Figure 10. Graphical interpretation of generative probabilistic matrix factorization, whose attributes X, Y, Z, together with ratings, are generated or predicted by latent factors. User and item-relevant attributes X, Y could be generated by corresponding latent factors W, H, respectively. Rating-relevant attributes Z are likely to result from both W and H. For models of this class, some of the gray arrows are removed to represent their additional independence assumptions about attribute generation.

The following relevant works are classified in this category. For simplicity, all the probabilities follow a normal distribution, i.e, $p(x)={N}(x\mid \mu ,{\sigma }^2)$ (i.e., squared loss objective) with mean μ and variance σ² (or mean vector μ and covariance matrix Σ for multivariate normal distributions). However, the example models are never restricted to within normal distributions.

There are two different branches in this direction. On the one hand, earlier works again use the matrix factorization technique to generate attributes from user or item latent factors. This can be seen as a linear mapping between latent factors and attributes. On the other hand, with the help of deep neural networks, recent works combine matrix factorization and deep autoencoders to realize non-linear mappings for attribute generation. We will introduce them in the following sections.

4.2.1. Attributes in Multiple Matrix Factorization

Similar to PMF R ≈ W^⊤H for rating distributions; attributes distributions are modeled using another matrix factorization form. Given user attribute matrix X, item attribute matrix Y, and rating attribute matrix Z, they can be factorized as X ≈ A^⊤W, Y ≈ B^⊤H of, low rank. Specifically, its objective function is written as:

$\begin{array}{l}{\displaystyle \underset{W,H,A,B}{\text{argmax}}}\\ {\displaystyle \underset{\text{Likelihood}}{{\displaystyle \underbrace{\begin{array}{c}{\displaystyle {\prod }_{(u,i)\mid r_{ui}\in \delta (R)}}{N}\left(r_{ui}\mid {\mu }_R=w_u^{\top }{h}_i,{\sigma }_R^2\right){\displaystyle {\prod }_{(j,u)}}{N}\left(x_{ju}\mid a_j^{\top }{w}_u,{\sigma }_X^2\right){\displaystyle {\prod }_{(v,i)}}{N}\left(y_{vi}\mid b_v^{\top }{h}_i,{\sigma }_Y^2\right)\end{array}}}}}\\ {\displaystyle \underset{\text{Likelihood}}{{\displaystyle \underbrace{{\displaystyle \prod _{(u,i)\mid r_{ui}\in \delta (R)}}{N}\left(z_{ui}\mid w_u^{\top }C{h}_i,{\sigma }_Z^2\right)}}}}{\displaystyle \underset{\text{Prior}}{{\displaystyle \underbrace{p(W)p(H)}}}},& (34)\end{array}$

where δ(R) denotes the non-missing entries of matrix R. The insight of (34) is to share the latent factors W, H in multiple factorization tasks. W is shared with user attributes, while H is shared with item attributes. Z requires the sharing of both W and H due to user- and item-specific rating attributes. Therefore, the side information of X, Y, and Z can indirectly transfer to rating prediction. Auxiliary matrices A, B, and C learn the mappings between latent factors and attributes. With respect to the mathematical form of matrix factorization, the expectation of feature values is linearly correlated with its corresponding latent factors.

• Collective Matrix Factorization (CMF) (Singh and Gordon, 2008) (Figure 11). Here, we introduce a common model in this sub-category. The CMF framework relies on the combination of multiple matrix factorization objective functions. CMF first builds the MF for rating matrix R. User- and item-relevant attribute matrices X, Y are then appended to the matrix factorization objectives. Overall, we have:

$\begin{array}{l}{\displaystyle \underset{W,H,A,B}{\text{argmax }}}{\displaystyle \underset{\text{Likelihood}}{{\displaystyle \underbrace{p(R\mid W,H)p(X\mid W,A)p(Y\mid H,B)}}}}{\displaystyle \underset{\text{Prior}}{{\displaystyle \underbrace{p(W)p(H)p(A)p(B)}}}}\\ ={\displaystyle \underset{W,H,A,B}{\text{argmax}}}{\displaystyle \underset{\text{Matrix factorization of }R}{{\displaystyle \underbrace{{\displaystyle \prod _{(u,i)\mid r_{ui}\in \delta (R)}}{N}\left(r_{ui}\mid w_u^{\top }{h}_i,{\sigma }_R^2\right)}}}}{\displaystyle \underset{\text{Matrix factorization of }X}{{\displaystyle \underbrace{{\displaystyle \prod _{(j,u)}}{N}\left(x_{ju}\mid a_j^{\top }{w}_u,{\sigma }_X^2\right)}}}}\\ {\displaystyle \underset{\text{Matrix factorization of }Y}{{\displaystyle \underbrace{{\displaystyle \prod _{(v,i)}}{N}\left(y_{vi}\mid b_v^{\top }{h}_i,{\sigma }_Y^2\right)}}}}\\ {\displaystyle \underset{\text{Regularization}}{{\displaystyle \underbrace{\begin{array}{c}{\displaystyle {\prod }_u}{N}(w_u\mid 0,{\Sigma }_W){\displaystyle {\prod }_i}{N}(h_i\mid 0,{\Sigma }_H){\displaystyle {\prod }_j}{N}\left(a_j\mid 0,{\Sigma }_A\right){\displaystyle {\prod }_v}{N}(b_v\mid 0,{\Sigma }_B)\end{array}}}}}& (35)\end{array}$

where δ(R), δ(X), δ(Y) denote the non-missing entries of matrix R, X, Y that are generated by latent factor matrices W, H, A, B of zero-mean normal priors (i.e., l2 regularization). In (35), W, H are shared by at least two matrix factorization objectives. Attribute information in X, Y is transferred to rating prediction R through sharing the same latent factors. Note that CMF is not limited to three matrix factorization objectives (35).

FIGURE 11

Figure 11. CMF.

4.2.2. Attributes in Deep Neural Networks

In deep neural networks, an autoencoder is usually used to learn the latent representation of observed data. Specifically, the model tries to construct an encoder ${E}$ and a decoder ${D}$, where the encoder learns to map from possibly modified attributes $\tilde{X}$ to low-dimensional latent factors, and the decoder recovers original attributes X from latent factors. Moreover, activation functions in autoencoders can reflect non-linear mappings between latent factors and attributes, which may capture the characteristics of attributes more accurately.

To implement an autoencoder, we first generate another attribute matrix $\tilde{X}$ from X. $\tilde{X}$ could be the same as X or could be different due to corruption, e.g., adding random noise. Autoencoders aim to predict the original X using latent factors that are inferred from generated $\tilde{X}$. Here, attributes serve not only as the generation results X but also as the prior knowledge $\tilde{X}$ of latent factors. Let us review Bayes' Rule to figure out where autoencoders appear for generative matrix factorization:

$\begin{array}{l}{\displaystyle \underset{W,H}{\text{argmax }}}p\left(W,H\mid R,X,\tilde{X}\right)={\displaystyle \underset{W,H}{\text{argmax}}}\frac{p\left(R,X\mid W,H,\tilde{X}\right)p\left(W,H\mid \tilde{X}\right)}{p\left(R,X\mid \tilde{X}\right)}\\ ={\displaystyle \underset{W,H}{\text{argmax }}}p\left(R,X\mid W,H,\tilde{X}\right)p\left(W,H\mid \tilde{X}\right)\\ ={\displaystyle \underset{W,H}{\text{argmax }}}{\displaystyle \underset{\text{Likelihood}}{{\displaystyle \underbrace{{\displaystyle \underset{\text{Matrix factorization}}{{\displaystyle \underbrace{p\left(R\mid W,H,\tilde{X}\right)}}}}{\displaystyle \underset{\text{Decoder}{D}}{{\displaystyle \underbrace{p\left(X\mid W,H,\tilde{X}\right)}}}}}}}}{\displaystyle \underset{\text{Prior with assumption }W\perp H\mid \tilde{X}}{{\displaystyle \underbrace{{\displaystyle \underset{\text{Encoder}{E}}{{\displaystyle \underbrace{p\left(W\mid \tilde{X}\right)p\left(H\mid \tilde{X}\right)}}}}}}}}.& (36)\end{array}$

p(R, Y ∣ Ỹ) is eliminated due to irrelevance in maximization of (36). By sharing latent factors W, H between autoencoders and matrix factorization, attribute information can affect the learning of rating prediction. Modeling ${D}$ with normal distributions, we can conclude that the expectation of attributes X is non-linearly mapped from latent factors W, H. Although latent factors have priors from attributes, we categorize relevant works as generative matrix factorization, since we explicitly model attribute distributions in the decoder part of autoencoders.

• Collaborative Deep Learning (CDL) (Wang et al., 2015) (Figure 12). This model uses a combination of collaborative filtering and Stacked Denoising Auto-Encoder (SDAE). Since the model claims to exploit item attributes Y only, in the following introduction we define $Y=X,\tilde{Y}=\tilde{X}$ in (36). In SDAE, input attribute Ỹ is not equivalent to Y due to the addition of random noise to Ỹ. CDL implicitly adds several independence assumptions (R⊥Ỹ ∣ W, H), (Y⊥W ∣ H, Ỹ), (W⊥Ỹ) to formulate its model. Then, using identical notations in CMF introduction, normal distributions ${N}$ are again applied to CDL:

$\begin{array}{l}{\displaystyle \underset{W,H,\theta ,\varphi }{\text{argmax }}}{\displaystyle \underset{\text{Likelihood}}{{\displaystyle \underbrace{p(R,\mid W,H)p\left(Y\mid H,\tilde{Y}\right)}}}}{\displaystyle \underset{\text{Prior}}{{\displaystyle \underbrace{p\left(H\mid \tilde{Y}\right)p(W)}}}}\\ ={\displaystyle \underset{W,H,\theta ,\varphi }{\text{argmax}}}{\displaystyle \underset{\text{Matrix factorization}}{{\displaystyle \underbrace{{\displaystyle \prod _{(u,i)\mid r_{ui}\in \delta (R)}}{N}\left(r_{ui}\mid w_u^{\top }{h}_i,{\sigma }_R^2\right)}}}}\\ {\displaystyle \underset{\text{Stacked denoising auto-encoder for }Y}{{\displaystyle \underbrace{{\displaystyle \prod _i}{N}\left(y_i\mid {{D}}_{\varphi }({{E}}_{\theta }({\tilde{y}}_i)),{\Sigma }_Y\right){N}\left(h_i\mid {{E}}_{\theta }({\tilde{y}}_i),{\Sigma }_H\right)}}}}\\ {\displaystyle \underset{\text{Regularization}}{{\displaystyle \underbrace{{\displaystyle \prod _u}{N}(w_u\mid 0,{\Sigma }_W)}}}}.& (37)\end{array}$

Functions ${E},{D}$ indicate the encoder and the decoder of SDAE. The two functions could be formed by multi-layer perceptrons whose parameters are denoted by θ, ϕ. The distribution of attribute matrix Y to be modeled in the decoder part can be clearly seen. Last but not least, the analysis from (36) to (37) implies that other ideas, user-relevant attributes for example, could be involved naturally in CDL, as long as we remove more independence assumptions.

FIGURE 12

Figure 12. CDL.

4.3. Generalized Factorization

Thanks to the success of matrix factorization in recommender systems, advanced works have emerged on generalizing the concept of matrix factorization in order to extract more information from attributes or interactions between users and items. The works classified in either sections 4.1 or 4.2 propose to design attribute-aware components on the basis of PMF. They explicitly express an assumption of vanilla PMF: the existence of a latent factor matrix W to represent user preferences and another matrix H for items. However, the works classified in this section do not regard W and H as special features of the models. Rather, such works propose an expanded latent factor space shared by users, items, and attributes. Here, neither users nor items are special entities in a recommender system. They are simply considered as categorical attributes. Taking rating r_ui as an example, it implies that we have a one-hot user-encoding vector where all the entries are 0 except for the u-th entry; similarly, we also have a one-hot item-encoding vector of the i-th entry, 1. Thus, external attributes X can be involved simply in the matrix-factorization-based models, because now users and items are also attributes whose interactions commonly predict or rank ratings. We first propose the most generalized version of interpretation: Given a rating r and its corresponding attribute vector x ∈ ℝ^N, then we make rating estimate (Figure 13):

$\begin{array}{l}\underset{w}{\text{argmax}}{\displaystyle \prod _{r\in \delta (R)}N}(r\mid {\mu }_R\\ ={\displaystyle \sum _{d=D_m}^{D_M}{\displaystyle \sum _{j_1=1}^N{\displaystyle \sum _{j_2=j_1+1}^N\text{}}}}\dots \text{}{\displaystyle \sum _{j_d=j_{d-1}+1}^N{w}_{j_1{j}_2\dots j_d}}\left(x_{j_1}{x}_{j_2}\dots x_{j_d}\right),{\sigma }_R^2),& (38)\end{array}$

where δ(R) indicates the set of observed ratings in training data. Variable d ∈ {0} ∪ ℕ determines the dth-order multiplication interaction between attributes x_j. As d = 0, we introduce an extra bias weight w₀ ∈ ℝ in (38). The large number of parameters w ∈ ℝ is very likely to overfit training ratings due to the dimensionality curse. To alleviate overfitting problems, the ideas in matrix factorization are applied here. For higher values of d, it is assumed that each w is a function of low-dimensional latent factors:

$\begin{array}{ll}{w}_{j_1{j}_2\dots j_d}=f_d\left(v_{j_1},v_{j_2},\dots ,v_{j_d}\right),& (39)\end{array}$

where ${\text{v}}_j\in {ℝ}^{K_j}$ implies the K-dimensional (K_j ≪ N∀j) latent factor or representation vector for each element x_j of x (Figure 14). Function f_d maps these d vectors to a real-valued weight. Our learning parameters then become v. The overall number of parameters (D_m ≤ d ≤ D_M) decreases from $\sum _{d=D_m}^{D_M}\frac{n!}{d!(n-d)!}=O(2^N)$ to $\sum _{j=1}^N{K}_j=O(NK)$ where $K={\text{max}}_{1\le j\le N}{K}_j$. Next, we prove that matrix factorization is a special case of (38). Let D_m = D_M = 2 and x be the concatenation of one-hot encoding vectors of users as well as items. Also, we define $f_2(\text{v},\text{y})={\text{v}}^{\top }\text{y}$. Then, for rating r_ui of user u to item i, we have:

$\begin{array}{ll}{\displaystyle \underset{v}{\text{argmax}}}{\displaystyle \prod _{r_{ui}\in \delta (R)}}{N}\left({\widehat{r}}_{ui}\mid {\mu }_R={\displaystyle \sum _{j_1=1}^N}{\displaystyle \sum _{j_2=j_1+1}^N}{v}_{j_1}^{\top }{v}_{j_2}\left(x_{j_1}{x}_{j_2}\right)=v_u^{\top }{v}_{N_u+i},{\sigma }_R^2\right),& (40)\end{array}$

where N_u denotes the number of users. Equation (40) is essentially equivalent to matrix factorization. In this class, the existing works either generalize or improve two early published models: Tensor Factorization (TF) (Figure 15) and the Factorization Machine (FM) (Figure 16). Both models can be viewed as special cases of (38). We introduce TF and FM in the sections below.

FIGURE 13

Figure 13. w-weighted generalization.

FIGURE 14

Figure 14. v-approximate generalization.

FIGURE 15

Figure 15. TF.

FIGURE 16

Figure 16. FM.

4.3.1. TF-Extended Models

Tensor Factorization (TF) (Karatzoglou et al., 2010) requires the input features to be categorical. Attribute vector x ∈ {0, 1}^N is the concatenation of D one-hot encoding vectors. (D − 2) categorical rating-relevant attributes form their own binary one-hot representations. The additional two one-hot vectors represent IDs of users and items, respectively. As a special case of (38), TF fixes D_m = D_M = D to build a single D-order interaction between attributes. Since weight function f_D in (39) allows individual dimensions K_j for each latent factor vector v_j, TF defines a tensor ${S}\in {ℝ}^{K_1\times K_2\times \dots \times K_D}$ to exploit the tensor product of all latent factor vectors. In sum, (38) is simplified as follows:

$\begin{array}{l}{\mu }_R={\displaystyle \sum _{j_1=1}^N}{\displaystyle \sum _{j_2=j_1+1}^N}\dots {\displaystyle \sum _{j_D=j_{D-1}+1}^N}{f}_D\left(v_{j_1},v_{j_2},\dots ,v_{j_D}\right)\left(x_{j_1}{x}_{j_2}\dots x_{j_D}\right)\\ =f_D\left(v_{l_1},v_{l_1},\dots ,v_{l_D}\right)\text{ as }{x}_{l_1}=x_{l_2}=\dots \\ =x_{l_D}=1,\text{other }x=0\\ =\langle {S},v_{l_1},v_{l_2},\dots ,v_{l_D}\rangle \\ ={\displaystyle \sum _{k_1=1}^{K_1}}{\displaystyle \sum _{k_2=1}^{K_2}}\dots {\displaystyle \sum _{k_D=1}^{K_D}}{s}_{k_1{k}_2\dots k_D}{v}_{l_1{k}_1}{v}_{l_2{k}_2}\dots v_{l_D{k}_D}& (41)\end{array}$

where function f(·) = < · > denotes the tensor product. Note that attribute vectors x in TF must consist of exact C 1s due to one-hot encoding. Therefore, there exists only the matches j₁ = l₁, j₂ = l₂, …, j_D = l_D where all the attributes in these positions are set to 1.

4.3.2. FM-Extended Models

The Factorization Machine (FM) (Rendle et al., 2011) allows numerical attributes x ∈ ℝ^N as input, including one-hot representations of users and items. Although higher-order interactions between attributes could be formulated, FM focuses on at most second-order interactions. To derive FM from (38), let 0 = D_m ≤ d ≤ D_M = 2 and $w_{j_1{j}_2}=f_2({\text{v}}_{j_1},{\text{v}}_{j_2})={\text{v}}_{j_1}^{\top }{\text{v}}_{j_2}$ in (39) be applied for the second-order interaction. We then begin to simplify (38):

$\begin{array}{l}{\mu }_R={\displaystyle \underset{d=0}{{\displaystyle \underbrace{w_0}}}}+{\displaystyle \underset{d=1}{{\displaystyle \underbrace{{\displaystyle \sum _{l=1}^N}{w}_l{x}_l}}}}+{\displaystyle \underset{d=2}{{\displaystyle \underbrace{{\displaystyle \sum _{j_1=1}^N}{\displaystyle \sum _{j_2=j_1+1}^N}{w}_{j_1{j}_2}\left(x_{j_1}{x}_{j_2}\right)}}}}\\ =w_0+{\displaystyle \sum _{l=1}^N}{w}_l{x}_l+{\displaystyle \sum _{j_1=1}^N}{\displaystyle \sum _{j_2=j_1+1}^N}{v}_{j_1}^{\top }{v}_{j_2}\left(x_{j_1}{x}_{j_2}\right)& (42)\end{array}$

which is exactly the formulation of FM. Note that FM implicitly requires all the latent factor vectors v to be of the same dimension K; however, this requirement could be removed from the viewpoint of our general form (38). Models in this category mainly differ in two aspects. First, linear mapping can be replaced by deep neural networks, which allows non-linear mapping of attributes. Second, FM only extracts first-order and second-order interactions. Further works such as Cao et al. (2016) extract higher-order interactions between attributes.

4.4. Modeling User-Item-Rating Interactions Using Heterogeneous Graphs

We notice several relevant works that perform low-rank factorization or representation learning in heterogeneous graphs, such as (Lee et al., 2011; Yu et al., 2014; Pham et al., 2016; Zheng et al., 2016; Palumbo et al., 2017; Jiang et al., 2018; Nandanwar et al., 2018). Note that these works do not require graph-structured data. Instead, they model the interactions between user, item, rating, and attribute as a heterogeneous graph. The interactions of users and items can be represented by a heterogeneous graph with two node types. An edge is unweighted for implicit feedback and weighted for explicit opinions. External attributes are typically leveraged by assigning them extra nodes in the heterogeneous graph. A heterogeneous graph structure is more suitable for categorical attributes, since each candidate value of attributes can be naturally assigned a node.

In heterogeneous graphs, recommendation can be viewed as a link prediction problem. Predicting a future rating corresponds to forecasting whether an edge will be built between user and item nodes. The existing works commonly adopt a two-stage algorithm to learn the model. First, we apply a random-walk or a meta-path algorithm to gather the similarities between users and items from a heterogeneous graph. The similarity information can be kept as multiple similarity matrices or network embedding vectors. Then, a matrix factorization model or other supervised machine learning algorithms are applied to extract discriminative features from the gathered similarity information, which is used for future rating prediction. Another kind of method is to first define the environment where ranking or similarity algorithms are applied. Defining the environment refers to either determining the heterogeneous graph structures or learning the transition probabilities between nodes from observed heterogeneous graphs. Having the environment, we can apply an existing algorithm (Rooted PageRank, for example) or a proposed method to gain the relative ranking scores for each item. In other words, the main difference between the two kinds of methods is whether the similarity calculation is in the first stage or the second stage. Both kinds of methods as abovementioned can be unified as a constrained likelihood maximization:

$\begin{array}{l}{\displaystyle \underset{\theta }{\text{argmax }}}{\displaystyle \underset{\text{Likelihood}}{{\displaystyle \underbrace{p(s,R\mid \theta ,X)}}}}\text{such that}\\ {\displaystyle \underset{\text{Constraint considering attributes}}{{\displaystyle \underbrace{s(u,i)={\displaystyle \sum _{w\in {\mathbb{P}}_{u,i}\mid X}}{f}_{\theta }(w,r_{ui})\forall (u,i),r_{ui}\in \delta (R)}}}},& (43)\end{array}$

where a parameterized function f_θ is specifically defined to estimate a similarity score s(u, i) of item i, given user u as a query. The calculation of a similarity score comes from the set ℙ_u,i of random walks or paths w from node u to i in the heterogeneous graph. The generation of ℙ_u,i considers the attribute node set X. Either or both of the likelihood and the constraint may involve the information of observed ratings δ(R) of rating matrix R for likelihood maximization or similarity calculation. In our estimation, the current heterogeneous-graph-based models do not directly solve the constrained optimization problem (Equation 43). Commonly, they first exploit a two-stage solution that either solves the likelihood maximization or satisfies the similarity constraint. The output is then cast into the other part of (Equation 43). With different definitions of f_θ and p, the two-stage process may run only once or iteratively until convergence. The definition of s(u, i) in the surveyed papers includes PageRank (Lee et al., 2011; Jiang et al., 2018), PathSim (Yu et al., 2014), and so on. The likelihood function p guides the similarity-related parameters θ to fit the distribution objective of observed similarities s or ratings R. The objective may be given attributes X as auxiliary learning data. Minor works like (Lee et al., 2011) do not optimize the likelihood; instead, they directly compute the similarity constraint with pre-defined θ from a specifically designed heterogeneous graph.

We now explain why random walk or path-based algorithms in heterogeneous graphs are regarded as collaborative filtering methods. For ease of explanation, we first consider the case of no auxiliary attributes. We have users and items as nodes in a graph structure, where edge weights denote the ratings of users toward items. If both users u and v rate the same item i, then i becomes a shortcut from u to v. Therefore, starting from user node u, another user v at a low shortest path distance from u could have similar rating behaviors as u. We can then recommend items at short distances from u, based on the shortcut through v. This is just the spirit of collaborative filtering, which exploits the similar rating behaviors of other users for future recommendation to target users. If attribute nodes are taken into consideration in heterogeneous graphs, they also become the shortcuts for paths between users and items.

• HeteRec (Yu et al., 2014). This model first assumes an attribute-aware heterogeneous graph formed by attributes and ratings. We then obtain M non-negative PathSim Sun et al. (2011) similarity matrices S⁽¹⁾, S⁽²⁾, …, S^(m), …, S^(M). Given low-rank non-negative factorization of each S^(m) = U^(m)⊤V^(m), a rating estimate $\widehat{r}$ is defined as follows:

$\begin{array}{ll}\widehat{r}={\displaystyle \sum _{m=1}^M}{\theta }_m{u}^{(m)\top }{v}^{(m)}.& (44)\end{array}$

• Graph-Based Flexible Recommendation (GFREC) (Lee et al., 2011). This approach applies personalized PageRank, an unsupervised random walk-based algorithm, to perform random walks in a bipartite heterogeneous graph for recommendation. Instead of independently defining a single node for each categorical attribute value, GFREC makes a node imply both an attribute value and its associated user or item. For example, given a user u and its corresponding attribute value x, we can put a node named (u, x) in the heterogeneous network. In a GFREC bipartite heterogeneous graph, two disjoint sets respectively refer to users and items. GFREC shows that personalized PageRank can compute the visiting probabilities of each node in this bipartite heterogeneous graph. Finally, the probabilities are used to rank items to be recommended.

4.5. Differences Between Models

In our classification system, there are still a number of works in each category. Although models in the same category share a similar mathematical form in terms of the design of the objective function, they can vary in certain design aspects. One of the most important differences is the task they focus on. Some models emphasize predicting future ratings. Therefore, they are usually dedicated to minimizing the Root Mean Square Error (RMSE) to achieve a more accurate prediction of scores. Some other models care more about the top-N items that a user may like. Hence, they adopt pairwise ranking to predict the preference for items of a given user. A second difference is based on the types of attributes that are exploited. For example, Yang et al. (2011) takes a social network as its input feature matrix. A third difference is the source of attributes each model claims to use. Some models claim to accept only user attributes, while others might be more general for different types of attributes.

5. Empirical Comparison

In this section, we evaluate the effectiveness of each model by examining its performance on several datasets. We focus on the rating prediction task since the majority of the models have their objectives designed for this task. We also compare the performance of each competitor under different conditions: with/without user-relevant attributes, item-relevant attributes, or rating-relevant attributes. Hyperparameters for each model are tuned based on grid search.

5.1. Experimental Setup

5.1.1. Model

We consider several popular models that are representative of each category for comparison: the Regression-based Latent Factor Model (RLFM) (Agarwal and Chen, 2009) and Friendship-Interest Propagation (FIP) (Yang et al., 2011) in Discriminative Matrix Factorization, Collective Matrix Factorization (CMF) (Singh and Gordon, 2008) in Generative Matrix Factorization, and Tensor Factorization (TF) (Karatzoglou et al., 2010), the Factorization Machine (FM) (Rendle et al., 2011), and the Neural Factorization Machine (NFM) (He and Chua, 2017) in Generalized Factorization. We also select Matrix Factorization (MF) (Chin et al., 2016) as a simple baseline model that does not include any attribute and Neural Collaborative Filtering (NCF) (He et al., 2017) as a stronger baseline (the simple version where attributes are one-hot encoding vectors of users and items). NCF+ (where attributes are one-hot encoding vectors appended with those from datasets) serves as a competitor in DMF. We do not compare Heterogeneous Graph models, as models in this category are more diverse and it is hard to pick a representative model. The attribute types that each model accepts are summarized in Table 6.

• Tensor Factorization (TF)

TF is an D-dimensional extension of MF. We denote the tensor containing the ratings by ${R}\in {ℝ}^{N_1\times N_2\times \dots \times N_D}$. The tensor ${R}$ can be factorized into D matrices ${\text{V}}_j\in {ℝ}^{K_j\times N_j}$ and one central tensor ${S}\in {ℝ}^{K_1\times K_2\times \dots \times K_D}$ where K₁, K₂, …, K_D is the dimension of latent factors. In this case, the predicted rating for r_j1j2…jD is ${\widehat{r}}_{j_1{j}_2\dots j_D}={S}{\times }_{V_1}{\text{V}}_1{\times }_{V_2}{V}_2\times \dots {\times }_{V_D}{V}_D$. Note that the subscript of the tensor-matrix multiplication operator × _V shows the direction on which the tensor multiplies the matrix. The loss function for this model is

$\begin{array}{l}{\displaystyle \underset{S,V}{\text{argmin}}}{\displaystyle \sum _{j_1,j_2,\dots ,j_D\mid r_{j_1{j}_2\dots j_D}\in \delta ({R})}}{\left({\widehat{r}}_{j_1{j}_2\dots j_D}-r_{j_1{j}_2\dots j_D}\right)}^2\\ +{\displaystyle \sum _{j=1}^D}\Omega \left(V_j\right)+\Omega ({S}),& (45)\end{array}$

where $\delta ({R})$ is the set of non-missing entries in ${R}$, and $\Omega (\text{V})=\frac{{\lambda }_V}{2}\parallel \text{V }{\parallel }_F^2$ is the regularization term of squared Frobenius norm. We can update the latent factors using SGD. One major concern of with model is that its complexity and storage requirement grow exponentially with the number of dimensions of the rating tensor ${R}$.

• Collective Matrix Factorization (CMF)

CMF is a model incorporating side information by factorizing multiple matrices simultaneously. In an D-entities schema, ${\text{X}}^{(ij)}\in {ℝ}^{N_i\times N_j}$ represents the relation between entity i and j if the relation exists, i.e., E_i ~ E_j. CMF factorizes these matrices into ${\text{U}}^{(1)}\in {ℝ}^{K\times N_1},{\text{U}}^{(2)},\dots ,{\text{U}}^{(D)}\in {ℝ}^{K\times N_D}$ such that X^(ij) ≈ f^(ij)(U^(i)⊤U^(j)). For a dataset with user- and item-relevant attributes, there are four entities (E₁: user id, E₂: item id, E₃: user features, and E₄: item features) and three relations (X⁽¹²⁾: ratings matrix, X⁽¹³⁾, X⁽²⁴⁾: feature matrix). In our experiment, f is the identity function for the rating matrix and the sigmoid function is that for the feature matrix. Let E = {(i, j):E_i ~ E_j ∩ i < j} denote the set of all existing relations pairs, U denote the set of latent factors, W denote the set of weight matrices, and $D_F(\text{Y}||\text{X},\text{W})=\sum _{ij}{w}_{ij}(F(y_{ij})+F^{*}(x_{ij})-y_{ij}{x}_{ij})$ measure the weighted divergence of two matrices Y and X. The loss function for this model is

$\begin{array}{l}\underset{U,W}{\text{argmin}}{\displaystyle \sum _{ij\in E}{\alpha }^{(ij)}}(D_{F^{(ij)}}(U^{(i)\top }{U}^{(j)})||X^{(ij)},W^{(ij)})\\ +D_{G^{(i)}}(0||U^{(i)})+D_{G^{(j)}}(0||U^{(j)}))& (46)\end{array}$

where F^(ij) defines the loss for a reconstruction, and G⁽ⁱ⁾ defines the loss for a regularizer. We can update U through a Newton-Raphson step.

• Regression-Based Latent Factor Model (RLFM)

Let r_ui denote the rating given by user u to item i. ${\text{z}}_{\pi (u,i)}\in {ℝ}^{K_Z}$, ${\text{x}}_u\in {ℝ}^{K_X}$ and ${\text{y}}_i\in {ℝ}^{K_Y}$ denote attribute vectors for rating π(u, i) (i.e., index associated with user u and item i), user u, and item i, respectively. This model learns the latent factors (${\alpha }_u\in ℝ,{\text{w}}_u\in {ℝ}^K$) to user u, (${\beta }_i\in ℝ,{\text{h}}_i\in {ℝ}^K$) to item i and ($\text{b}\in {ℝ}^{K_Z}$) to rating r_ij, such that the rating is estimated by:

$\begin{array}{ll}{\widehat{r}}_{ij}=z_{\pi (i,j)}^{\top }b+{\alpha }_u+{\beta }_i+w_u^{\top }{h}_i& (47)\end{array}$

This model assumes that α_u, β_i, w_u, and h_i follow Gaussian distribution given attributes x_u and y_i, so the model can be fitted by a Monte Carlo EM algorithm.

• Friendship-Interest Propagation (FIP)

FIP combines learned latent factors (W, H) and a given attribute matrix (X, Y) to fit user profiles and item properties. Let U be the set of users and I be the set of items. For each training example (u, i, r) ∈ O, user u ∈ U gives item i ∈ I a rating r. The objective function is as follows:

$\begin{array}{l}\underset{W,H,C}{\text{argmin}}{\displaystyle \sum _{(u,i,r)\in O}}L(r,w_u^{\top }{h}_i+x_u^{T}C{y}_i)+{\text{λ}}_C\Omega (C)\\ +{\text{λ}}_W(\Omega (W)+\Omega (w_u-A{x}_u))+{\text{λ}}_H(\Omega (H)\\ +\Omega (h_i-B{y}_i))+{\text{λ}}_A\Omega (A)+{\text{λ}}_B\Omega (B)& (48)\end{array}$

where $L(r,\widehat{r})$ is a loss function, C is a correlation matrix, A and B are the correlation matrices between attribute and latent factors, Ω(·) is a regularization term, and all of the λ with subscripts are hyperparameters. If both user and item attributes are not given, the model is then reduced to matrix factorization. Since it is often the case that a dataset contains either user or item attributes, in the experiments, if a user (or item) attribute is not given, we assume it is a vector of ones with the same dimension as item (or user).

• Factorization Machine (FM)

FM reduces the original recommendation problem into a traditional classification (or regression) problem. For example, for each observation (u, i, r) ∈ O, it can be transformed into an attribute vector x (which can be formed by representing user u and item i as two one-hot encoding vectors and concatenating them together) and a target rating r. The goal is then to fit the target value by utilizing the attribute vector. The objective function can be addressed as follows:

$\begin{array}{l}{\displaystyle \underset{w,V}{\text{argmin}}}{\displaystyle \sum _{(u,i,r)\in O}}L\left(r,w_0+{\displaystyle \sum _{i=1}^N}{w}_i{x}_i+{\displaystyle \sum _{i=1}^N}{\displaystyle \sum _{j=i+1}^D}\left({\displaystyle \sum _{k=1}^K}{v}_{ik}{v}_{jk}\right)x_i{x}_j\right)\\ +{\lambda }_w\Omega (w)+{\lambda }_V\Omega (V)& (49)\end{array}$

where w is the weight vector (w_i is its i-th element) and V ∈ ℝ^{K × N} is the latent factor matrix. This is called a factorization machine of degree 2 (or two-way factorization machine). An N-way factorization machine can be expressed as follows:

$\begin{array}{l}{\displaystyle \underset{w,V}{\text{argmin}}}{\displaystyle \sum _{(u,i,r)\in O}}L{\displaystyle (r,w_0+{\displaystyle \sum _{i=1}^N}{w}_i{x}_i}\\ {\displaystyle +{\displaystyle \sum _{l=2}^N}{\displaystyle \sum _{i_1=1}^N}{\displaystyle \sum _{i_2=i_1+1}^N}\cdots {\displaystyle \sum _{i_l=i_{l-1}+1}^N}{\displaystyle (}{\displaystyle \sum _{k=1}^K}{\displaystyle \prod _{j=1}^l}{v}_{i_{j}k}{\displaystyle )}{\displaystyle \prod _{j=1}^l}{x}_{i_j}{\displaystyle )}}\\ +{\lambda }_w\Omega (w)+{\lambda }_V\Omega (V).& (50)\end{array}$

In our experiments, only a two-way factorization machine is used as our baseline model, since it is the most frequent configuration in the experiments conducted in previous studies.

• Neural Collaborative Filtering (NCF)

NCF (Figure 17) consists of two parts: generalized matrix factorization (GMF) and multi-layer perceptron (MLP). The GMF layer computes the element-wise product of user and item latent factors. The MLP layer is a neural network that takes the concatenation of user and item latent factors as inputs and outputs a vector. The results of GMF and MLP are then concatenated as a vector and serve as the input of the NeuMF layer, which is a one-layer perceptron and outputs the predicted rating. Normally, a user/item attribute is a one-hot encoding vector that represents the user/item. However, if external attributes are provided, they can be easily modified.

• Neural Factorization Machine (NFM)

NFM is a generalization of two-way FM. While FM extracts the linear interaction between attributes, NFM is able to extract non-linear interactions with the help of a non-linear activation function in a deep neural network. The objective of NFM can be expressed as follows:

$\begin{array}{l}{\displaystyle \underset{w,V,f}{\text{argmin}}}{\displaystyle \sum _{(u,i,r)\in O}}L\left(r,w_0+{\displaystyle \sum _{i=1}^N}{w}_i{x}_i+f({\displaystyle \sum _{i=1}^N}{\displaystyle \sum _{j=i+1}^N}{x}_i{v}_i\odot x_j{v}_j)\right)\\ +{\lambda }_w\Omega (w)+{\lambda }_V\Omega (V)+{\lambda }_f\Omega (f)& (51)\end{array}$

where ⊙ is element-wise product of vectors and f is the neural network. The neural network takes second-order interactions of attribute vectors in FM as input. In fact, FM can be reduced from NFM where f is a vector of ones.

TABLE 6

Table 6. Attribute types that are used for each model.

FIGURE 17

Figure 17. Model structure of NCF.

5.1.2. Dataset

We use widely used data available online to compare the performance of the models. Here, we briefly introduce these datasets, and their statistics can be seen in Tables 7–9. For each dataset, we use the original training and testing sets if they are provided by the host. Otherwise, the training set and testing sets are split based on timestamps, where the training set represents past data and the testing set represents future ratings.

• MovieLens-1M, 10M, 20M (Harper and Konstan, 2015)

The MovieLens datasets contain ratings that users give to different movies with different numbers of ratings (i.e., 1, 10, and 20M). They also include certain user information, such as genre, age and occupation, and item information, for example, the genre of a movie and the year when the movie was produced. The training and testing sets are divided by the time that the ratings were generated. The latest-timestamped 10% ratings serve as the testing set, while the others are served as the training set.

• Netflix¹

The Netflix Prize is a competition dedicating to the design of a better movie recommendation system. The data that the host provides contain a large amount of rating instances. It also includes side information about the movies. The testing set is extracted from the probe set, which the host has provided. However, since the training set is so large that several of the models that we are testing cannot finish training in a reasonable amount of time, it is randomly sampled to one-tenth of the original size in all of our experiments.

• Yahoo Music²

Yahoo provides two music datasets (denoted by Yahoo Music 1 and 2 in our experiments) for researchers to study how users rate music products, including tracks and albums. Information such as the genre or artist of a product is provided. The data were also used in the KDD Cup 2011. Among the items being rated in the original competition (albums, tracks), we extract tracks as targets to be rated. The training and testing sets are split in the way provided by the host.

• Yelp³

The Yelp Challenge is a contest that allows participants to come up with a research topic themselves based on the given Yelp dataset. The dataset contains ratings given by users to businesses. It includes user information and item information of various types. The reviews that users give to items are also included. The training and testing sets are split in the same way as we did in the MovieLens datasets.

TABLE 7

Table 7. Basic statistics of datasets.

TABLE 8

Table 8. Attribute statistics of datasets.

TABLE 9

Table 9. Percentage of new users/items (users/items in testing data but not in training data).

5.1.3. Attribute Extraction

Most models accept real value attributes as their input. For categorical attributes, the value merely represents which category the user/item belongs to, which means that there is no physical meaning to the value. Therefore, each category is treated as a new attribute dimension. For each dimension, if the user (or item) is in this category, the value is 1, and otherwise 0 (i.e., one-hot encoding). However, categorical attributes are not used in the TF model due to its high space complexity. Since one-hot encoding significantly increases the dimensions of attributes, we find that many of the experimented models cannot finish training in a reasonable amount of time for large-scale datasets. Hence, we determine to retain only the top 100 representative transformed attributes that have the most values of 1. For the Yelp dataset, since some of its attribute values vary significantly, log(1 + x) is applied if the original attribute value x is positive, and −log(−x) is applied for negative ones. For TF, the attribute value is further rounded to the nearest integer. For the MovieLens-1M dataset, we combine user attributes with item attributes. For the Yelp dataset, we separate user, item, and rating attributes and compare the results of different combinations of these attributes. For all the other datasets, we use item attributes only.

5.1.4. Evaluation Metric

Root Mean Square Error (RMSE) [defined in (19)] is selected as the evaluation metric in our experiments. RMSE is arguably the most widely used evaluation metric for rating prediction, since most model-based collaborative filtering methods try to minimize MSE (RMSE without root) or RMSE as their objectives.

5.2. Performance Comparisons

We run seven benchmark models on seven attribute-appended rating datasets. All the empirical comparisons, evaluated with RMSE, are reported in Tables 10, 11. Note that the bold values are best performances in that caetgory among different models and the star symbol (*) indicates excessive running time or high memory usage (over 24 h or more than 64 GB memory); this usually happens when TF runs on data with a large number of features. MF and NCF are trained on ratings only. We can see that RLFM, FM, NFM, and NCF+ can outperform the basic MF models on all datasets. In general, NCF+ yields the best results among these models.

TABLE 10

Table 10. RMSE on all datasets except Yelp.

TABLE 11

Table 11. RMSE on Yelp.

5.3. Findings and Discussion

In this section, we give a brief comparison in Table 12 and discuss some findings from the experiment results in section 5.2.

• Attribute-aware models outperform their counterparts that do not incorporate attributesWe first identify two pairs of recommender systems: MF with FM and NCF with NCF+. FM can be seen as a design that incorporates attributes into MF, and the same applies for NCF+ vs. NCF. From Tables 10, 11, we can see that in most cases, attribute-aware designs (FM, NCF+) do outperform their counterparts (MF, NCF). This is intuitive, as attributes can provide additional information that benefits recommendation performance. Therefore, for each of the two pairs, attribute-aware design can achieve better performance.

• DMF and GF models perform better than GMF in general The results in Tables 10, 11 show that discriminative matrix factorization models (TF, RLFM, and NCF+) and matrix factorization generalization (FM and NFM) perform better than a generative matrix factorization design (CMF). This may be because, in addition to reconstructing a rating matrix, generative matrix factorization models have to simultaneously recover attribute matrices, which could lead to overfitting when given insufficient data.

• User attributes are more beneficial than item and rating attributesAs the dataset contains three kinds of attributes (user, item, and rating), we would focus our discussion based on the result of Table 11. RLFM, FM, and NFM are the only models that consider all three types of attributes, and it is apparent that the best result occurs when all attributes are exploited. However, if we consider three types of attribute separately, it seems that the user attributes are the most beneficial to most models. The result is expected as the goal of recommender systems is to predict user preferences regarding items. Therefore, user information should play the most important role. Rating attributes are not as effective as the others, and NCF+ can achieve top performance without using them.

TABLE 12

Table 12. Comparison between three types of models.

6. Conclusion

Collaborative filtering is arguably the most effective approach to building a recommender system. This paper introduces and compares the performance of different attribute-aware models. We believe it can benefit not only researchers in this area but also engineers intending to build a recommender system that utilizes a rich set of attributes.

Author Contributions

All authors listed have made a substantial, direct and intellectual contribution to the work, and approved it for publication.

Conflict of Interest

The authors declare that the research was conducted in the absence of any commercial or financial relationships that could be construed as a potential conflict of interest.

Footnotes

1. ^http://www.netflixprize.com/

2. ^https://webscope.sandbox.yahoo.com/

3. ^https://www.yelp.com/dataset

References

Adams, R. P., Dahl, G. E., and Murray, I. (2010). “Incorporating side information in probabilistic matrix factorization with gaussian processes,” in Proceedings of the Twenty-Sixth Conference on Uncertainty in Artificial Intelligence, UAI'10 (Arlington, VA: AUAI Press), 1–9.

Google Scholar

Adomavicius, G., and Tuzhilin, A. (2005). Toward the next generation of recommender systems: a survey of the state-of-the-art and possible extensions. IEEE Trans. Knowl. Data Eng. 17, 734–749. doi: 10.1109/TKDE.2005.99

CrossRef Full Text | Google Scholar

Adomavicius, G., and Tuzhilin, A. (2011). Context-Aware Recommender Systems. Boston, MA: Springer, 217–253.

Google Scholar

Agarwal, D., and Chen, B.-C. (2009). “Regression-based latent factor models,” in Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD '09 (New York, NY: ACM), 19–28.

Google Scholar

Baltrunas, L., Ludwig, B., and Ricci, F. (2011). “Matrix factorization techniques for context aware recommendation,” in Proceedings of the Fifth ACM Conference on Recommender Systems, RecSys '11 (New York, NY: ACM), 301–304.

Google Scholar

Barjasteh, I., Forsati, R., Masrour, F., Esfahanian, A.-H., and Radha, H. (2015). “Cold-start item and user recommendation with decoupled completion and transduction,” in Proceedings of the 9th ACM Conference on Recommender Systems, RecSys '15 (New York, NY: ACM), 91–98.

Google Scholar

Beutel, A., Chi, E. H., Cheng, Z., Pham, H., and Anderson, J. (2017). “Beyond globally optimal: focused learning for improved recommendations,” in Proceedings of the 26th International Conference on World Wide Web, WWW '17 (Geneva: International World Wide Web Conferences Steering Committee), 203–212.

Google Scholar

Beutel, A., Covington, P., Jain, S., Xu, C., Li, J., Gatto, V., et al. (2018). “Latent cross: making use of context in recurrent recommender systems,” in Proceedings of the Eleventh ACM International Conference on Web Search and Data Mining, WSDM '18 (New York, NY: ACM), 46–54.

Google Scholar

Blondel, M., Fujino, A., and Ueda, N. (2015). Convex Factorization Machines. Cham: Springer International Publishing, 19–35.

Google Scholar

Blondel, M., Ishihata, M., Fujino, A., and Ueda, N. (2016). “Polynomial networks and factorization machines: New insights and efficient training algorithms,” in Proceedings of the 33rd International Conference on International Conference on Machine Learning - Volume 48, ICML'16, 850–858. Available online at: JMLR.org

Google Scholar

Bobadilla, J., Ortega, F., Hernando, A., and GutiéRrez, A. (2013). Recommender systems survey. Knowl. Based Syst. 46, 109–132. doi: 10.1016/j.knosys.2013.03.012

CrossRef Full Text | Google Scholar

Bouchard, G., Yin, D., and Guo, S. (2013). “Convex collective matrix factorization,” in Proceedings of the Sixteenth International Conference on Artificial Intelligence and Statistics, AISTATS 2013, volume 31 of JMLR Workshop and Conference Proceedings (Scottsdale, AZ), 144–152. Available online at: JMLR.org

Google Scholar

Brouwer, T., and Liò, P. (2017). “Bayesian hybrid matrix factorisation for data integration,” in Proceedings of the 20th International Conference on Artificial Intelligence and Statistics, AISTATS 2017, volume 54 of Proceedings of Machine Learning Research, eds A. Singh and X. J. Zhu (Fort Lauderdale, FL: PMLR), 557–566.

Google Scholar

Cao, B., Zhou, H., Li, G., and Yu, P. S. (2016). “Multi-view machines,” in Proceedings of the Ninth ACM International Conference on Web Search and Data Mining, WSDM '16 (New York, NY: ACM), 427–436.

Google Scholar

Chen, C., Zheng, X., Wang, Y., Hong, F., and Lin, Z. (2014). “Context-aware collaborative topic regression with social matrix factorization for recommender systems,” in Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, AAAI'14 (Québec City, QC: AAAI Press), 9–15.

Google Scholar

Chen, T., Li, H., Yang, Q., and Yu, Y. (2013). “General functional matrix factorization using gradient boosting,” in Proceedings of the 30th International Conference on International Conference on Machine Learning - Volume 28, ICML'13, 436–444. Available online at: JMLR.org

Google Scholar

Chen, T., Sun, Y., Shi, Y., and Hong, L. (2017). “On sampling strategies for neural network-based collaborative filtering,” in Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD '17 (New York, NY: ACM), 767–776.

Google Scholar

Chen, T., Zhang, W., Lu, Q., Chen, K., Zheng, Z., and Yu, Y. (2012). Svdfeature: a toolkit for feature-based collaborative filtering. J. Mach. Learn. Res. 13, 3619–3622.

Google Scholar

Chen, X., Qin, Z., Zhang, Y., and Xu, T. (2016). “Learning to rank features for recommendation over multiple categories,” in Proceedings of the 39th International ACM SIGIR Conference on Research and Development in Information Retrieval, SIGIR '16 (New York, NY: ACM), 305–314.

Google Scholar

Cheng, C., Xia, F., Zhang, T., King, I., and Lyu, M. R. (2014). “Gradient boosting factorization machines,” in Proceedings of the 8th ACM Conference on Recommender Systems, RecSys '14 (New York, NY: ACM), 265–272.

Google Scholar

Chin, W.-S., Yuan, B.-W., Yang, M.-Y., Zhuang, Y., Juan, Y.-C., and Lin, C.-J. (2016). Libmf: a library for parallel matrix factorization in shared-memory systems. J. Mach. Learn. Res. 17, 2971–2975.

Google Scholar

Chou, S.-Y., Yang, Y.-H., Jang, J.-S. R., and Lin, Y.-C. (2016). “Addressing cold start for next-song recommendation,” in Proceedings of the 10th ACM Conference on Recommender Systems, RecSys '16 (New York, NY: ACM), 115–118.

Google Scholar

Dong, X., Yu, L., Wu, Z., Sun, Y., Yuan, L., and Zhang, F. (2017). “A hybrid collaborative filtering model with deep structure for recommender systems,” in Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, eds S. P. Singh and S. Markovitch (San Francisco, CA: AAAI Press), 1309–1315.

Google Scholar

Du, L., Li, X., and Shen, Y.-D. (2011). “User graph regularized pairwise matrix factorization for item recommendation,” in Proceedings of the 7th International Conference on Advanced Data Mining and Applications - Volume Part II, ADMA'11 (Berlin; Heidelberg: Springer-Verlag), 372–385.

Google Scholar

Fang, Y., and Si, L. (2011). “Matrix co-factorization for recommendation with rich side information and implicit feedback,” in Proceedings of the 2nd International Workshop on Information Heterogeneity and Fusion in Recommender Systems, HetRec '11 (New York, NY: ACM), 65–69.

Google Scholar

Feipeng Zhao, Y. G. (2017). “Learning discriminative recommendation systems with side information,” in Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, IJCAI-17 (Melbourne, VIC), 3469–3475.

Google Scholar

Gantner, Z., Drumond, L., Freudenthaler, C., Rendle, S., and Schmidt-Thieme, L. (2010). “Learning attribute-to-feature mappings for cold-start recommendations,” in Proceedings of the 2010 IEEE International Conference on Data Mining, ICDM '10 (Washington, DC: IEEE Computer Society), 176–185.

Google Scholar

Gao, H., Tang, J., Hu, X., and Liu, H. (2015). “Content-aware point of interest recommendation on location-based social networks,” in Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, AAAI'15 (Austin, TX: AAAI Press), 1721–1727.

Google Scholar

Ge, H., Caverlee, J., and Lu, H. (2016). “Taper: a contextual tensor-based approach for personalized expert recommendation,” in Proceedings of the 10th ACM Conference on Recommender Systems, RecSys '16 (New York, NY: ACM), 261–268.

Google Scholar

Gönen, M., Khan, S. A., and Kaski, S. (2013). “Kernelized bayesian matrix factorization,” in Proceedings of the 30th International Conference on International Conference on Machine Learning - Volume 28, ICML'13, III864–III872. Available online at: JMLR.org

Google Scholar

Gu, Q., Zhou, J., and Ding, C. H. Q. (2010). “Collaborative filtering: weighted nonnegative matrix factorization incorporating user and item graphs,” in Proceedings of the SIAM International Conference on Data Mining, SDM 2010 (Columbus, OH: SIAM), 199–210.

Google Scholar

Gunawardana, A., and Meek, C. (2008). “Tied boltzmann machines for cold start recommendations,” in Proceedings of the 2008 ACM Conference on Recommender Systems, RecSys '08 (New York, NY: ACM), 19–26.

Google Scholar

Gunawardana, A., and Meek, C. (2009). “A unified approach to building hybrid recommender systems,” in Proceedings of the Third ACM Conference on Recommender Systems, RecSys '09 (New York, NY: ACM), 117–124.

Google Scholar

Guo, H., Tang, R., Ye, Y., Li, Z., and He, X. (2017). “Deepfm: a factorization-machine based neural network for CTR prediction,” in Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, IJCAI 2017, ed C. Sierra (Melbourne, VIC), 1725–1731. Available online at: ijcai.org

Google Scholar

Guo, Y. (2017). “Convex co-embedding for matrix completion with predictive side information,” in Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, eds S. P. Singh and S. Markovitch (San Francisco, CA: AAAI Press), 1955–1961.

Google Scholar

Harper, F. M., and Konstan, J. A. (2015). The movielens datasets: history and context. ACM Trans. Interact. Intell. Syst. 5, 19:1–19:19. doi: 10.1145/2827872

CrossRef Full Text | Google Scholar

He, R., and McAuley, J. (2016). “Vbpr: Visual bayesian personalized ranking from implicit feedback,” in Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, AAAI'16 (Phoenix, AZ: AAAI Press), 144–150.

Google Scholar

He, X., and Chua, T.-S. (2017). “Neural factorization machines for sparse predictive analytics,” in Proceedings of the 40th International ACM SIGIR Conference on Research and Development in Information Retrieval, SIGIR '17 (New York, NY: ACM), 355–364.

Google Scholar

He, X., Du, X., Wang, X., Tian, F., Tang, J., and Chua, T.-S. (2018). “Outer product-based neural collaborative filtering,” in IJCAI (Stockholm).

Google Scholar

He, X., Liao, L., Zhang, H., Nie, L., Hu, X., and Chua, T.-S. (2017). “Neural collaborative filtering,” in Proceedings of the 26th International Conference on World Wide Web, WWW '17 (Geneva: International World Wide Web Conferences Steering Committee), 173–182.

Google Scholar

Hidasi, B. (2015). “Context-aware preference modeling with factorization,” in Proceedings of the 9th ACM Conference on Recommender Systems, RecSys '15 (New York, NY: ACM), 371–374.

Google Scholar

Hidasi, B., and Tikk, D. (2012). “Fast als-based tensor factorization for context-aware recommendation from implicit feedback,” in Proceedings of the 2012 European Conference on Machine Learning and Knowledge Discovery in Databases - Volume Part II, ECML PKDD'12 (Berlin; Heidelberg: Springer-Verlag), 67–82.

Google Scholar

Hidasi, B., and Tikk, D. (2016). General factorization framework for context-aware recommendations. Data Min. Knowl. Discov. 30, 342–371. doi: 10.1007/s10618-015-0417-y

CrossRef Full Text | Google Scholar

Hsieh, C.-K., Yang, L., Cui, Y., Lin, T.-Y., Belongie, S., and Estrin, D. (2017). “Collaborative metric learning,” in Proceedings of the 26th International Conference on World Wide Web, WWW '17 (Geneva: International World Wide Web Conferences Steering Committee), 193–201.

Google Scholar

Hu, L., Sun, A., and Liu, Y. (2014). “Your neighbors affect your ratings: on geographical neighborhood influence to rating prediction,” in Proceedings of the 37th International ACM SIGIR Conference on Research and Development in Information Retrieval, SIGIR '14 (New York, NY: ACM), 345–354.

Google Scholar

Isinkaye, F., Folajimi, Y., and Ojokoh, B. (2015). Recommendation systems: principles, methods and evaluation. Egypt. Inform. J. 16, 261–273. doi: 10.1016/j.eij.2015.06.005

CrossRef Full Text | Google Scholar

Jamali, M., and Lakshmanan, L. (2013). “Heteromf: Recommendation in heterogeneous information networks using context dependent factor models,” in Proceedings of the 22nd International Conference on World Wide Web, WWW '13 (New York, NY: ACM), 643–654.

Google Scholar

Ji, K., Shen, H., Tian, H., Wu, Y., and Wu, J. (2014). Two-Phase Layered Learning Recommendation via Category Structure. Cham: Springer International Publishing, 13–24.

Google Scholar

Jiang, Z., Liu, H., Fu, B., Wu, Z., and Zhang, T. (2018). “Recommendation in heterogeneous information networks based on generalized random walk model and bayesian personalized ranking,” in Proceedings of the Eleventh ACM International Conference on Web Search and Data Mining, WSDM '18 (New York, NY: ACM), 288–296.

Google Scholar

Juan, Y., Zhuang, Y., Chin, W.-S., and Lin, C.-J. (2016). “Field-aware factorization machines for ctr prediction,” in Proceedings of the 10th ACM Conference on Recommender Systems, RecSys '16 (New York, NY: ACM), 43–50.

Google Scholar

Karatzoglou, A., Amatriain, X., Baltrunas, L., and Oliver, N. (2010). “Multiverse recommendation: N-dimensional tensor factorization for context-aware collaborative filtering,” in Proceedings of the Fourth ACM Conference on Recommender Systems, RecSys '10 (New York, NY: ACM), 79–86.

Google Scholar

Kasai, H., and Mishra, B. (2016). “Low-rank tensor completion: A riemannian manifold preconditioning approach,” in Proceedings of the 33rd International Conference on International Conference on Machine Learning - Volume 48, ICML'16, 1012–1021. Available online at: JMLR.org

Google Scholar

Kim, Y., and Choi, S. (2014). “Scalable variational bayesian matrix factorization with side information,” in Proceedings of the Seventeenth International Conference on Artificial Intelligence and Statistics, AISTATS 2014, volume 33 of JMLR Workshop and Conference Proceedings (Reykjavik), 493–502. Available online at: JMLR.org

Google Scholar

Koenigstein, N., Dror, G., and Koren, Y. (2011). “Yahoo! music recommendations: modeling music ratings with temporal dynamics and item taxonomy,” in Proceedings of the Fifth ACM Conference on Recommender Systems, RecSys '11 (New York, NY: ACM), 165–172.

Google Scholar

Koenigstein, N., and Paquet, U. (2013). “Xbox movies recommendations: variational bayes matrix factorization with embedded feature selection,” in Proceedings of the 7th ACM Conference on Recommender Systems, RecSys '13 (New York, NY: ACM), 129–136.

Google Scholar

Koren, Y., and Bell, R. (2011). Advances in Collaborative Filtering. Boston, MA: Springer, 145–186.

Google Scholar

Koren, Y., Bell, R., and Volinsky, C. (2009). Matrix factorization techniques for recommender systems. Computer 42, 30–37. doi: 10.1109/MC.2009.263

CrossRef Full Text | Google Scholar

Kula, M. (2015). “Metadata embeddings for user and item cold-start recommendations,” in Proceedings of the 2nd Workshop on New Trends on Content-Based Recommender Systems co-located with 9th ACM Conference on Recommender Systems (RecSys 2015), volume 1448 of CEUR Workshop Proceedings (Vienna), eds T. Bogers and M. Koolen, 14–21. Available online at: CEUR-WS.org

Google Scholar

Lee, D., Park, S. E., Kahng, M., Lee, S., and Lee, S.-G. (2010). Exploiting Contextual Information from Event Logs for Personalized Recommendation. Berlin; Heidelberg: Springer, 121–139.

Google Scholar

Lee, S., Song, S.-i., Kahng, M., Lee, D., and Lee, S.-g. (2011). “Random walk based entity ranking on graph for multidimensional recommendation,” in Proceedings of the Fifth ACM Conference on Recommender Systems, RecSys '11 (New York, NY: ACM), 93–100.

Google Scholar

Li, S., Kawale, J., and Fu, Y. (2015). “Deep collaborative filtering via marginalized denoising auto-encoder,” in Proceedings of the 24th ACM International on Conference on Information and Knowledge Management, CIKM '15 (New York, NY: ACM), 811–820.

Google Scholar

Li, X., and She, J. (2017). “Collaborative variational autoencoder for recommender systems,” in Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD '17 (New York, NY: ACM), 305–314.

Google Scholar

Li, Y., Hu, J., Zhai, C., and Chen, Y. (2010a). “Improving one-class collaborative filtering by incorporating rich user information,” in Proceedings of the 19th ACM International Conference on Information and Knowledge Management, CIKM '10 (New York, NY: ACM), 959–968.

Google Scholar

Li, Y., Nie, J., Zhang, Y., Wang, B., Yan, B., and Weng, F. (2010b). “Contextual recommendation based on text mining,” in Proceedings of the 23rd International Conference on Computational Linguistics: Posters, COLING '10 (Stroudsburg, PA: Association for Computational Linguistics), 692–700.

Google Scholar

Liu, X., and Aberer, K. (2013). “Soco: a social network aided context-aware recommender system,” in Proceedings of the 22nd International Conference on World Wide Web, WWW '13 (New York, NY: ACM), 781–802.

Google Scholar

Liu, X., and Wu, W. (2015). “Learning context-aware latent representations for context-aware collaborative filtering,” in Proceedings of the 38th International ACM SIGIR Conference on Research and Development in Information Retrieval, SIGIR '15 (New York, NY: ACM), 887–890.

Google Scholar

Lu, C.-T., He, L., Shao, W., Cao, B., and Yu, P. S. (2017). “Multilinear factorization machines for multi-task multi-view learning,” in Proceedings of the Tenth ACM International Conference on Web Search and Data Mining, WSDM '17 (New York, NY: ACM), 701–709.

Google Scholar

Lu, J., Liang, G., Sun, J., and Bi, J. (2016). “A sparse interactive model for matrix completion with side information,” in Advances in Neural Information Processing Systems 29: Annual Conference on Neural Information Processing Systems 2016, eds D. D. Lee, M. Sugiyama, U. von Luxburg, I. Guyon, and R. Garnett (Barcelona), 4071–4079.

Google Scholar

Lu, K., Zhang, G., Li, R., Zhang, S., and Wang, B. (2012). Exploiting and Exploring Hierarchical Structure in Music Recommendation. Berlin; Heidelberg: Springer, 211–225.

Google Scholar

Ma, H., Zhou, D., Liu, C., Lyu, M. R., and King, I. (2011a). “Recommender systems with social regularization, in Proceedings of the Fourth ACM International Conference on Web Search and Data Mining, WSDM '11 (New York, NY: ACM), 287–296.

Google Scholar

Ma, H., Zhou, T. C., Lyu, M. R., and King, I. (2011b). Improving recommender systems by incorporating social contextual information. ACM Trans. Inform. Syst. 29, 9:1–9:23. doi: 10.1145/1961209.1961212

CrossRef Full Text | Google Scholar

Menon, A. K., Chitrapura, K.-P., Garg, S., Agarwal, D., and Kota, N. (2011). “Response prediction using collaborative filtering with hierarchies and side-information,” in Proceedings of the 17th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD '11 (New York, NY: ACM), 141–149.

Google Scholar

Menon, A. K., and Elkan, C. (2010). “A log-linear model with latent features for dyadic prediction,” in Proceedings of the 2010 IEEE International Conference on Data Mining, ICDM '10 (Washington, DC: IEEE Computer Society), 364–373.

Google Scholar

Nandanwar, S., Moroney, A., and Murty, M. N. (2018). “Fusing diversity in recommendations in heterogeneous information networks,” in Proceedings of the Eleventh ACM International Conference on Web Search and Data Mining, WSDM '18 (New York, NY: ACM), 414–422.

Google Scholar

Natarajan, N., and Dhillon, I. S. (2014). Inductive matrix completion for predicting gene—disease associations. Bioinformatics 30, i60–i68. doi: 10.1093/bioinformatics/btu269

PubMed Abstract | CrossRef Full Text | Google Scholar

Nguyen, T. V., Karatzoglou, A., and Baltrunas, L. (2014). “Gaussian process factorization machines for context-aware recommendations” in Proceedings of the 37th International ACM SIGIR Conference on Research and Development in Information Retrieval, SIGIR '14 (New York, NY: ACM), 63–72.

Google Scholar

Ning, X., and Karypis, G. (2012). “Sparse linear methods with side information for top-n recommendations,” in Proceedings of the Sixth ACM Conference on Recommender Systems, RecSys '12 (New York, NY: ACM), 155–162.

Google Scholar

Palumbo, E., Rizzo, G., and Troncy, R. (2017). “Entity2rec: learning user-item relatedness from knowledge graphs for top-n item recommendation,” in Proceedings of the Eleventh ACM Conference on Recommender Systems, RecSys '17 (New York, NY: ACM), 32–36.

Google Scholar

Park, S., Kim, Y.-D., and Choi, S. (2013). “Hierarchical bayesian matrix factorization with side information,” in Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence, IJCAI '13 (Beijing: AAAI Press), 1593–1599.

Google Scholar

Paterek, A. (2007). Improving Regularized Singular Value Decomposition for Collaborative Filtering. Available online at: https://www.cs.uic.edu/~liub/KDD-cup-2007/proceedings/Regular-Paterek.pdf

Google Scholar

Pham, T.-A. N., Li, X., Cong, G., and Zhang, Z. (2016). A general recommendation model for heterogeneous networks. IEEE Trans. Knowl. Data Eng. 28, 3140–3153. doi: 10.1109/TKDE.2016.2601091

CrossRef Full Text | Google Scholar

Porteous, I., Asuncion, A., and Welling, M. (2010). “Bayesian matrix factorization with side information and dirichlet process mixtures,” in Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence, AAAI'10 (Atlanta, GA: AAAI Press), 563–568.

Google Scholar

Rendle, S., Freudenthaler, C., Gantner, Z., and Schmidt-Thieme, L. (2009). “Bpr: Bayesian personalized ranking from implicit feedback,” in Proceedings of the Twenty-Fifth Conference on Uncertainty in Artificial Intelligence, UAI '09 (Arlington, VA: AUAI Press), 452–461.

Google Scholar

Rendle, S., Gantner, Z., Freudenthaler, C., and Schmidt-Thieme, L. (2011). “Fast context-aware recommendations with factorization machines,” in Proceedings of the 34th International ACM SIGIR Conference on Research and Development in Information Retrieval, SIGIR '11 (New York, NY: ACM), 635–644.

Google Scholar

Safoury, L., and Salah, A. (2013). Exploiting user demographic attributes for solving cold-start problem in recommender system. Lect. Notes Softw. Eng. 1:303.

Google Scholar

Salakhutdinov, R., and Mnih, A. (2007). “Probabilistic matrix factorization,” in Proceedings of the 20th International Conference on Neural Information Processing Systems, NIPS'07 (Vancouver, BC: Curran Associates Inc), 1257–1264.

Google Scholar

Salakhutdinov, R., and Mnih, A. (2008). “Bayesian probabilistic matrix factorization using markov chain monte carlo,” in Proceedings of the 25th International Conference on Machine Learning, ICML '08 (New York, NY: ACM), 880–887.

Google Scholar

Saveski, M., and Mantrach, A. (2014). “Item cold-start recommendations: learning local collective embeddings,” in Proceedings of the 8th ACM Conference on Recommender Systems, RecSys '14 (New York, NY: ACM), 89–96.

Google Scholar

Sedhain, S., Menon, A. K., Sanner, S., Xie, L., and Braziunas, D. (2017). “Low-rank linear cold-start recommendation from social data,” in Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, eds S. P. Singh and S. Markovitch (San Francisco, CA: AAAI Press), 1502–1508.

Google Scholar

Sedhain, S., Sanner, S., Braziunas, D., Xie, L., and Christensen, J. (2014). “Social collaborative filtering for cold-start recommendations,” in Proceedings of the 8th ACM Conference on Recommender Systems, RecSys '14 (New York, NY: ACM), 345–348.

Google Scholar

Shan, H., and Banerjee, A. (2010). “Generalized probabilistic matrix factorizations for collaborative filtering,” in Proceedings of the 2010 IEEE International Conference on Data Mining, ICDM '10 (Washington, DC: IEEE Computer Society), 1025–1030.

Google Scholar

Shi, Y., Karatzoglou, A., Baltrunas, L., Larson, M., and Hanjalic, A. (2014a). “Cars2: learning context-aware representations for context-aware recommendations,” in Proceedings of the 23rd ACM International Conference on Information and Knowledge Management, CIKM '14 (New York, NY: ACM), 291–300.

Google Scholar

Shi, Y., Karatzoglou, A., Baltrunas, L., Larson, M., Hanjalic, A., and Oliver, N. (2012a). “Tfmap: optimizing map for top-n context-aware recommendation,” in Proceedings of the 35th International ACM SIGIR Conference on Research and Development in Information Retrieval, SIGIR '12 (New York, NY: ACM), 155–164.

Google Scholar

Shi, Y., Karatzoglou, A., Baltrunas, L., Larson, M., Oliver, N., and Hanjalic, A. (2012b). “Climf: learning to maximize reciprocal rank with collaborative less-is-more filtering,” in Proceedings of the Sixth ACM Conference on Recommender Systems, RecSys '12 (New York, NY: ACM), 139–146.

Google Scholar

Shi, Y., Larson, M., and Hanjalic, A. (2014b). Collaborative filtering beyond the user-item matrix: a survey of the state of the art and future challenges. ACM Comput. Surv. 47, 3:1–3:45. doi: 10.1145/2556270

CrossRef Full Text | Google Scholar

Shin, D., Cetintas, S., Lee, K.-C., and Dhillon, I. S. (2015). “Tumblr blog recommendation with boosted inductive matrix completion,” in Proceedings of the 24th ACM International Conference on Information and Knowledge Management, CIKM '15 (New York, NY: ACM), 203–212.

Google Scholar

Shin, D., Lee, J.-w., Yeon, J., and Lee, S.-g. (2009). “Context-aware recommendation by aggregating user context,” in Proceedings of the 2009 IEEE Conference on Commerce and Enterprise Computing, CEC '09 (Washington, DC: IEEE Computer Society), 423–430.

Google Scholar

Singh, A. P., and Gordon, G. J. (2008). “Relational learning via collective matrix factorization,” in Proceedings of the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD '08 (New York, NY: ACM), 650–658.

Google Scholar

Stern, D., Herbrich, R., and Graepel, T. (2009). “Matchbox: Large scale bayesian recommendations,” in Proceedings of the 18th International World Wide Web Conference (Madrid).

Google Scholar

Sun, Y., Han, J., Yan, X., Yu, P. S., and Wu, T. (2011). Pathsim: meta path-based top-k similarity search in heterogeneous information networks. PVLDB 4, 992–1003.

Google Scholar

Taylor, M., Guiver, J., Robertson, S., and Minka, T. (2008). “Softrank: optimizing non-smooth rank metrics,” in Proceedings of the 2008 International Conference on Web Search and Data Mining, WSDM '08 (New York, NY: ACM), 77–86.

Google Scholar

Verbert, K., Manouselis, N., Ochoa, X., Wolpers, M., Drachsler, H., Bosnic, I., et al. (2012). Context-aware recommender systems for learning: a survey and future challenges. IEEE Trans. Learn. Technol. 5, 318–335. doi: 10.1109/TLT.2012.11

CrossRef Full Text | Google Scholar

Wang, C., and Blei, D. M. (2011). “Collaborative topic modeling for recommending scientific articles,” in Proceedings of the 17th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD '11 (New York, NY: ACM), 448–456.

Google Scholar

Wang, H., Shi, X., and Yeung, D. (2016). “Collaborative recurrent autoencoder: recommend while learning to fill in the blanks,” in Advances in Neural Information Processing Systems 29: Annual Conference on Neural Information Processing Systems 2016, eds D. D. Lee, M. Sugiyama, U. von Luxburg, I. Guyon, and R. Garnett (Barcelona), 415–423.

Google Scholar

Wang, H., Wang, N., and Yeung, D.-Y. (2015). “Collaborative deep learning for recommender systems,” in Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD '15 (New York, NY: ACM), 1235–1244.

Google Scholar

Weng, S.-S., Lin, B., and Chen, W.-T. (2009). Using contextual information and multidimensional approach for recommendation. Expert Syst. Appl. 36, 1268–1279. doi: 10.1016/j.eswa.2007.11.056

CrossRef Full Text | Google Scholar

Weston, J., Wang, C., Weiss, R. J., and Berenzweig, A. (2012). “Latent collaborative retrieval,” in Proceedings of the 29th International Conference on Machine Learning, ICML 2012 (Edinburgh: icml.cc/Omnipress).

Google Scholar

Xu, M., Jin, R., and Zhou, Z.-H. (2013). “Speedup matrix completion with side information: Application to multi-label learning,” in Proceedings of the 26th International Conference on Neural Information Processing Systems, NIPS'13 (Lake Tahoe, NV: Curran Associates Inc), 2301–2309.

Google Scholar

Yang, J., Sun, Z., Bozzon, A., and Zhang, J. (2016). “Learning hierarchical feature influence for recommendation by recursive regularization,” in Proceedings of the 10th ACM Conference on Recommender Systems, RecSys '16 (New York, NY: ACM), 51–58.

Google Scholar

Yang, S.-H., Long, B., Smola, A., Sadagopan, N., Zheng, Z., and Zha, H. (2011). “Like like alike: joint friendship and interest propagation in social networks,” in Proceedings of the 20th International Conference on World Wide Web, WWW '11 (New York, NY: ACM), 537–546.

Google Scholar

Yoo, J., and Choi, S. (2009). “Weighted nonnegative matrix co-tri-factorization for collaborative prediction,” in Proceedings of the 1st Asian Conference on Machine Learning: Advances in Machine Learning, ACML '09 (Berlin; Heidelberg: Springer-Verlag), 396–411.

Google Scholar

Yoo, J., and Choi, S. (2011). “Bayesian matrix co-factorization: variational algorithm and cramér-rao bound,” in Proceedings of the 2011th European Conference on Machine Learning and Knowledge Discovery in Databases - Volume Part III, ECMLPKDD'11 (Berlin; Heidelberg: Springer-Verlag), 537–552.

Google Scholar

Yoo, J., and Choi, S. (2012). “Hierarchical variational bayesian matrix co-factorization,” in 2012 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP) (Kyoto), 1901–1904.

Google Scholar

Yu, H., Huang, H., Dhillon, I. S., and Lin, C. (2017). “A unified algorithm for one-cass structured matrix factorization with side information,;; in Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, eds S. P. Singh and S. Markovitch (San Francisco, CA: AAAI Press), 2845–2851.

Google Scholar

Yu, X., Ren, X., Sun, Y., Gu, Q., Sturt, B., Khandelwal, U., et al. (2014). “Personalized entity recommendation: A heterogeneous information network approach,” in Proceedings of the 7th ACM International Conference on Web Search and Data Mining, WSDM '14 (New York, NY: ACM), 283–292.

Google Scholar

Zhang, F., Yuan, N. J., Lian, D., Xie, X., and Ma, W.-Y. (2016). “Collaborative knowledge base embedding for recommender systems,” in Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD '16 (New York, NY: ACM), 353–362.

Google Scholar

Zhang, M., Tang, J., Zhang, X., and Xue, X. (2014). “Addressing cold start in recommender systems: a semi-supervised co-training algorithm,” in Proceedings of the 37th International ACM SIGIR Conference on Research and Development in Information Retrieval, SIGIR '14 (New York, NY: ACM), 73–82.

Google Scholar

Zhang, S. Y., Yao, L., Sun, A., and Tay, Y. (2017). Deep learning based recommender system: a survey and new perspectives. ArXiv, abs/1707.07435.

Google Scholar

Zhang, Y., Yin, H., Huang, Z., Du, X., Yang, G., and Lian, D. (2018). “Discrete deep learning for fast content-aware recommendation,” in Proceedings of the Eleventh ACM International Conference on Web Search and Data Mining, WSDM '18 (New York, NY: ACM), 717–726.

Google Scholar

Zhao, F., Xiao, M., and Guo, Y. (2016). “Predictive collaborative filtering with side information,” in Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, IJCAI'16 (New York, NY: AAAI Press), 2385–2390.

Google Scholar

Zhao, Q., Shi, Y., and Hong, L. (2017). “Gb-cent: Gradient boosted categorical embedding and numerical trees,” in Proceedings of the 26th International Conference on World Wide Web, WWW '17 (Geneva: International World Wide Web Conferences Steering Committee), 1311–1319.

Google Scholar

Zheng, J., Liu, J., Shi, C., Zhuang, F., Li, J., and Wu, B. (2016). “Dual similarity regularization for recommendation,” in Proceedings, Part II, of the 20th Pacific-Asia Conference on Advances in Knowledge Discovery and Data Mining - Volume 9652, PAKDD 2016 (New York, NY: Springer-Verlag New York, Inc), 542–554.

Google Scholar

Zhou, C., Bai, J., Song, J., Liu, X., Zhao, Z., Chen, X., et al. (2017). Atrank: zn attention-based user behavior modeling framework for recommendation. arXiv [preprint]. arXiv:1711.06632.

Google Scholar

Zhou, T., Qian, H., Shen, Z., Zhang, C., and Xu, C. (2017). “Tensor completion with side information: A riemannian manifold approach,” in Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, IJCAI-17 (Melbourne, VIC), 3539–3545.

Google Scholar

Zhou, T., Shan, H., Banerjee, A., and Sapiro, G. (2012). “Kernelized probabilistic matrix factorization: exploiting graphs and side information,” in Proceedings of the Twelfth SIAM International Conference on Data Mining (Anaheim, CA: SIAM/Omnipress), 403–414.

Google Scholar