Hierarchical multi-label categorization method suitable for legal identification

Abstract

The invention discloses a hierarchical multi-label categorization method suitable for legal recognition. The method comprises the following steps: step 1, extracting facts of a case and legal provisions thereof from a pre-processed judgment document; step 2, based on a hierarchical structure of a label space, expanding the legal provisions corresponding to the facts of the case, so that the categorization labels of the sample of the case are a subset of the label space; step 3, performing word segmentation and part-of-speech tagging on the texts of the facts of the case, selecting features ofword segmentation results, selecting features that fully represent the facts of the case, establishing a feature vector; step 4, establishing a prediction model: finding out the set N(x) of k neighborsamples in the expanded multi-label training set of a new instance x, setting a weight for each neighbor sample, calculating confidence of the new instance to each category according to categorization weight of k neighbor samples to each category, finally, predicting the category label set of the new instance.

Description

technical field [0001] The invention belongs to the field of computer data analysis and mining, and relates to a hierarchical multi-label classification method suitable for legal identification. Background technique [0002] Hierarchical multi-label classification is a special case of multi-label classification. Different from general multi-label classification, in hierarchical multi-label classification problems, each sample can have multiple class labels, and the sample label space is organized in a tree or directed acyclic graph hierarchy. In a directed acyclic graph, a node may have multiple parent nodes, which is more complex than the tree structure, and the design of the algorithm is more difficult. Therefore, the current research on hierarchical multi-label classification mainly focuses on the tree-shaped category label structure. . Hierarchical multi-label classification algorithms can be divided into local algorithms and global algorithms according to the differen...

AI Technical Summary

Problems solved by technology

[0004] The disadvantage of the local algorithm is that on the one hand, multiple classifiers need to be trained, which makes the model more complex and affects the intelligibility of the model; on the other hand, there will be blocking problems in the prediction process, that is, samples that are misclassified in the upper layer cannot reach the lower layer Although some people have proposed three strategies of lowering the threshold, limiting voting and expanding the threshold multiplication to deal with the blocking problem of the local algorithm, the local algorithm is often not ideal in terms of prediction accuracy.

The general hierarchical multi-label classification algorithm often cannot guarantee that its prediction results meet the hierarchical constraints, or cannot achieve the optimal learning effect because it does not utilize the hierarchical structure features of the label space.

Images