ranking judicial branches using clustering algorithm

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.