---
title: "Explainable Recommendation via Interpretable Feature Mapping and Evaluation of Explainability"
authors:
  - "Deng Pan"
  - "Xiangrui Li"
  - "Xin Li"
  - "Dongxiao Zhu"
doi: "10.24963/ijcai.2020/373"
url: "https://ijcai.org/proceedings/2020/373"
pdf: "https://ijcai.org/proceedings/2020/0373.pdf"
venue: "Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence"
year: 2020
pages: "2690-2696"
track: "Main track"
keywords:
  - "Machine Learning: Recommender Systems"
  - "Machine Learning: Interpretability"
  - "Machine Learning: Explainable Machine Learning"
---

# Explainable Recommendation via Interpretable Feature Mapping and Evaluation of Explainability

Deng Pan, Xiangrui Li, Xin Li, Dongxiao Zhu

*Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence*, pages 2690-2696. DOI: [10.24963/ijcai.2020/373](https://doi.org/10.24963/ijcai.2020/373)

## Abstract

Latent factor collaborative filtering (CF) has been a widely used technique for recommender system by learning the semantic representations of users and items. Recently, explainable recommendation has attracted much attention from research community. However, trade-off exists between explainability and performance of the recommendation where metadata is often needed to alleviate the dilemma. We present a novel feature mapping approach that maps the uninterpretable general features onto the interpretable aspect features, achieving both satisfactory
accuracy and explainability in the recommendations by simultaneous minimization of rating prediction loss and interpretation loss. To evaluate
the explainability, we propose two new evaluation metrics specifically designed for aspect-level explanation using surrogate ground truth. Experimental results demonstrate a strong performance in both recommendation and explaining explanation, eliminating the need for metadata. Code is available from https://github.com/pd90506/AMCF.

## Full text

## 1 Introduction

Since the inception of the Netflix Prize competition, latent factor collaborative filtering (CF) has been continuously adopted by various recommendation tasks due to its strong performance over other methods [Koren et al., 2009], which essentially employs a latent factor model such as matrix factorization and/or neural networks to learn user or item feature representations for rendering recommendations. Despite much success, latent factor CF approaches often suffer from the lack of interpretability [Zhang and Chen, 2018]. In a contemporary recommender system, explaining why a user likes an item can be as important as the accuracy of the rating prediction itself [Zhang and Chen, 2018].

Explainable recommendation can improve transparency, persuasiveness and trustworthiness of the system [Zhang et al., 2019]. To make intuitive explanation for recommendations, recent efforts have been focused on using metadata such as user defined tags and topics from user review texts or item descriptions[Lu et al., 2018; Chen et al., 2018] to illuminate users preferences. Other works such as [Hou et al., 2019; He et al., 2015; Zhang et al., 2014] use aspects to explain recommendations. Although these approaches can explain recommendation using external metadata, the interpretability of the models themselves and the interpretable features enabling the explainable recommendations have still not been systematically studied and thus, are poorly understood. It is also worth mentioning that the challenges in explainable recommendation not only lie in the modeling itself, but also in the lack of a gold standard for evaluation of explainability.

∗Corresponding author

Here we propose a novel feature mapping strategy that not only enjoys the advantages of strong performance in latent factor models but also is capable of providing explainability via interpretable features. The main idea is that by mapping the general features learned using a base latent factor model onto interpretable aspect features, one could explain the outputs using the aspect features without compromising the recommendation performance of the base latent factor model. We also propose two new metrics for evaluating the quality of explanations in terms of a user's general preference over all items and the aspect preference to a specific item. Simply put, we formulate the problem as: 1) how to find the interpretable aspect basis; 2) how to perform interpretable feature mapping; and 3) how to evaluate explanations.

We summarize our main contributions as follows: 1) We propose a novel feature mapping approach to map the general uninterpretable features to interpretable aspect features, enabling explainability of the traditional latent factor models without metadata; 2) Borrowing strength across aspects, our approach is capable of alleviating the trade-off between

propose new schemes for evaluating the quality of explanations in terms of both general user preference and specific user preference.

## 2 RelatedWork

There are varieties of strategies for rendering explainable recommendations. We first review methods that give explanations in light of aspects, which are closely related to our work. We then discuss other recent explainable recommendation works using metadata and knowledge in lieu of aspects.

## 2.1 Aspect Based Explainable Recommendation

