The use of intelligent judgment technology to assist in judgment is an inevitable trend in the development of judgment in contemporary social legal cases. Using big data and artificial intelligence technology to accurately determine multiple accusations involved in legal cases is an urgent problem to be solved in legal judgment. The key to solving these problems lies in two points, namely, (1) characterization of legal cases and (2) classification and prediction of legal case data. Traditional methods of entity characterization rely on feature extraction, which is often based on vocabulary and syntax information. Thus, traditional entity characterization often requires extensive energy and has poor generality, thus introducing a large amount of computation and limitation to subsequent classification algorithms. This study proposes an intelligent judgment approach called RnRTD, which is based on the relationship-driven recurrent neural network (rdRNN) and restricted tensor decomposition (RTD). We represent legal cases as tensors and propose an innovative RTD method. RTD has low dependence on vocabulary and syntax and extracts the feature structure that is most favorable for improving the accuracy of the subsequent classification algorithm. RTD maps the tensors, which represent legal cases, into a specific feature space and transforms the original tensor into a core tensor and its corresponding factor matrices. This study uses rdRNN to continuously update and optimize the constraints in RTD so that rdRNN can have the best legal case classification effect in the target feature space generated by RTD. Simultaneously, rdRNN sets up a new gate and a similar case list to represent the interaction between legal cases. In comparison with traditional feature extraction methods, our proposed RTD method is less expensive and more universal in the characterization of legal cases. Moreover, rdRNN with an RTD layer has a better effect than the recurrent neural network (RNN) only on the classification and prediction of multiple accusations in legal cases. Experiments show that compared with previous approaches, our method achieves higher accuracy in the classification and prediction of multiple accusations in legal cases, and our algorithm is more interpretable.
With the development of big data and artificial intelligence technologies, the use of computers to assist judgments in legal cases has become a popular topic. Traditional methods for judgment prediction mainly depend on feature models and classification algorithms. However, feature models require considerable expert knowledge and manual annotation work. They have strong dependence on vocabulary and grammar information in datasets, which is unconducive to improving the universality and accuracy of subsequent prediction algorithms. Meanwhile, the outputs of classification algorithms are discrete prediction results with coarse granularities. This paper proposes a new algorithm based on innovative tensor decomposition and ridge regression for judgment prediction of legal cases, namely, TenRR. TenRR is mainly divided into three steps. First, we propose a tensor representation method, namely, RTenr. RTenr expresses legal cases as three-dimensional tensors. Second, we propose an innovative tensor decomposition algorithm, namely, ITend. ITend decomposes original tensors representing legal cases into core tensors. Lastly, we propose an optimized ridge algorithm, namely, ORidge, to construct a judgment prediction model for legal cases. We further propose an optimization algorithm for ORidge to ITend; thus, core tensors obtained using ITend carry tensor elements and tensor structure information that is most beneficial to improving the accuracy of ORidge. Core tensors greatly reduce the dimension of original tensors. They eliminate the meaningless, redundant, and inaccurate information in original tensors. Experiments show that our method has higher accuracy than traditional methods for judgment prediction.
7 March 2023 in IEEE Transactions on Neural Networks and Learning Systems
In the field of smart justice, handling legal cases through artificial intelligence technology is a research hotspot. Traditional judgment prediction methods are mainly based on feature models and classification algorithms. The former is difficult to describe cases from multiple angles and capture the correlation information between different case modules, while requires a wealth of legal expertise and manual labeling. The latter is unable to accurately extract the most useful information from case documents and produce fine-grained predictions. This article proposes a judgment prediction method based on tensor decomposition with optimized neural networks, which consists of OTenr, GTend, and RnEla. OTenr represents cases as normalized tensors. GTend decomposes normalized tensors into core tensors using the guidance tensor. RnEla intervenes in a case modeling process in GTend by optimizing the guidance tensor, so that core tensors represent tensor structural and elemental information, which is most conducive to improving the accuracy of judgment prediction. RnEla consists of the similarity correlation Bi-LSTM and optimized Elastic-Net regression. RnEla takes the similarity between cases as an important factor for judgment prediction. Experimental results on real legal case dataset show that the accuracy of our method is higher than that of the previous judgment prediction methods.