Ranking judicial branches using clustering algorithm

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

Farhadi Zohreh; Farzammehr Mohadeseh Alsadat

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: JOURNAL OF STATISTICAL MODELLING: THEORY AND APPLICATIONS Year:2024 | Volume:5 | Issue:1 Page(s): 53-64

Download Full-Text

View:

Download:

Cites:

Information Journal Paper

Title

Ranking judicial branches using clustering algorithm

Author(s)

Farhadi Zohreh | Farzammehr Mohadeseh Alsadat | Issue Writer Certificate

Keywords

Administrative Score

‎Branch Performance Evaluation

‎Clustering

‎Judicial Score

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.

Multimedia

No record.

Cites

No record.

References

No record.

Cite

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans