2018 · 32 citations · 25 references
ComputingComputer ScienceData ScienceMachine LearningPatent LitigationPredictive AnalyticsDeep LearningPatent AnalysisRepresentation LearningCollaborative Information WorkHybrid Factorization ModelsHybrid ModelingLearned Feature EmbeddingsLegal PredictionLitigation PredictionProactive Issue ManagementTensor Factorization
Patent litigation is an expensive legal process faced by many companies, yet automatic prediction remains an open problem because lawsuits are complex. The study proposes a data‑driven framework, Convolutional Tensor Factorization (CTF), to proactively predict patents that may trigger litigation between companies, aiming to reduce litigation costs. CTF combines patent content features via a Network‑embedding‑combined Convolutional Neural Network with a tensor summarizing company lawsuit records, integrates these through tensor factorization, and ranks risky patents using a learning‑to‑rank strategy. Extensive experimental results on real‑world data demonstrate the effectiveness of our framework.
Patent litigation is an expensive legal process faced by many companies. To reduce the cost of patent litigation, one effective approach is proactive management based on predictive analysis. However, automatic prediction of patent litigation is still an open problem due to the complexity of lawsuits. In this paper, we propose a data-driven framework, Convolutional Tensor Factorization (CTF), to identify the patents that may cause litigations between two companies. Specifically, CTF is a hybrid modeling approach, where the content features from the patents are represented by the Network embedding-combined Convolutional Neural Network (NCNN) and the lawsuit records of companies are summarized in a tensor, respectively. Then, CTF integrates NCNN and tensor factorization to systematically exploit both content information and collaborative information from large amount of data. Finally, the risky patents will be returned by a learning to rank strategy. Extensive experimental results on real-world data demonstrate the effectiveness of our framework.
25
Adam: A Method for Stochastic Optimization
Diederik P. Kingma, Jimmy Ba · UvA-DARE (University of Amsterdam) · 2014 · 84.8K citations · Full text
Distributed Representations of Words and Phrases and their Compositionality
Tomáš Mikolov, Ilya Sutskever, Kai Chen et al. · arXiv (Cornell University) · 2013 · 18.1K citations · Full text
ADADELTA: An Adaptive Learning Rate Method
Matthew D. Zeiler · arXiv (Cornell University) · 2012 · 5.5K citations · Full text
BPR: Bayesian Personalized Ranking from Implicit Feedback
Steffen Rendle, Christoph Freudenthaler, Zeno Gantner et al. · arXiv (Cornell University) · 2012 · 4.4K citations · Full text