Aspects can be viewed as explicit features of an item that could provide useful information in recommender systems. An array of approaches have been developed to render explainable recommendations at the aspect level using metadata such as user reviews. These approaches mostly fall into three categories: 1) Graph-based approaches: they incorporate aspects as additional nodes in the user-item bipartite graph. For example, TriRank [He et al., 2015] extract aspects from user reviews and form a user-item-aspect tripartite graph with smoothness constraints, achieving a review-aware top-N recommendation. ReEL [Baral et al., 2018] calculate useraspect bipartite from location-aspect bipartite graphs, which infer user preferences. 2) Approaches with aspects as regularizations or priors: they use the extracted aspects as additional regularizations for the factorization models. For example, AMF [Hou et al., 2019] construct an additional useraspect matrix and an item-aspect matrix from review texts, as regularizations for the original matrix factorization models. JMARS [Diao et al., 2014] generalize probabilistic matrix factorization by incorporating user-aspect and movie-aspect priors, enhancing recommendation quality by jointly modeling aspects, ratings and sentiments from review texts. 3) Approaches with aspects as explicit factors: other than regularizing the factorization models, aspects can also be used as factors themselves. [Zhang et al., 2014] propose an explicit factor model (EMF) that factorizes a rating matrix in terms of both predefined explicit features (i.e. aspects) as well as implicit features, rendering aspect-based explanations. Similarly, [Chen et al., 2016] extend EMF by applying tensor factorization on a more complex user-item-feature tensor.

## 2.2 Beyond Aspect Explanation

There are also other approaches that don't utilize aspects to explain recommendations. For example, [Lee and Jung, 2018] give explanations in light of the movie similarities defined using movie characters and their interactions; [Wang et al., 2019] propose explainable recommendations by exploiting knowledge graphs where paths are used to infer the underlying rationale of user-item interactions. With the increasingly available textual data from users and merchants, more approaches have been developed for explainable recommendation using metadata. For example, [Chen et al., 2019b; Costa et al., 2018; Lu et al., 2018] attempt to generate textual explanations directly whereas [Wu et al., 2019; Chen et al., 2019a] give explanations by highlighting the most important words/phrases in the original reviews.

Overall, most of the approaches discussed in this section rely on metadata and/or external knowledge to give explanations without interpreting the model itself. In contrast, our Attentive Multitask Collaborative Filtering (AMCF) approach maps uninterpretable general features to interpretable aspect features using an existing aspect definition, as such it not only gives explanations for users, but also learns interpretable features for the modelers. Moreover, it is possible to adopt any latent factor models as the base model to derive the general features for the proposed feature mapping approach.

## 3 The Proposed AMCFModel

In this section, we first introduce the problem formulation and the underlying assumptions. We then present our AMCF approach for explainable recommendations. AMCF incorporates aspect information and maps the latent features of items to the aspect feature space using an attention mechanism. With this mapping, we can explain recommendations of AMCF from the aspect perspective. An Aspect s [Bauman et al., 2017] is an attribute that characterizes an item. Assuming there are totally m aspects in consideration, if an item has aspects si1 , ..., sik simultaneously, an item can then be described by Ii = {si1 , si2 , ..., sik }, k ≤ m. We say that an item i has aspect sj, if sj ∈ Ii.

## 3.1 ProblemFormulation

Inputs. The inputs consist of 3 parts: the set of users U, the set of items V , and the set of corresponding multi-hot aspect vectors for items, denoted by S.

Outputs. Given the user-item-aspect triplet, e.g. user i, item j, and aspect multi-hot vector sj for item j, our model not only predicts the review rating, but also the user general preference over all items and the user specific preference on item j in terms of aspects, i.e., which aspects of the item j that the user i is mostly interested in.

## 3.2 Rationale

The trade-off between model interpretability and performance states that we can either achieve high interpretability with simpler models or high performance with more complex models that are generally harder to interpret [Zhang and Chen, 2018]. Recent works [Zhang and Chen, 2018; He et al., 2015; Zhang et al., 2014] have shown that with adequate metadata and knowledge, it is possible to achieve both explainability and high accuracy in the same model. However, those approaches mainly focus on explanation of the recommendation, rather than exploiting the interpretability of the models and features, and hence are still not interpretable from modeling perspective. Explainability and interpretability refer to "why" and "how" a recommendation is made, respectively. Many above-referenced works only answer the "why" question via constraints from external knowledge without addressing "how". Whereas our proposed AMCF model answers both "why" and "how" questions, i.e., our recommendations are made based on the attention weights (why) and the weights are learned by interpretable feature decomposition (how). To achieve this, we assume that an interpretable aspect feature representation can be mathematically derived from the corresponding general feature representation. More formally:

Assumption 1. Assume there are two representations for the same prediction task: u in complex feature space U (i.e. general embedding space including item embedding and aspect embedding), and v in simpler feature space V (i.e. space spanned by aspect embeddings), and V ⊂ U. We say that v is the projection of u from space U to space V, and there exists a mapping M(·, θ), such that v = M(u, θ), with θ as a hyper-parameter.

