Event-based Dynamic Graph Representation Learning for Patent Application Trend Prediction
Tao Zou, Le Yu, Leilei Sun, Bowen Du, Deqing Wang, Fuzhen Zhuang

TL;DR
This paper introduces an event-based dynamic graph learning framework that models evolving company preferences and semantic correlations of patent classification codes to predict patent application trends effectively.
Contribution
It proposes a novel dynamic graph learning approach incorporating hierarchical message passing and memory updates for patent trend prediction.
Findings
Outperforms baseline methods on real-world datasets.
Effectively captures semantic relationships of classification codes.
Tracks technological development trajectories of companies.
Abstract
Accurate prediction of what types of patents that companies will apply for in the next period of time can figure out their development strategies and help them discover potential partners or competitors in advance. Although important, this problem has been rarely studied in previous research due to the challenges in modelling companies' continuously evolving preferences and capturing the semantic correlations of classification codes. To fill in this gap, we propose an event-based dynamic graph learning framework for patent application trend prediction. In particular, our method is founded on the memorable representations of both companies and patent classification codes. When a new patent is observed, the representations of the related companies and classification codes are updated according to the historical memories and the currently encoded messages. Moreover, a hierarchical message…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsIntellectual Property and Patents · Innovation Policy and R&D
