{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T07:03:31Z","timestamp":1777705411184,"version":"3.51.4"},"reference-count":42,"publisher":"SAGE Publications","issue":"5","license":[{"start":{"date-parts":[[2021,4,1]],"date-time":"2021-04-01T00:00:00Z","timestamp":1617235200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":["journals.sagepub.com"],"crossmark-restriction":true},"short-container-title":["Journal of Intelligent &amp; Fuzzy Systems"],"published-print":{"date-parts":[[2021,11,17]]},"abstract":"<jats:p>\n                    Legal practitioners analyze relevant previous judgments to prepare favorable and advantageous arguments for an ongoing case. In Legal domain, recommender systems (RS) effectively identify and recommend referentially and\/or semantically relevant judgments. Due to the availability of enormous amounts of judgments, RS needs to compute pairwise similarity scores for all unique judgment pairs in advance, aiming to minimize the recommendation response time. This practice introduces the scalability issue as the number of pairs to be computed increases quadratically with the number of judgments i.e.,\n                    <jats:italic>O<\/jats:italic>\n                    \u00a0(\n                    <jats:italic>n<\/jats:italic>\n                    <jats:sup>2<\/jats:sup>\n                    ). However, there is a limited number of pairs consisting of strong relevance among the judgments. Therefore, it is insignificant to compute similarities for pairs consisting of trivial relevance between judgments. To address the scalability issue, this research proposes a graph clustering based novel Legal Document Recommendation System (LDRS) that forms clusters of referentially similar judgments and within those clusters find semantically relevant judgments. Hence, pairwise similarity scores are computed for each cluster to restrict search space within-cluster only instead of the entire corpus. Thus, the proposed LDRS severely reduces the number of similarity computations that enable large numbers of judgments to be handled. It exploits a highly scalable Louvain approach to cluster judgment citation network, and Doc2Vec to capture the semantic relevance among judgments within a cluster. The efficacy and efficiency of the proposed LDRS are evaluated and analyzed using the large real-life judgments of the Supreme Court of India. The experimental results demonstrate the encouraging performance of proposed LDRS in terms of Accuracy, F1-Scores, MCC Scores, and computational complexity, which validates the applicability for scalable recommender systems.\n                  <\/jats:p>","DOI":"10.3233\/jifs-189871","type":"journal-article","created":{"date-parts":[[2021,4,2]],"date-time":"2021-04-02T14:37:34Z","timestamp":1617374254000},"page":"5497-5509","update-policy":"https:\/\/doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":19,"title":["Legal document recommendation system: A cluster based pairwise similarity computation"],"prefix":"10.1177","volume":"41","author":[{"given":"Jenish","family":"Dhanani","sequence":"first","affiliation":[{"name":"Department of Computer Engineering, S.V. National Institute of Technology, Surat, India"}]},{"given":"Rupa","family":"Mehta","sequence":"additional","affiliation":[{"name":"Department of Computer Engineering, S.V. National Institute of Technology, Surat, India"}]},{"given":"Dipti","family":"Rana","sequence":"additional","affiliation":[{"name":"Department of Computer Engineering, S.V. National Institute of Technology, Surat, India"}]}],"member":"179","published-online":{"date-parts":[[2021,4]]},"reference":[{"key":"e_1_3_1_2_2","doi-asserted-by":"crossref","unstructured":"MandalA. ChakiR. SahaS. GhoshK. PalA. GhoshS. Measuring similarity among legal court case documents in: Proceedings of the 10th Annual ACM India Compute Conference ACM (2017) 1\u20139.","DOI":"10.1145\/3140107.3140119"},{"key":"e_1_3_1_3_2","doi-asserted-by":"crossref","unstructured":"KumarS. ReddyP.K. ReddyV.B. SuriM. Finding similar legal judgements under common law system in: International Workshop on Databases in Networked Information Systems Springer (2013) 103\u2013116.","DOI":"10.1007\/978-3-642-37134-9_9"},{"key":"e_1_3_1_4_2","doi-asserted-by":"crossref","unstructured":"RaghavK. ReddyP.B. ReddyV.B. ReddyP.K. Text and citations based analysis of legal judgments in: International Conference on Mining Intelligence and Knowledge Exploration Springer (2015) 449\u2013459.","DOI":"10.1007\/978-3-319-26832-3_42"},{"key":"e_1_3_1_5_2","doi-asserted-by":"crossref","unstructured":"KumarS. ReddyP.K. ReddyV.B. and SinghA. Similarity analysis of legal judgments in: Proceedings of the Fourth Annual ACM Bangalore Conference (2011) 1\u20134.","DOI":"10.1145\/1980422.1980439"},{"key":"e_1_3_1_6_2","doi-asserted-by":"crossref","unstructured":"NandaR. AdebayoK.J. Di CaroL. BoellaG. and RobaldoL. Legal Information Retrieval Using Topic Clustering and Neural Networks. in: COLIEE@ ICAIL (2017) 68\u201378.","DOI":"10.29007\/psgx"},{"key":"e_1_3_1_7_2","first-page":"993","article-title":"Latent dirichlet allocation","volume":"3","author":"Blei D.","year":"2003","unstructured":"BleiD., NgA. and JordanM., Latent dirichlet allocation, Journal of Machine Learning Research3(Jan) (2003), 993\u20131022.","journal-title":"Journal of Machine Learning Research"},{"key":"e_1_3_1_8_2","unstructured":"MikolovT. SutskeverI. ChenK. CorradoG.S. and DeanJ. Distributed representations of words and phrases and their compositionality in: Advances in Neural Information Processing Systems (2013) 3111\u20133119."},{"key":"e_1_3_1_9_2","unstructured":"MikolovT. ChenK. CorradoG. and DeanJ. Efficient estimation of word representations in vector space arXiv preprint arXiv:1301.3781 (2013)."},{"key":"e_1_3_1_10_2","unstructured":"LeQ. and MikolovT. Distributed representations of sentences and documents in: International conference on machine learning (2014) 1188\u20131196."},{"key":"e_1_3_1_11_2","doi-asserted-by":"publisher","DOI":"10.1093\/comnet\/cnx029"},{"issue":"10","key":"e_1_3_1_12_2","first-page":"883","article-title":"Exploratory Analysis of Legal Case Citation Data Using Node Embedding","volume":"13","author":"Lodha S.","year":"2019","unstructured":"LodhaS. and WaghR., Exploratory Analysis of Legal Case Citation Data Using Node Embedding, ICIC Express Letters13(10) (2019), 883\u2013889.","journal-title":"ICIC Express Letters"},{"key":"e_1_3_1_13_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10506-018-9224-2"},{"key":"e_1_3_1_14_2","doi-asserted-by":"crossref","unstructured":"SugathadasaK. AyeshaB. de SilvaN. PereraA.S. JayawardanaV. LakmalD. and PereraM. Legal document retrieval using document vector embeddings and deep learning in: Science and Information Conference Springer (2018) 160\u2013175.","DOI":"10.1007\/978-3-030-01177-2_12"},{"key":"e_1_3_1_15_2","doi-asserted-by":"crossref","unstructured":"LinJ. Brute force and indexed approaches to pairwise document similarity comparisons with Map Reduce in: Proceedings of the 32nd international ACM SIGIR conference on Research and development in information retrieval (2009) 155\u2013162.","DOI":"10.1145\/1571941.1571970"},{"key":"e_1_3_1_16_2","doi-asserted-by":"publisher","DOI":"10.1088\/1742-5468\/2008\/10\/P10008"},{"key":"e_1_3_1_17_2","unstructured":"LambiotteR. DelvenneJ.-C. and BarahonaM. Laplacian dynamics and multiscale modular structure in networks arXiv preprint arXiv:0812.1770 (2008)."},{"key":"e_1_3_1_18_2","doi-asserted-by":"publisher","DOI":"10.1186\/s12864-019-6413-7"},{"key":"e_1_3_1_19_2","doi-asserted-by":"publisher","DOI":"10.3390\/app9040743"},{"key":"e_1_3_1_20_2","doi-asserted-by":"crossref","unstructured":"ChakrabartiD. PatodiaN. BhattacharyaU. MitraI. RoyS. MandiJ. RoyN. and NandyP. Use of Artificial Intelligence to Analyse Risk in Legal Documents for a Better Decision Support in: TENCON 2018-2018 IEEE Region 10 Conference IEEE (2018) 683\u2013688.","DOI":"10.1109\/TENCON.2018.8650382"},{"key":"e_1_3_1_21_2","doi-asserted-by":"crossref","unstructured":"SugathadasaK. AyeshaB. Synergistic union of word2vec and lexicon for domain specific semantic similarity in: 2017 IEEE International Conference on Industrial and Information Systems (ICIIS) IEEE (2017) 1\u20136.","DOI":"10.1109\/ICIINFS.2017.8300343"},{"key":"e_1_3_1_22_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10506-018-9238-9"},{"key":"e_1_3_1_23_2","unstructured":"GuoC. LuM. and WeiW. An Improved LDATopic Modeling Method Based on Partition for Medium and Long Texts Annals of Data Science (2019) 1\u201314."},{"key":"e_1_3_1_24_2","doi-asserted-by":"crossref","unstructured":"KamkarhaghighiM. GultepeE. and MakrehchiM. Deep Learning for Document Representation in: Handbook of Deep Learning Applications Springer (2019) 101\u2013110.","DOI":"10.1007\/978-3-030-11479-4_5"},{"key":"e_1_3_1_25_2","unstructured":"KuppeveltD. and DijckG. Answering legal research questions about dutch case law with network analysis and visualization in: Legal Knowledge and Information Systems: JU-RIX 2017: The Thirtieth Annual Conference Vol. 302 IOS Press (2017) pp. 95\u2013100."},{"key":"e_1_3_1_26_2","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2913995"},{"key":"e_1_3_1_27_2","doi-asserted-by":"publisher","DOI":"10.1002\/asi.5090140103"},{"key":"e_1_3_1_28_2","doi-asserted-by":"publisher","DOI":"10.1002\/asi.4630240406"},{"key":"e_1_3_1_29_2","doi-asserted-by":"crossref","unstructured":"GroverA. and LeskovecJ. node2vec: Scalable feature learning for networks in: Proceedings of the 22nd ACM SIGKDD international conference on Knowledge discovery and data mining (2016) 855\u2013864.","DOI":"10.1145\/2939672.2939754"},{"key":"e_1_3_1_30_2","unstructured":"MihalceaR. and TarauP. Textrank: Bringing order into text in: Proceedings of the 2004 conference on empirical methods in natural language processing (2004) 404\u2013411."},{"key":"e_1_3_1_31_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipm.2019.04.002"},{"key":"e_1_3_1_32_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.jflm.2019.07.002"},{"issue":"1","key":"e_1_3_1_33_2","first-page":"27","article-title":"Legal documents clustering and summarization using hierarchical latent Dirichlet allocation","volume":"2","author":"Venkatesh R.K.","year":"2013","unstructured":"VenkateshR.K., Legal documents clustering and summarization using hierarchical latent Dirichlet allocation, IAES International Journal of Artificial Intelligence2(1) (2013), 27\u201335.","journal-title":"IAES International Journal of Artificial Intelligence"},{"key":"e_1_3_1_34_2","doi-asserted-by":"crossref","unstructured":"NerurkarP. ChandaneM. and BhirudS. A comparative analysis of community detection algorithms on social networks in: Computational Intelligence: Theories Applications and Future Directions-Volume I Springer (2019) 287\u2013298.","DOI":"10.1007\/978-981-13-1132-1_23"},{"key":"e_1_3_1_35_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.techfore.2018.07.019"},{"key":"e_1_3_1_36_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2020.106118"},{"key":"e_1_3_1_37_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2019.122058"},{"key":"e_1_3_1_38_2","doi-asserted-by":"publisher","DOI":"10.1038\/s41598-019-41695-z"},{"key":"e_1_3_1_39_2","first-page":"1","article-title":"A comparative analysis of community detection algorithms on artificial networks","volume":"6","author":"Yang Z.","year":"2016","unstructured":"YangZ., AlgesheimerR. and TessoneC.J., A comparative analysis of community detection algorithms on artificial networks, Scientific Reports6 (2016), 1\u201318.","journal-title":"Scientific Reports"},{"key":"e_1_3_1_40_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.jbusres.2019.11.025"},{"key":"e_1_3_1_41_2","doi-asserted-by":"crossref","unstructured":"AshiharaK. ChuC. RenoustB. OkuboN. TakemuraN. NakashimaY. and NagaharaH. Legal Information as a Complex Network: Improving Topic Modeling Through Homophily in: International Conference on Complex Networks and Their Applications Springer (2019) 28\u201339.","DOI":"10.1007\/978-3-030-36683-4_3"},{"key":"e_1_3_1_42_2","doi-asserted-by":"publisher","DOI":"10.1080\/00437956.1954.11659520"},{"key":"e_1_3_1_43_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2020.124341"}],"container-title":["Journal of Intelligent &amp; Fuzzy Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/JIFS-189871","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/full-xml\/10.3233\/JIFS-189871","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/JIFS-189871","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T09:43:45Z","timestamp":1777455825000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.3233\/JIFS-189871"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,4]]},"references-count":42,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2021,11,17]]}},"alternative-id":["10.3233\/JIFS-189871"],"URL":"https:\/\/doi.org\/10.3233\/jifs-189871","relation":{},"ISSN":["1064-1246","1875-8967"],"issn-type":[{"value":"1064-1246","type":"print"},{"value":"1875-8967","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,4]]}}}