详细议程|第四届“数字法治与智慧司法”国际研讨会暨湖北省法学会法理学研究会2024年年会
会议议程丨中国法学会网络与信息法学研究会2024年年会暨第二届数字法治大会会议议程
会议通知 | 四川省法学会人工智能与大数据法治研究会会员大会暨2024年年会通知
征文启事丨CCF中国计算法学研讨会暨第三届学术年会征文启事
会议议程丨网络与信息法学学科建设论坛
获奖名单|第二届“法研灯塔”司法大数据征文比赛获奖名单出炉啦!
讲座信息|王竹:数据产权的民法规制路径
会议议程 | 四川省法学会人工智能与大数据法治研究会2023年年会暨“人工智能与数据法律风险研讨会”
会议议程|11.04 中国民商法海南冬季论坛——数据法学的当下和未来
讲座信息|王竹:数据产品的民法规制路径
时间:2020-07-01
本文原载 IEEE Access,由四川大学数学学院翁洋副教授等科研人员创作,系四川大学“智慧法治”超前部署学科系列学术成果。后续会持续分享四川大学“智慧法治”超前部署学科系列学术成果,欢迎大家阅读。
Abstract: Chinese courts organize debates surrounding controversial issues along with the gradual formation of the new procedural system. With the progress of China’s judicial reform, more than 80 million judgement documents have been made public online. Similar controversial issues identifified in and among the massive public judgment documents are of signifificant value for judges in their trial work. Hence, homogeneous controversial issues classifification becomes the basis for similar cases retrieval. However, controversial issues follow the power-law distribution, not all of them are within the labels provided by manual annotation and their categories cannot be exhausted. In order to generalize those unfamiliar categories without necessitating extensive retraining, we propose a controversial issues classifification algorithm based on few-shot learning. Two few-shot learning algorithms are proposed for our controversial issues problem, Relation Network and Induction Network, respectively. With only a handful of given instances, both of them have shown excellent results on the two datasets, which proves their effectiveness in adapting to accommodating new categories not seen in training. The proposed method provides trial assistance for judges, promotes the dissemination of experience and improves fairness of adjudication.
Index Terms: Controversial issues, few-shot learning, text classifification, power-law, BERT.
Y. Fang, X. Tian, H. Wu, S. Gu, Z. Wang, F. Wang, J. Li, Y. Weng*, Few-Shot Learning for Chinese Legal Controversial Issues Classification, IEEE Access. 2020, 8(1): 75022-75034.(论文下载)