Explanation Mining: Post Hoc Interpretability of Latent Factor Models for Recommendation Systems
G. Peake, and J. Wang. Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, page 2060-2069. ACM, (July 2018)
DOI: 10.1145/3219819.3220072
Abstract
The widescale use of machine learning algorithms to drive decision-making has highlighted the critical importance of ensuring the interpretability of such models in order to engender trust in their output. The state-of-the-art recommendation systems use black-box latent factor models that provide no explanation of why a recommendation has been made, as they abstract their decision processes to a high-dimensional latent space which is beyond the direct comprehension of humans. We propose a novel approach for extracting explanations from latent factor recommendation systems by training association rules on the output of a matrix factorisation black-box model. By taking advantage of the interpretable structure of association rules, we demonstrate that predictive accuracy of the recommendation model can be maintained whilst yielding explanations with high fidelity to the black-box model on a unique industry dataset. Our approach mitigates the accuracy-interpretability trade-off whilst avoiding the need to sacrifice flexibility or use external data sources. We also contribute to the ill-defined problem of evaluating interpretability.
Description
Explanation Mining | Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining
%0 Conference Paper
%1 Peake_2018
%A Peake, Georgina
%A Wang, Jun
%B Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining
%D 2018
%I ACM
%K explanation justification recommender
%P 2060-2069
%R 10.1145/3219819.3220072
%T Explanation Mining: Post Hoc Interpretability of Latent Factor Models for Recommendation Systems
%U https://doi.org/10.1145%2F3219819.3220072
%X The widescale use of machine learning algorithms to drive decision-making has highlighted the critical importance of ensuring the interpretability of such models in order to engender trust in their output. The state-of-the-art recommendation systems use black-box latent factor models that provide no explanation of why a recommendation has been made, as they abstract their decision processes to a high-dimensional latent space which is beyond the direct comprehension of humans. We propose a novel approach for extracting explanations from latent factor recommendation systems by training association rules on the output of a matrix factorisation black-box model. By taking advantage of the interpretable structure of association rules, we demonstrate that predictive accuracy of the recommendation model can be maintained whilst yielding explanations with high fidelity to the black-box model on a unique industry dataset. Our approach mitigates the accuracy-interpretability trade-off whilst avoiding the need to sacrifice flexibility or use external data sources. We also contribute to the ill-defined problem of evaluating interpretability.
@inproceedings{Peake_2018,
abstract = {The widescale use of machine learning algorithms to drive decision-making has highlighted the critical importance of ensuring the interpretability of such models in order to engender trust in their output. The state-of-the-art recommendation systems use black-box latent factor models that provide no explanation of why a recommendation has been made, as they abstract their decision processes to a high-dimensional latent space which is beyond the direct comprehension of humans. We propose a novel approach for extracting explanations from latent factor recommendation systems by training association rules on the output of a matrix factorisation black-box model. By taking advantage of the interpretable structure of association rules, we demonstrate that predictive accuracy of the recommendation model can be maintained whilst yielding explanations with high fidelity to the black-box model on a unique industry dataset. Our approach mitigates the accuracy-interpretability trade-off whilst avoiding the need to sacrifice flexibility or use external data sources. We also contribute to the ill-defined problem of evaluating interpretability.
},
added-at = {2021-01-24T05:05:11.000+0100},
author = {Peake, Georgina and Wang, Jun},
biburl = {https://www.bibsonomy.org/bibtex/29a06484572f2d1d06556db05f948753f/brusilovsky},
booktitle = {Proceedings of the 24th {ACM} {SIGKDD} International Conference on Knowledge Discovery {\&} Data Mining},
description = {Explanation Mining | Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining},
doi = {10.1145/3219819.3220072},
interhash = {858a32149587f221afaf061101cbff13},
intrahash = {9a06484572f2d1d06556db05f948753f},
keywords = {explanation justification recommender},
month = jul,
pages = {2060-2069},
publisher = {{ACM}},
timestamp = {2021-01-24T05:15:28.000+0100},
title = {Explanation Mining: Post Hoc Interpretability of Latent Factor Models for Recommendation Systems},
url = {https://doi.org/10.1145%2F3219819.3220072},
year = 2018
}