Skip to main content

Judicial Case Determination Methods Based on Event Tuple

  • Conference paper
  • First Online:
Wireless Algorithms, Systems, and Applications (WASA 2021)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 12937))

  • 1817 Accesses

Abstract

Judges have to consider the motives of the defendant’s side and the sequence of actions of all judicial subjects in the process of sentencing. Text analysis methods based on word vectors and deep neural networks, although they give statistically better classification results, cannot explain the causality of the actions of various subjects in the case logic. In this paper, we propose an event semantic mining algorithm that attempts to make judicial decisions from the causal logic. The method identifies the behavioral subjects in judicial documents through an entity extraction algorithm and extracts the subjects’ core behavior and motivation to achieve the construction of the underlying event tuple. By calculating the event tuple weights between different categories of cases, combined with a heap sorting algorithm, an event semantic tree is constructed for each case. Finally, a set of event tuple coding algorithm is designed to input the event semantic tree into the deep forest algorithm for inference. The experimental results show that the proposed event semantic tree construction method and event tuple coding method not only have a good case decision accuracy. It also has a good logical explanation.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Liu, C.-L., Hsieh, C.-D.: Exploring phrase-based classification of judicial documents for criminal charges in chinese. In: Esposito, F., Raś, Z.W., Malerba, D., Semeraro, G. (eds.) ISMIS 2006. LNCS (LNAI), vol. 4203, pp. 681–690. Springer, Heidelberg (2006). https://doi.org/10.1007/11875604_75

    Chapter  Google Scholar 

  2. Khan, A., Baharudin, B., Lee, L.H., et al.: A review of machine learning algorithms for text-documents classification. J. Adv. Inf. Technol. 1(1), 4–20 (2010)

    Google Scholar 

  3. Lin, W., Guo, Z., Zhang, D., et al.: Marking, case classification and sentence prediction in chinese legal documents using machine learning. Chin. J. Comput. Linguist. 17(4), 49–67 (2012)

    Google Scholar 

  4. Luo, B., Feng, Y., Xu, J., et al.: Learning to predict charges for criminal cases with legal basis. arXiv preprint arXiv:1707.09168 (2017)

  5. Zhong, H., Zhipeng, G., Tu, C., et al.: Legal judgment prediction via topological learning. In: Proceedings of the 2018 Conference on Empirical Methods in Natural Language Processing, pp. 3540–3549 (2018)

    Google Scholar 

  6. Ren, X., Wu, Z., He, W., et al.: Cotype: joint extraction of typed entities and relations with knowledge bases. In: Proceedings of the 26th International Conference on World Wide Web. International World Wide Web Conferences Steering Committee, pp. 1015–1024 (2017)

    Google Scholar 

  7. Augenstein, I., Vlachos, A., Maynard, D.: Extracting relations between non-standard entities using distant supervision and imitation learning. In: Proceedings of the 2015 Conference on Empirical Methods in Natural Language Processing, Association for Computational Linguistics, pp. 747–757 (2015)

    Google Scholar 

  8. Chiu, J.P.C., Nichols, E.: Named entity recognition with bidirectional LSTM-CNNs. Trans. Assoc. Comput. Linguis. 4, 357–370 (2016)

    Google Scholar 

  9. Huang, Z., Xu, W., Yu, K.: Bidirectional LSTM-CRF models for sequence tagging. arXiv preprint arXiv:1508.01991 (2015)

  10. Lample, G., Ballesteros, M., Subramanian, S., et al.: Neural architectures for named entity recognition. arXiv preprint arXiv:1603.01360 (2016)

  11. Geng, Z.Q., Chen, G.F., Han, Y.M., et al.: Semantic relation extraction using sequential and tree-structured LSTM with attention. Inf. Sci. 509, 183–192 (2020)

    Article  Google Scholar 

  12. He, Z., Chen, W., Li, Z., et al.: Syntax-aware entity representations for neural relation extraction. Artif. Intell. 275, 602–617 (2019)

    Article  MathSciNet  Google Scholar 

  13. Jiang, M., Diesner, J.: A constituency parsing tree based method for relation extraction from abstracts of scholarly publications. In: Proceedings of the Thirteenth Workshop on Graph-Based Methods for Natural Language Processing (TextGraphs-13), Association for Computational Linguistics, pp. 186–191 (2019)

    Google Scholar 

  14. Jeh, G., Widom, J.: A measure of structural-context similarity. In: Proceedings of the 8th ACM SIGKDD, pp. 538–543

    Google Scholar 

  15. Ribeiro, L.F.R., Saverese, P.H.P., Figueiredo, D.R.: struc2vec: Learning node representations from structural identity. In: Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 385–394 (2017)

    Google Scholar 

  16. Yang, L., Wu, X.Z., Jiang, Y., et al.: Multi-label learning with deep forest. arXiv preprint arXiv:1911.06557 (2019)

  17. Mikolov, T., Chen, K., Corrado, G., et al.: Efficient estimation of word representations in vector space. arXiv preprint arXiv:1301.3781 (2013)

  18. Le, Q., Mikolov, T.: Distributed representations of sentences and documents. In: International Conference on Machine Learning, pp. 1188–1196 (2014)

    Google Scholar 

  19. Bojanowski, P., Grave, E., Joulin, A., et al.: Enriching word vectors with subword information. Trans. Associ. Comput. Linguis. 5, 135–146 (2017)

    Article  Google Scholar 

  20. Zhou, Z.H., Feng, J.: Deep forest. arXiv preprint arXiv:1702.08835 (2017)

  21. Kim, S., Jeong, M., Ko, B.C.: Interpretation and simplification of deep forest. arXiv preprint arXiv:2001.04721 (2020)

  22. Xiao, C., Zhong, H., Guo, Z., et al.: Cail2018: a large-scale legal dataset for judgment prediction. arXiv preprint arXiv:1807.02478 (2018)

Download references

Acknowledgments

This work is supported by National Natural Science Foundation of China with Grant (NO. 61906099), Open fund project of Key Laboratory of urban natural resources monitoring and simulation, Ministry of natural resources (NO. KF-2019–04-011) and Suzhou Gusu Technology Venture Angel Program Project (NO. CYTS2018233).

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2021 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Sun, G., Li, Z., Li, H., Tang, X. (2021). Judicial Case Determination Methods Based on Event Tuple. In: Liu, Z., Wu, F., Das, S.K. (eds) Wireless Algorithms, Systems, and Applications. WASA 2021. Lecture Notes in Computer Science(), vol 12937. Springer, Cham. https://doi.org/10.1007/978-3-030-85928-2_19

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-85928-2_19

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-85927-5

  • Online ISBN: 978-3-030-85928-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics