Leveraging online behaviors for interpretable knowledge-aware patent recommendation
Bibliographic Data
| ID | 12420878 |
|---|---|
| Authors | Wei Du (0000-0001-5941-2382, Renmin University of China, corresponding author), Qiang Yan (0000-0003-0128-8360, Institute of Computing Technology), Wenping Zhang (0000-0002-0183-4504, Renmin University of China), Jian Ma (0000-0001-8223-8327, City University of Hong Kong) |
| Year | 2021 |
| Volume | 32 |
| Issue | 2 |
| Pages | 568-587 |
| Publication date | 2021-06-10 |
| Open Access | Yes |
| Type | ARTICLE |
| Venue | Internet Research (JOURNAL) |
| Journal identifiers | ISSN: 1066-2243 • E-ISSN: 2054-5657 |
| Publisher | Emerald Publishing Limited (PUBLISHER • GB) |
| DOI | 10.1108/intr-08-2020-0473 |
| OpenAlex | W3171878434 |
| Language | EN |
| Citations received | 3 |
| References cited | 26 |
Purpose Patent trade recommendations necessitate recommendation interpretability in addition to recommendation accuracy because of patent transaction risks and the technological complexity of patents. This study designs an interpretable knowledge-aware patent recommendation model (IKPRM) for patent trading. IKPRM first creates a patent knowledge graph (PKG) for patent trade recommendations and then leverages paths in the PKG to achieve recommendation interpretability. Design/methodology/approach First, we construct a PKG to integrate online company behaviors and patent information using natural language processing techniques. Second, a bidirectional long short-term memory network (BiLSTM) is utilized with an attention mechanism to establish the connecting paths of a company — patent pair in PKG. Finally, the prediction score of a company — patent pair is calculated by assigning different weights to their connecting paths. The semantic relationships in connecting paths help explain why a candidate patent is recommended. Findings Experiments on a real dataset from a patent trading platform verify that IKPRM significantly outperforms baseline methods in terms of hit ratio and normalized discounted cumulative gain (nDCG). The analysis of an online user study verified the interpretability of our recommendations. Originality/value A meta-path-based recommendation can achieve certain explainability but suffers from low flexibility when reasoning on heterogeneous information. To bridge this gap, we propose the IKPRM to explain the full paths in the knowledge graph. IKPRM demonstrates good performance and transparency and is a solid foundation for integrating interpretable artificial intelligence into complex tasks such as intelligent recommendations
Construct (python library · Database · Database transaction · Graph · Information retrieval · Interpretability · Machine learning · Patent visualisation · Recommender system · Computer Science · Intellectual Property and Patents · Machine Learning in Materials Science · Recommender Systems and Techniques · Artificial Intelligence · Theoretical Computer Science
| Citations per year | 1.5 |
|---|---|
| Citation span | 2024 - 2026 (3) |
| Highly cited | No |