|
Hokkaido University Collection of Scholarly and Academic Papers >
Graduate School of Information Science and Technology / Faculty of Information Science and Technology >
Peer-reviewed Journal Articles, etc >
An Explainable Recommendation Based on Acyclic Paths in an Edge-Colored Graph
| Title: | An Explainable Recommendation Based on Acyclic Paths in an Edge-Colored Graph |
| Authors: | Chinone, Kosuke Browse this author | | Nakamura, Atsuyoshi Browse this author →KAKEN DB |
| Keywords: | Recommender system | | Explainablity | | Graph algorithm |
| Issue Date: | 19-Mar-2022 |
| Publisher: | Springer |
| Journal Title: | Lecture Notes in Computer Science |
| Volume: | 13151 |
| Start Page: | 40 |
| End Page: | 52 |
| Publisher DOI: | 10.1007/978-3-030-97546-3_4 |
| Abstract: | We propose a novel recommendation algorithm based on acyclic paths in an edge-colored graph. In our method, all the objects including users, items to recommend, and other things usable to recommendation are represented as vertices in an edge-colored directed graph, in which edge color represents relation between the objects of its both ends. By setting each edge weight appropriately so as to reflect how much the object corresponding to its one end is preferred by people who prefer the object corresponding to its other end, the probability of an s-t path, which is defined as the product of its component edges' weights, can be regarded as preference degree of item t (item corresponding to vertex t) by user s (user corresponding to vertex s) in the context represented by the path. Given probability threshold θ, the proposed algorithm recommends user s to item t that has high sum of the probabilities of all the acyclic s-t paths whose probability is at least θ. For item t recommended to user s, the algorithm also shows high probability color sequences of those s-t paths, from which we can know main contexts of the recommendation of item t for user s. According to our experiments using real-world datasets, the recommendation performance of our method is comparable to the non-explainable state-of-the-art recommendation methods. |
| Rights: | This version of the contribution has been accepted for publication, after peer review (when applicable) but is not the Version of Record and does not reflect post-acceptance improvements, or any corrections. The Version of Record is available online at: https://doi.org/10.1007/978-3-030-97546-3_4. Use of this Accepted Version is subject to the publisher's Accepted Manuscript terms of use https://www.springernature.com/gp/open-research/policies/accepted-manuscript-terms |
| Type: | article (author version) |
| URI: | http://hdl.handle.net/2115/91071 |
| Appears in Collections: | 情報科学院・情報科学研究院 (Graduate School of Information Science and Technology / Faculty of Information Science and Technology) > 雑誌発表論文等 (Peer-reviewed Journal Articles, etc)
|
Submitter: 中村 篤祥
|