This assumption is based on the widely accepted notion that a simple local approximation can give good interpretation of a complex model in that particular neighborhood [Ribeiro et al., 2016]. Instead of selecting surrogate interpretable simple models (such as linear models), we map the general complex features to the simpler interpretable aspect features, then render recommendation based on those general complex features. We give explanations using interpretable aspect features, achieving the best of both worlds in keeping the high performance of the complex model as well as gaining the interpretability of the simpler model. In this work, the interpretable simple features are obtained based on aspects, hence we call the corresponding feature space as aspect space. To map the complex general features onto the interpretable aspect space, we define the aspect projection.

Definition 1. (Aspect Projection) Given Assumption 1, we say v is an aspect projection of u from general feature space U to aspect feature space V (Figure 1).

To achieve good interpretability and performance in the same model, from Definition 1 and Assumption 1, we need to find the mapping M(·, θ). Here we first use a latent factor model as the base model for explicit rating prediction, which learns general features, as shown in Figure 2 (left, Lpred), where we call the item embedding u as the general complex feature learned by the base model. Then the remaining problem is to derive the mapping from the non-interpretable general features to the interpretable aspect features.

## 3.3 Aspect Embedding

To design a simple interpretable model, its features should be well aligned to our interest, e.g. the aspects is a reasonable choice. Taking movie genre as an example: if we use 4 genres (Romance, Comedy, Thriller, Fantasy) as 4 aspects, the movie Titanic's aspect should be represented by (1, 0, 0, 0) because it's romance genre, and the movie Cinderella's aspect is (1, 0, 0, 1) because it's genre falls into both romance and fantasy.

From Assumption 1 and Definition 1, to make the feature mapping from a general feature u to an aspect feature v, we need to first define the aspect space V. Assuming there are m aspects in consideration, we represent the m aspects by m latent vectors in general space U, and use these m aspect vectors as the basis that spans the aspect space V ⊂ U. These aspects' latent vectors can be learned by neural embedding or other feature learning methods, with each aspect corresponding to an individual latent feature vector. Our model uses embedding approach to extract m aspect latent vectors of ndimension, where n is the dimension of space U. In Figure 2, the vertical columns in red (ψ1, ...,ψm) represent m aspect embeddings in the general space U, which is obtained by embedding the aspect multi-hot vectors from input.

## 3.4 Aspect Projection of ItemEmbedding

In Assumption 1, u is the general feature representation (i.e. the item embedding) in space U, and v is the interpretable aspect feature representation in space V. The orthogonal projection from the general space U to the aspect space V is denoted byM, i.e. v =M(u).

Figure 1: An illustration of interpretable feature mapping. u is an uninterpretable feature in general space U, and v is the interpretable projection of u in the interpretable aspect space V. Here b indicates the difference between u and v.

