Predicting the Legal Risk of "Section 337 Investigations" by Elastic Time Predictor

Xingbo Gao, Chao Che, Lasheng Zhao, Jianxin Zhang
{"title":"Predicting the Legal Risk of \"Section 337 Investigations\" by Elastic Time Predictor","authors":"Xingbo Gao, Chao Che, Lasheng Zhao, Jianxin Zhang","doi":"10.1109/IUCC/DSCI/SmartCNS.2019.00100","DOIUrl":null,"url":null,"abstract":"In recent years, more and more patent lawsuits have been filed by Chinese enterprises, represented by the \"Section 337 investigations\" of the United States. In order to help Chinese enterprises cope with the challenges of patent litigation, a matrix factorization based recommendation system are used to predict the legal risk of 337 investigation. However, the results predicted by the model are prone to over-fitting. In order to solve this problem, this paper proposes a new recommendation framework, namely elastic time predictor. The model is a hybrid model combining matrix factorization and truncation function. We encode the information of the prosecution case of major companies and decompose it into two sub-matrices, and then combine the decomposed matrix with the segmentation of the truncation function to maintain the entire recommended frame flexible. In the recommended approach, we consider the risk of litigation that a company may experience when entering a new market, for example the risk that a potential competitor will file a lawsuit against a new entrant. We use actual data to conduct experiments, and the experimental results show that the proposed method is superior to the baseline method and has significant advantages.","PeriodicalId":410905,"journal":{"name":"2019 IEEE International Conferences on Ubiquitous Computing & Communications (IUCC) and Data Science and Computational Intelligence (DSCI) and Smart Computing, Networking and Services (SmartCNS)","volume":"64 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 IEEE International Conferences on Ubiquitous Computing & Communications (IUCC) and Data Science and Computational Intelligence (DSCI) and Smart Computing, Networking and Services (SmartCNS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IUCC/DSCI/SmartCNS.2019.00100","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

In recent years, more and more patent lawsuits have been filed by Chinese enterprises, represented by the "Section 337 investigations" of the United States. In order to help Chinese enterprises cope with the challenges of patent litigation, a matrix factorization based recommendation system are used to predict the legal risk of 337 investigation. However, the results predicted by the model are prone to over-fitting. In order to solve this problem, this paper proposes a new recommendation framework, namely elastic time predictor. The model is a hybrid model combining matrix factorization and truncation function. We encode the information of the prosecution case of major companies and decompose it into two sub-matrices, and then combine the decomposed matrix with the segmentation of the truncation function to maintain the entire recommended frame flexible. In the recommended approach, we consider the risk of litigation that a company may experience when entering a new market, for example the risk that a potential competitor will file a lawsuit against a new entrant. We use actual data to conduct experiments, and the experimental results show that the proposed method is superior to the baseline method and has significant advantages.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
弹性时间预测法预测“337调查”法律风险
近年来,以美国“337调查”为代表的中国企业提起的专利诉讼越来越多。为了帮助我国企业应对专利诉讼的挑战,采用基于矩阵分解的推荐系统对337调查的法律风险进行预测。然而,模型预测的结果容易出现过拟合。为了解决这一问题,本文提出了一种新的推荐框架,即弹性时间预测器。该模型是矩阵分解与截断函数相结合的混合模型。我们对大公司起诉案件信息进行编码,并将其分解为两个子矩阵,然后将分解矩阵与截断函数的分割相结合,保持整个推荐框架的灵活性。在推荐的方法中,我们考虑了公司在进入新市场时可能遇到的诉讼风险,例如潜在竞争对手将对新进入者提起诉讼的风险。我们利用实际数据进行了实验,实验结果表明,本文提出的方法优于基线方法,具有明显的优势。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Message from the RTWC 2019 Workshop Chairs Message from the NGDN 2019 Workshop Chairs Ideation Support System with Personalized Knowledge Level Prediction Message from the DSCI 2019 General Chairs Connection Degree Cost and Reward Based Algorithm in Cognitive Radio Networks
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1