Knowledge graph enhanced citation recommendation model for patent examiners

被引:0
|
作者
Lu, Yonghe [1 ,2 ]
Tong, Xinyu [1 ]
Xiong, Xin [1 ]
Zhu, Hou [1 ]
机构
[1] Sun Yat Sen Univ, Sch Informat Management, Guangzhou, Peoples R China
[2] Sun Yat Sen Univ, Sch Artificial Intelligence, Zhuhai, Peoples R China
基金
中国国家自然科学基金;
关键词
Knowledge graph; Patent citation recommendation; Patent examiner citation; Deep learning;
D O I
10.1007/s11192-024-04966-9
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
In the face of a growing volume of patents, patent examiners grapple with prolonged examination cycles, prompting the need for more effective citation recommendations. To address this, we introduce the patent knowledge graph embedded in Bert (PK-Bert) model. This innovation combines a patent knowledge graph with semantic information in an advanced Transformer framework, outperforming conventional common-sense knowledge graph embedding. PK-Bert exhibits substantial improvements, boosting the recall of accurate citation recommendations by 2.15% over the benchmark model Bert and 1.25% over K-Bert with CnDBpedia. Ablation experiments highlight the significance of knowledge graph elements, with the inventor proving most influential, followed by the IPC number and assignee. At the same time, publication time and title information have a minor impact. Moreover, PK-Bert excels when trained with earlier data and evaluated for patents issued post-November 2023. Our study not only advances patent examiner recommendations but also presents an efficient integration method for knowledge graph-enhanced semantic patent characterization.
引用
收藏
页码:2181 / 2203
页数:23
相关论文
共 50 条
  • [41] DEKR: Description Enhanced Knowledge Graph for Machine Learning Method Recommendation
    Cao, Xianshuai
    Shi, Yuliang
    Yu, Han
    Wang, Jihu
    Wang, Xinjun
    Yan, Zhongmin
    Chen, Zhiyong
    [J]. SIGIR '21 - PROCEEDINGS OF THE 44TH INTERNATIONAL ACM SIGIR CONFERENCE ON RESEARCH AND DEVELOPMENT IN INFORMATION RETRIEVAL, 2021, : 203 - 212
  • [42] Learning Item Attributes and User Interests for Knowledge Graph Enhanced Recommendation
    Huai, Zepeng
    Yang, Guohua
    Tao, Jianhua
    Zhang, Dawei
    [J]. NEURAL INFORMATION PROCESSING, ICONIP 2023, PT IV, 2024, 14450 : 284 - 297
  • [43] KHGCN: Knowledge-Enhanced Recommendation with Hierarchical Graph Capsule Network
    Chen, Fukun
    Yin, Guisheng
    Dong, Yuxin
    Li, Gesu
    Zhang, Weiqi
    [J]. ENTROPY, 2023, 25 (04)
  • [44] Jointly Non-Sampling Learning for Knowledge Graph Enhanced Recommendation
    Chen, Chong
    Zhang, Min
    Ma, Weizhi
    Liu, Yiqun
    Ma, Shaoping
    [J]. PROCEEDINGS OF THE 43RD INTERNATIONAL ACM SIGIR CONFERENCE ON RESEARCH AND DEVELOPMENT IN INFORMATION RETRIEVAL (SIGIR '20), 2020, : 189 - 198
  • [45] Multi-knowledge enhanced graph convolution for learning resource recommendation
    Dong, Yao
    Liu, Yuxi
    Dong, Yongfeng
    Wang, Yacong
    Chen, Min
    [J]. KNOWLEDGE-BASED SYSTEMS, 2024, 291
  • [46] A Personalized Attractions Recommendation Model based on Tourism Knowledge graph
    Jiang, Qi
    [J]. INTERNATIONAL CONFERENCE ON ENVIRONMENTAL REMOTE SENSING AND BIG DATA (ERSBD 2021), 2021, 12129
  • [47] Knowledge Graph Recommendation Model Based on Feature Space Fusion
    Zhang, Suqi
    Wang, Xinxin
    Wang, Rui
    Gu, Junhua
    Li, Jianxin
    [J]. APPLIED SCIENCES-BASEL, 2022, 12 (17):
  • [48] A graph-based taxonomy of citation recommendation models
    Ali, Zafar
    Qi, Guilin
    Kefalas, Pavlos
    Abro, Waheed Ahmad
    Ali, Bahadar
    [J]. ARTIFICIAL INTELLIGENCE REVIEW, 2020, 53 (07) : 5217 - 5260
  • [49] A graph-based taxonomy of citation recommendation models
    Zafar Ali
    Guilin Qi
    Pavlos Kefalas
    Waheed Ahmad Abro
    Bahadar Ali
    [J]. Artificial Intelligence Review, 2020, 53 : 5217 - 5260
  • [50] Global citation recommendation using knowledge graphs
    Ayala-Gomez, Frederick
    Daroczy, Balint
    Benczur, Andras
    Mathioudakis, Michael
    Gionis, Aristides
    [J]. JOURNAL OF INTELLIGENT & FUZZY SYSTEMS, 2018, 34 (05) : 3089 - 3100