Ranking judicial branches using clustering algorithm

Document Type : Original Scientific Paper

Authors

1 Judicial Department of Shahrood County‎, ‎Semnan‎, ‎Iran

2 Judicial Research Institute‎, ‎Tehran‎, ‎Iran

Abstract

The performance of judiciary branches is evaluated based on specific indicators determined by the Statistics and Information Technology Center of Judiciary‎. ‎These indicators‎, ‎which are usually documents recorded in court cases‎, ‎have a specific administrative or judicial score for the branch‎, ‎and by calculating the total scores‎, ‎the performance of the branches is evaluated‎. ‎However‎, ‎with the expansion of these indicators‎, ‎ranking and evaluating branch performance has become more complex‎. ‎In this article‎, ‎clustering is used as one of the most important data mining tools to evaluate branch performance‎. ‎By identifying similar branches‎, ‎examining branches‎, ‎and facing upcoming challenges more effectively‎, ‎more effective decisions can be made in the judiciary system‎. ‎Here‎, ‎to organize 19 law branches based on 49 different administrative and judicial indicators‎, ‎the K-means clustering algorithm is applied based on two criteria of Euclidean dissimilarity distance and random forests‎. ‎In addition‎, ‎the Dunn index is used to evaluate clustering‎. ‎The value of this index is calculated as 0.82 by applying the dissimilarity of random forests‎, ‎indicating the successful performance of the algorithm used in determining similar branches.

Keywords

Main Subjects


Ahmadi, M. (2018). Cluster analysis and performance evaluation of bank branches using robust factor analysis and data envelopment analysis. In Proceedings of the 2nd National Conference on Advances in Electrical, Computer, and Biomedical Engineering (In Persian), Cambridge University Press.
Aminzadeh, F. and Minaii, B. (2008). Using clustering for crime characterization in the judiciary. In Proceedings of the 2nd Iranian Data Mining Conference (In Persian).
Bicego, M. (2023). DisRFC: a dissimilarity-based random forest clustering approach. Pattern Recognition, 133:109036.
Breiman, L. (2001). Random forests. Machine Learning, 45:5–32.
Chen, Y., Song, J., Huang, C. and Li, C. (2020). An improved K-means algorithm for detecting malicious nodes in wireless sensor networks. Ad Hoc Networks, 95:102040.
Dalmaijer, E.S., Nord, C.L. and Astle, D.E. (2022). Statistical power for cluster analysis. BMC Bioinformatics, 23(1):205.
Dunn, J.C. (1974). Well-separated clusters and optimal fuzzy partitions. Journal of Cybernetics, 4(1):95–104.
Ester, M., Kriegel, H.P., Sander, J. and Xu, X. (1996). A density-based algorithm for discovering clusters in large spatial databases with noise. In KDD-96 Proceedings, 96(34):226–231.
Farhadi, Z. and Shahsavani, D. (2015). Clustering of gene expression data by random forest dissimilarity. Razi Journal of Medical Sciences, 22(136):109–118.
Farzammehr, M.A. (2021). Application of hierarchical clustering on principal components to evaluate the performance of justice system by judicial indicators. Journal of Statistical Modelling: Theory and Applications, 2(2):143–158.
García, S., Fernández, A., Luengo, J. and Herrera, F. (2018). Advanced nonparametric tests for multiple comparisons in the design of experiments in computational intelligence and data mining: Experimental analysis of power. Information Sciences, 180(10):2044–2064.
Handl, J., Knowles, K. and Kell, D. (2005). Computational cluster validation in post-genomic data analysis. Bioinformatics, 21(15):3201–3212.
Hernández-León, P. and Caro, M.A. (2022). Cluster-based multidimensional scaling embedding tool for data visualization. Physica Scripta, 99(6):066004.
Herrera-Restrepo, O., Triantis, K., Seaver, W.L., Paradi, J.C. and Zhu, H. (2016). Bank Branch Operational Performance: A Robust Multivariate and Clustering Approach. Expert Systems With Applications, 50:107–119.
Johnson, R. and Brown, L. (2021). Clustering court branches for performance evaluation: A case study. Journal of Legal Analytics, 8(2):123–142.
Likas, A., Vlassis, N. and Verbeek, J.J. (2003). The global $K$-means clustering algorithm. Pattern Recognition, 36(2):451–461.
Lloyd, S.P. (1982). Least squares quantization in PCM. IEEE Transactions on Information Theory, 28:129–136.
Rokach, L. and Maimon, O. (2005). Clustering methods. Data Mining and Knowledge Discovery Handbook, 321–352.
Ros, F., Riad, R. and Guillaume, S. (2023). PDBI: a partitioning Davies-Bouldin index for clustering evaluation. Neurocomputing, 528:178–199.
Smith, A., Jones, B. and Williams, C. (2019). Hierarchical clustering of court branch performance indicators. In Proceedings of the International Conference on Data Mining, 256–263.
Tong, H., Han, J. and Pei, J. (2022). Data Mining: Concepts and Techniques. Netherlands: Elsevier Science.
Yu, J., Zhu, L., Qin, R., Zhang, Z., Li, L. and Huang, Y. (2021). Combining K-means clustering and random forest to evaluate the gas content of coalbed methane reservoirs. Geofluids, 2021(1):9321565.