arrow
Return

A Multi-Aspect Neural Tensor Factorization Framework for Patent Litigation Prediction

delete2024-02-01
delete2
PRE
AI
H
Han Wu
G
Guanqi Zhu
刘琦 (Qi Liu) *
H
Hengshu Zhu
H
Hao Wang
H
Hongke Zhao
C
Chuanren Liu
陈恩红 (Enhong Chen)
H
Hui Xiong
DOI:10.1109/TBDATA.2023.3313030delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
Patent litigation is an expensive and time-consuming legal process. To reduce costs, companies can proactively manage patents using predictive analysis to identify potential plaintiffs, defendants, and patents that may lead to litigation. However, there has been limited progress in predicting patent litigation due to the scarcity of lawsuits, the complexities of intentions, and the diversity of litigation characteristics. To this end, in this paper, we summarize the major causes of patent litigation into multiple aspects: the complex relations among plaintiffs, defendants and patents as well as the diverse content information from them. Along this line, we propose a Multi-aspect Neural Tensor Factorization (MANTF) framework for patent litigation prediction. First, a Pair-wise Tensor Factorization (PTF) module is designed to capture the complex relations among plaintiffs, defendants and patents inherent in a three-dimensional tensor, which will produce factorized latent vectors for companies and patents with pair-wise ranking estimators. Then, to better represent the patents and companies as an aid for PTF, we design a Patent Embedding Network (PEN) module and a Mask Company Embedding Network (MCEN) module to generate content-aware embedding for them, where PEN represents patents based on their meta, textual and graphical features, and MCEN represents companies by integrating their intrinsic features and competitions. Next, to integrate these three modules together, we leverage a Gaussian prior on the difference between factorized representations and content-aware embedding, and train MANTF in an end-to-end way. In the end, final predictions for patent litigation, i.e., the potentially litigated plaintiffs, defendants and patents, can be made with the well-trained model. We conduct extensive experiments on two real-world datasets, whose results prove that MANTF not only helps predict potential patent litigation but also shows robustness under various data sparse situations.
Keywords:
Patent litigation prediction
tensor factorization
data sparsity
patent mining
learning to rank

Journal

I
IEEE Transactions on Big Data
IF:
5.7
Papers:
860
Citations:
3.0K

Organization

T
tianjin university
Scholars:
8.0W
Papers: 5.7W
Citations: 88
U
university of science & technology of china, cas
Scholars:
3.2W
Papers: 2.7W
Citations: 74
University of Tennessee System cover
University of Tennessee System
Scholars:
2.9W
Papers: 2.6W
Citations: 115
C
chinese academy of sciences
Scholars:
56.5W
Papers: 44.9W
Citations: 704
researcher View more organizations