![Image](https://ijcai.org/proceedings/2020/fulltext/373/image_000000_0315c14818f9ecf5e62db107a5ecd73d16fbbc9c26fd9f406a57318f0e287f16.png)

Figure 2: The training phase: explainable recommendation via interpretable feature mapping.

![Image](https://ijcai.org/proceedings/2020/fulltext/373/image_000001_4a5c51aa285b780ecbafdefb7af5f7005355a1e2950c1c80d28413c3be16185f.png)

From the perspective of learning disentangled representations, the item embedding u can be disentangled as u = v+b (Figure 1), where v encodes the aspect information of an item and b is the item-unique information. For example, movies from the same genre share similar artistic style (v) yet each movie has its own unique characteristics (b). With this disentanglement of item embeddings, we can explain recommendation via capturing user's preference in terms of aspects.

Let's assume that we have m linearly independent and normalized aspect vectors (ψ1, ...,ψm) in space U, which span subspace V. For any vector v =M(u) in space V, there exists an unique decomposition such that v = ∑mi=1 viψi. The coefficients can be directly calculated by vi = v ·ψi = u·ψi, (i = 1, ...,m, ψi is normalized). Note that the second equality comes from the fact that v is the orthogonal projection of u on space V.

Generally speaking, however, (ψ1, ..., ψm) are not orthogonal. In this case, as long as they are linearly independent, we can perform Gram-Schmidt orthogonalization process to obtain the corresponding orthogonal basis. The procedure can be simply described as follows: ˜ψ1 = ψ1; and ˜ψi = ψi - ∑i-1 j=1 〈ψi, ˜ψj〉˜ψj, where 〈ψi, ˜ψj〉 denotes inner product. We can then calculate the unique decomposition as in the orthogonal cases. Assume the resulting decomposition is v = ∑mi=1 ˜ vi ˜ψi, the coefficients corresponding to the original basis (ψ1, ...,ψm) can then be calculated by: vi = ˜ vi - ∑mj=i+1 〈ψi, ˜ψj〉; and vm = ˜ vm.

Hence, after the aspect feature projection and decomposition, regardless of orthogonal or not, we have the following unique decomposition in space V: v = ∑mi=1 viψi.

Aspect Projection via Attention. As described above, any interpretable aspect feature v can be uniquely decomposed as v = ∑mi=1 viψi, which is similar to the form of attention mechanism. Therefore, instead of using Gram-Schmidt orthogonalization process, we utilize attention mechanism to reconstruct v directly. Assume we can obtain an attention vector a = (a1, ..., am), which can be used to calculate ˆv = ∑mi=1 aiψi, with the fact that the decomposition is unique, our goal is then to minimize the distance ||ˆv-v||2 to ensure that ai ≈ vi.

However, as the interpretable aspect feature v is not available, we cannot minimize ||ˆv - v||2 directly. Fortunately, the general feature u is available (obtained from a base latent factor model), with the fact that v is the projection of u, i.e. v =M(u), we have the following lemma:

Lemma 1. Provided that v is the projection of u from space U to space V, where V ⊂ U, we have

<!-- formula-not-decoded -->

where ˆv = ∑mi=1 aiψi, a = (a1, ..., am), and || · ||2 denotes l2 norm.

Proof. Refer to the illustration in Figure 1, and denote the difference between u and v as b, i.e. u = v + b. Hence

<!-- formula-not-decoded -->

Note that b is perpendicular to ˆv and v, the right hand side can then be written as

<!-- formula-not-decoded -->

From the above proof, we know that attention mechanism is sufficient to reconstruct v ≈ ˆ v = ∑mi=1 aiψi by minimizing ||ˆv -u||2. Note that from the perspective of disentanglement u = v + b, the information in b, i.e., the item specific characteristics, is not explained in our model. Intuitively, the item specific characteristics are learned from the metadata associated with the item.

## 3.5 The Loss Function

The loss function for finding the feature mapping M(·) to achieve both interpretability and performance of the recommender model has 2 components:

- Lpred prediction loss in rating predictions, corresponding to the loss function for the base latent factor model.
- Lint interpretation loss to the general feature u. This loss is to quantify ||ˆv -u||2.

We calculate the rating prediction loss component using RMSE: Lpred = √ 1N ∑(i,j)∈Observed (rij - ˆ rij)2 , where ˆ rij represents the predicted item ratings. We then calculate the interpretation loss component as the average distance between u and ˆv: Lint = 1N ∑(i,j)∈Observed ||ˆv-u||2. The loss component Lint encourages the interpretable feature ˜v obtained from the attentive neural network to be a good approximation of the aspect feature representation v (Lemma 1). Hence the overall loss function is L = Lpred + λLint, where λ is a tuning parameter to leverage importance between the two loss components.

Figure 3: The explanation phase: a virtual item vector ˆ vk is calculated to represent a specific aspect.

![Image](https://ijcai.org/proceedings/2020/fulltext/373/image_000002_09e011679b52f8bcb54cc5d82c37dbbe1ea5ada33d79252586e7fcfe39b3b732.png)

Gradient Shielding Trick. To ensure that interpretation doesn't compromise the prediction accuracy, we allow forward propagation to both Lint and Lpred but refrain the backpropagation from Lint to the item embedding u. In other words, when learning the model parameters based on backpropagation gradients, the item embedding u is updated only via the gradients from Lpred.

## 3.6 User Preference Prediction

Thus far we attempt to optimize the ability to predict user preference via aspect feature mapping. We call the user overall preference as general preference, and the user preference on a specific item as specific preference.

General preference. Figure 3 illustrates how to make prediction on user general preference. Here we define a virtual item ˆ vk, which is a linear combination of aspect embeddings. For general preference, we let ˆvk = ψk to simulate a pure aspect k movie, the resulting debiased (discarded all bias terms) rating prediction ˆ pk indicates the user's preference on such specific aspect (e.g., positive for 'like', negative for 'dislike'). Formally: ˆ pk = f(q, ˆvk), where q is the user embedding, ˆvk = ψk is the aspect k's embedding, and f(·) is the corresponding base latent factor model without bias terms.

Specific preference. Figure 3 also shows our model's ability to predict user preference on a specific item, as long as we can find how to represent them in terms of aspect embeddings. Fortunately, the attention mechanism is able to help us find the constitution of any item in terms of aspect embeddings using the attention weights. That is, for any item, it is possible to rewrite the latent representation u as a linear combination of aspect embeddings: u = ˆ v + b = ∑k akψk + b, where ak and ψk are the k-th attention weight and the k-th aspect feature, respectively. The term b reflects interpretation loss. For aspect k of an item, we use ˆ vk = akψk to represent the embedding of a virtual item which represents the aspect k property of the specific item. Hence, the output ˆ pk indicates the specific preference on aspect k of a specific item.

Model Interpretability. From specific preference, a latent general feature can be decomposed into the linear combination of interpretable aspect features, which would help interpret models in a more explicit and systematic manner.

## 4 Experiments and Discussion

We design and perform experiments to demonstrate two advantages of our AMCF approach: 1) comparable rating predictions; 2) good explanations on why a user likes/dislikes an item. To demonstrate the first advantage we compare the rating prediction performance with baseline approaches of rating prediction only methods. The demonstration of the second advantage, however, is not a trivial task since currently no gold standard for evaluating explanation of recommendations except for using real customer feedback[Chen et al., 2019b; Gao et al., 2019]. Hence it's necessary to develop new schemes to evaluate the quality of explainability for both general and specific user preferences.

Table 1: Summary statistics of the data sets.

| Dataset        |   # of ratings |   # of items |   # of users |   # of genres |
|----------------|----------------|--------------|--------------|---------------|
| MovieLens 1M   |      1,000,209 |        3,706 |        6,040 |            18 |
| MovieLens 100k |        100,000 |        1,682 |          943 |            18 |
| Yahoo Movie    |        211,333 |       11,915 |        7,642 |            29 |

## 4.1 Datasets

MovieLens Datasets. This data set [Harper and Konstan, 2016] offers very complete movie genre information, which provides a perfect foundation for genre (aspect) preference prediction, i.e. determining which genre a user likes most. We consider the 18 movie genres as aspects.

YahooMovies Dataset. This data set fromYahoo Lab contains usual user-movie ratings as well as metadata such as movie's title, release date, genre, directors and actors. We use the 29 movie genres as the aspects for movie recommendation and explanation. Summary statistics are shown in Table 1.

Pre-processing. We use multi-hot encoding to represent genres of each movie or book, where 1 indicates the movie is of that genre, 0 otherwise. However, there are still plenty of movies with missing genre information, in such cases, we simply set them as none of any listed genre, i.e., all zeros in the aspect multi-hot vector: (0, 0, ..., 0).

## 4.2 Results of Prediction Accuracy

We select several strong baseline models to compare rating prediction accuracy, including non-interpretable models, such as SVD [Koren et al., 2009], Neural Collaborative Filtering (NCF) [He et al., 2017] and Factorization Machine (FM) [Rendle, 2010], and an interpretable linear regression model (LR). Here the LR model is implemented by using aspects as inputs and learning separate parameter sets for different individual users. In comparison, our AMCF approaches also include SVD, NCF or FM as the base model to demonstrate that the interpretation module doesn't compromise the prediction accuracy. Note that since regular NCF and FM are designed for implicit ratings (1 and 0), we replace their last sigmoid output layers with fully connected layers in order to output explicit ratings.

In terms of robustness, we set the dimension of latent factors in the base models to 20, 80, and 120. The regularization tuning parameter λ is set to 0.05, which demonstrated better performance compared to other selections. It is worth noting that the tuning parameters of the base model of our AMCF approach are directly inherited from the corresponding non-interpretable model. We compare our AMCF models with baseline models as shown in Table 2. It is clear that AMCF achieves comparable prediction accuracy to their noninterpretable counterparts, and significantly outperforms the interpretable LR model.

## 4.3 Evaluation of Explainability

Despite the recent efforts have been made to evaluate the quality of explanation by defining explainability precision (EP) and explainability recall (ER)[Peake and Wang, 2018; Abdollahi and Nasraoui, 2016], the scarcity of ground truth such as a user's true preference remains a significant obstacle for explainable recommendation. [Gao et al., 2019] make an initial effort in collecting ground truth by surveying real customers, however, the labor intense, time consuming and sampling bias may prevent its large-scale applications in a variety of contexts. Other text-based approaches [Costa et al., 2018; Lu et al., 2018] can also use natural language processing (NLP) metrics such as Automated Readability Index (ARI) and Flesch Reading Ease (FRE). As we don't use metadata such as text reviews in our AMCF model, user review based explanation and evaluation could be a potential future extension to our model.

Here we develop novel quantitative evaluation schemes to assess our model's explanation quality in terms of general preferences and specific preferences, respectively.

## General Preference

Let's denote the ground truth of user general preferences as pi for user i, and the model's predicted preference for user i is ˆpi, we propose measures inspired by Recall@K in recommendation evaluations.

TopM recall at K. (TM@K): Given theM most preferred aspects of a user i from pi, top M recall at K is defined as the ratio of the M aspects located in the top K highest valued aspects in ˆpi. For example, if pi indicates that user i's top 3 preferred aspects are Adventure, Drama, and Thriller, while the predicted ˆpi shows that the top 5 are Adventure, Comedy, Children, Drama, Crime, the top 3 recalls at 5 (T3@5) is then 2/3 whereas top 1 recall at 3 (T1@3) is 1.

Bottom M recall at K. (BM@K): Similarly defined as above, except that it measures the most disliked aspects.

As the ground truth of user preferences are usually not available, some reasonable approximations are needed. Hence we propose a method to calculate the so-called surrogate ground truth. First we define the weights wij = (rij - bui - bvj - ¯ r)/A, where the weight wij is calculated by nullifying user bias bui , item bias bvj , and global average ¯ r, and A is a constant indicating the maximum rating (e.g. A = 5 for most datasets). Note that user bias bui and item bias bvj can be easily calculated by bui = ( 1 |Vi | ∑j∈Vi rij)-¯ r, and bvj = ( 1 |Uj | ∑i∈Uj rij) - ¯ r. Here Vi represents the sets of items rated by user i, and Uj represents the sets of users that have rated item j. With the weights we calculate user i's preference on aspect t using the following formula: pti = ∑j∈Vi wijstj , where stj = 1 if item j has aspect t, 0 otherwise. Hence a user i's overall preference can be represented by an l1 normalized vector pi = (p1i , ..., pti , ..., pTi )/||pi||1. As our model can output a user preference vector directly, we evaluate the explainability by calculating the average of TM@K and BM@K. The evaluation results are reported in Table 3. We observe that the explainability of AMCF is significantly better than random interpretation, and is comparable to the strong interpretable baseline LR model with a much better prediction accuracy. Thus our AMCF model successfully integrates the strong prediction performance of a latent factor model and the strong interpretability of a LR model.

Table 2: Performance comparison of rating prediction using different data sets in terms of RMSE. Texts in the parentheses indicate the base CF models that we choose for AMCF; and the numbers [20, 80, 120] indicate the dimension of the latent factors for the models.

| Dataset   |    LR |   SVD - 20 |   SVD - 80 |   SVD - 120 |   AMCF(SVD) - 20 |   AMCF(SVD) - 80 |   AMCF(SVD) - 120 |   NCF - 20 |   NCF - 80 |   NCF - 120 |   AMCF(NCF) - 20 |   AMCF(NCF) - 80 |   AMCF(NCF) - 120 |   FM - 20 |   FM - 80 |   FM - 120 |   AMCF(FM) - 20 |   AMCF(FM) - 80 |   AMCF(FM) - 120 |
|-----------|-------|------------|------------|-------------|------------------|------------------|-------------------|------------|------------|-------------|------------------|------------------|-------------------|-----------|-----------|------------|-----------------|-----------------|------------------|
| ML100K    | 1.018 |      0.908 |      0.908 |       0.907 |            0.907 |            0.909 |             0.907 |      0.939 |      0.939 |       0.936 |            0.937 |            0.939 |             0.934 |     0.937 |     0.933 |      0.929 |           0.940 |           0.936 |            0.931 |
| ML1M      | 1.032 |      0.861 |      0.860 |       0.853 |            0.860 |            0.858 |             0.851 |      0.900 |      0.895 |       0.892 |            0.902 |            0.889 |             0.889 |     0.915 |     0.914 |      0.913 |           0.915 |           0.914 |            0.915 |
| Yahoo     | 1.119 |      1.022 |      1.021 |       1.014 |            1.022 |            1.022 |             1.010 |      1.028 |      1.027 |       1.028 |            1.027 |            1.026 |             1.025 |     1.042 |     1.042 |      1.039 |           1.044 |           1.042 |            1.041 |

Table 3: Preferences outputs: TM@K/BM@K represent Top/ Bottom M recall at K, and scores represents the specific preference. The Rand rows show the theoretical random preference outputs. Here AMCF takes SVD with 120 latent factors as the base model.

| Dataset   | Model   |   T1@3 |   B1@3 |   T3@5 |   B3@5 |   scores |
|-----------|---------|--------|--------|--------|--------|----------|
| ML100K    | AMCF    |  0.500 |  0.481 |  0.538 |  0.553 |    0.378 |
| ML100K    | LR      |  0.628 |  0.668 |  0.637 |  0.675 |    0.371 |
| ML100K    | Rand    |  0.167 |  0.167 |  0.278 |  0.278 |        0 |
| ML1M      | AMCF    |  0.461 |  0.403 |  0.513 |  0.489 |    0.353 |
| ML1M      | LR      |  0.572 |  0.565 |  0.598 |  0.620 |    0.322 |
| ML1M      | Rand    |  0.167 |  0.167 |  0.278 |  0.278 |        0 |
| Yahoo     | AMCF    |  0.413 |  0.409 |  0.422 |  0.440 |    0.224 |
| Yahoo     | LR      |  0.630 |  0.648 |  0.628 |  0.565 |    0.235 |
| Yahoo     | Rand    |  0.103 |  0.103 |  0.172 |  0.172 |        0 |

## Specific Preference

Our approach is also capable of predicting a user's preference on a specific item, i.e. ˆpij, showing which aspects of item j are liked/disliked by the user i. Compared to user general preference across all items, the problem of which aspect of an item attracts the user most (specific preference) is more interesting and more challenging. There is no widely accepted strategy to evaluate the quality of single item preference prediction (except for direct customer survey). Here we propose a simple yet effective evaluation scheme to illustrate the quality of our model's explanation on user specific preference. With the overall preference pi of user i given above, and assuming sj is the multi-hot vector represents the aspects of item j, we say the element-wise product pij = pi ⊙sj reflects the user's specific preference on item j.

Note that we should not use the TM@K/BM@K scheme as in general preference evaluation, both pij and predicted ˆ pij's entries are mostly zeros, since each movie is only categorized into a few genres. Hence the quality of specific preference prediction is expressed using a similarity measure. We use s(pij, ˆpij) to represent the cosine similarity between pij and ˆpij, and the score for specific preference prediction is defined by averaging over all user-item pairs in the test set: scores = 1N ∑ij s(pij, ˆpij). We report the results of specific user preferences in the scores column of Table 3. As the LR cannot give specific user preferences directly, we simply apply ˆ pij = ˆ pi ⊙ sj where ˆ pi represents the general preference predicted by LR.

An insight. Assume that for a specific user i, our AMCF model can be simply written as ˆ rij = fi(uj) to predict the rating for item j. Note that our AMCF model can decompose the item in terms of aspects. Lets denote these aspects as {ψ1, ...ψm}. Then the prediction can be approximated by ˆ rij ≈ fi(∑mk=1 ajkψk), where ajk denote the k-th attention weights for item j. In the case of LR, the rating is obtained by ˆ rij = gi(∑mk=1 bkxk), where gi is the LR model for user i, bk is the k-th coefficient of it, and xk represents the indicator of aspect k, xk = 1 when the item has aspect k, xk = 0 otherwise. The similarity between AMCF formula and LR formula listed above indicates that the coefficients of LR and the preference output of AMCF share the same intrinsic meaning, i.e., both indicate the importance of aspects.

Figure 4: Examples of explainable recommendations. We l1normalize the preference vector p to make the comparison fair.

![Image](https://ijcai.org/proceedings/2020/fulltext/373/image_000003_ae8a4e23668b24522cb053ab10b673d110fcfeb9ace38dde4a18a2e5a3c686de.png)

An example. For specific explanation, given a user i and an item j, our AMCF model predicts a vector p, representing the user i's specific preference on an item j in terms of all predefined aspects. Specifically, the magnitude of each entry of p (i.e. |pi|) represents the impact of a specific aspect on whether an item liked by a user or not. For example, in Figure 4, the movie 120 is high-rated by both users 65 and 74, however, with differential explanations: the former user preference is more on the Action genre whereas the latter is more on Sci-Fi and War. On the other hand, the same movie is low-rated by user 67 mainly due to the dislike of Action genre.

## 5 Conclusion

Modelers tend to better appreciate the interpretable recommender systems whereas users are more likely to accept the explainable recommendations. In this paper, we proposed a novel interpretable feature mapping strategy attempting to achieve both goals: systems interpretability and recommendation explainability. Using extensive experiments and tailormade evaluation schemes, our AMCF method demonstrates strong performance in both recommendation and explanation.

## Acknowledgements

This work is supported by the National Science Foundation under grant no. IIS-1724227.

## References

1. [Abdollahi and Nasraoui, 2016] Behnoush Abdollahi and Olfa Nasraoui. Explainable matrix factorization for collab- orative filtering. In Proceedings of the 25th WWW, pages 5-6. International WWW Conferences Steering Commit- tee, 2016.
2. [Baral et al., 2018] Ramesh Baral, XiaoLong Zhu, SS Iyen- gar, and Tao Li. Reel: R eview aware explanation of loca- tion recommendation. In Proceedings of the 26th Confer- ence on User Modeling, Adaptation and Personalization, pages 23-32. ACM, 2018.
3. [Bauman et al., 2017] Konstantin Bauman, Bing Liu, and Alexander Tuzhilin. Aspect based recommendations: Rec- ommending items with the most valuable aspects based on user reviews. In Proceedings of the 23rd ACM SIGKDD, pages 717-725. ACM, 2017.
4. [Chen et al., 2016] Xu Chen, Zheng Qin, Yongfeng Zhang, and Tao Xu. Learning to rank features for recommenda- tion over multiple categories. In Proceedings of the 39th International ACM SIGIR, pages 305-314. ACM, 2016.
5. [Chen et al., 2018] Chong Chen, Min Zhang, Yiqun Liu, and Shaoping Ma. Neural attentional rating regression with review-level explanations. In Proceedings of the 2018 WWW, pages 1583-1592. International WWW Confer- ences Steering Committee, 2018.
6. [Chen et al., 2019a] Xu Chen, Yongfeng Zhang, and Zheng Qin. Dynamic explainable recommendation based on neu- ral attentive models. In Proceedings of the AAAI Confer- ence on Artificial Intelligence, volume 33, pages 53-60, 2019.
7. [Chen et al., 2019b] Zhongxia Chen, Xiting Wang, Xing Xie, Tong Wu, Guoqin Bu, Yining Wang, and Enhong Chen. Co-attentive multi-task learning for explainable rec- ommendation. In IJCAI, June 2019.
8. [Costa et al., 2018] Felipe Costa, Sixun Ouyang, Peter Dolog, and Aonghus Lawlor. Automatic generation of nat- ural language explanations. In Proceedings of the 23rd International Conference on Intelligent User Interfaces Companion, page 57. ACM, 2018.
9. [Diao et al., 2014] Qiming Diao, Minghui Qiu, Chao-Yuan Wu, Alexander J Smola, Jing Jiang, and Chong Wang. Jointly modeling aspects, ratings and sentiments for movie recommendation (jmars). In Proceedings of the 20th ACM SIGKDD, pages 193-202. ACM, 2014.
10. [Gao et al., 2019] Jingyue Gao, Xiting Wang, Yasha Wang, and Xing Xie. Explainable recommendation through at- tentive multi-view learning. In AAAI Conference on Arti- ficial Intelligence (AAAI), March 2019.
11. [Harper and Konstan, 2016] F Maxwell Harper and Joseph A Konstan. The movielens datasets: History and context. Acm transactions on interactive intelligent systems (tiis), 5(4):19, 2016.
12. [He et al., 2015] Xiangnan He, Tao Chen, Min-Yen Kan, and Xiao Chen. Trirank: Review-aware explainable recom- mendation by modeling aspects. In Proceedings of the 24th ACM International on Conference on Information and Knowledge Management, pages 1661-1670. ACM, 2015.
13. [He et al., 2017] Xiangnan He, Lizi Liao, Hanwang Zhang, Liqiang Nie, Xia Hu, and Tat-Seng Chua. Neural col- laborative filtering. In Proceedings of the 26th WWW, pages 173-182. International WWW Conferences Steer- ing Committee, 2017.
14. [Hou et al., 2019] Yunfeng Hou, Ning Yang, Yi Wu, and S Yu Philip. Explainable recommendation with fusion of aspect information. WWW, 22(1):221-240, 2019.
15. [Koren et al., 2009] Yehuda Koren, Robert Bell, and Chris Volinsky. Matrix factorization techniques for recom- mender systems. Computer, 8:30-37, 2009.
16. [Lee and Jung, 2018] O-Joun Lee and Jason J Jung. Explain- able movie recommendation systems by using story-based similarity. In IUI Workshops, 2018.
17. [Lu et al., 2018] Yichao Lu, Ruihai Dong, and Barry Smyth. Why i like it: multi-task learning for recommendation and explanation. In Proceedings of the 12th ACM Conference on Recommender Systems, pages 4-12. ACM, 2018.
18. [Peake and Wang, 2018] Georgina Peake and Jun Wang. Ex- planation mining: Post hoc interpretability of latent factor models for recommendation systems. In Proceedings of the 24th ACM SIGKDD, pages 2060-2069. ACM, 2018.
19. [Rendle, 2010] Steffen Rendle. Factorization machines. In 2010 IEEE International Conference on Data Mining, pages 995-1000. IEEE, 2010.
20. [Ribeiro et al., 2016] Marco Tulio Ribeiro, Sameer Singh, and Carlos Guestrin. Why should i trust you?: Explain- ing the predictions of any classifier. In Proceedings of the 22nd ACM SIGKDD, pages 1135-1144. ACM, 2016.
21. [Wang et al., 2019] Xiang Wang, Dingxian Wang, Canran Xu, Xiangnan He, Yixin Cao, and Tat-Seng Chua. Ex- plainable reasoning over knowledge graphs for recommen- dation. In Proceedings of the AAAI Conference on Artifi- cial Intelligence, volume 33, pages 5329-5336, 2019.
22. [Wu et al., 2019] Libing Wu, Cong Quan, Chenliang Li, Qian Wang, Bolong Zheng, and Xiangyang Luo. A context-aware user-item representation learning for item recommendation. ACM Transactions on Information Sys- tems (TOIS), 37(2):22, 2019.
23. [Zhang and Chen, 2018] Yongfeng Zhang and Xu Chen. Ex- plainable recommendation: A survey and new perspec- tives. arXiv preprint arXiv:1804.11192, 2018.
24. [Zhang et al., 2014] Yongfeng Zhang, Guokun Lai, Min Zhang, Yi Zhang, Yiqun Liu, and Shaoping Ma. Explicit factor models for explainable recommendation based on phrase-level sentiment analysis. In Proceedings of the 37th international ACM SIGIR, pages 83-92. ACM, 2014.
25. [Zhang et al., 2019] Yongfeng Zhang, Jiaxin Mao, and Qingyao Ai. Www'19 tutorial on explainable recommen- dation and search. In Companion Proceedings of WWW, pages 1330-1331. ACM, 2019.