{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,22]],"date-time":"2026-09-22T03:53:47Z","timestamp":1790049227048,"version":"4.0.1"},"reference-count":56,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2020,10,17]],"date-time":"2020-10-17T00:00:00Z","timestamp":1602892800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2020,10,17]],"date-time":"2020-10-17T00:00:00Z","timestamp":1602892800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Netw Sci"],"published-print":{"date-parts":[[2020,12]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>Topic modeling that can automatically assign topics to legal documents is very important in the domain of computational law. The relevance of the modeled topics strongly depends on the legal context they are used in. On the other hand, references to laws and prior cases are key elements for judges to rule on a case. Taken together, these references form a network, whose structure can be analysed with network analysis. However, the content of the referenced documents may not be always accessed. Even in that case, the reference structure itself shows that documents share latent similar characteristics. We propose to use this latent structure to improve topic modeling of law cases using document homophily. In this paper, we explore the use of homophily networks extracted from two types of references: prior cases and statute laws, to enhance topic modeling on legal case documents. We conduct in detail, an analysis on a dataset consisting of rich legal cases, i.e., the COLIEE dataset, to create these networks. The homophily networks consist of nodes for legal cases, and edges with weights for the two families of references between the case nodes. We further propose models to use the edge weights for topic modeling. In particular, we propose a cutting model and a weighting model to improve the relational topic model (RTM). The cutting model uses edges with weights higher than a threshold as document links in RTM; the weighting model uses the edge weights to weight the link probability function in RTM. The weights can be obtained either from the co-citations or from the cosine similarity based on an embedding of the homophily networks. Experiments show that the use of the homophily networks for topic modeling significantly outperforms previous studies, and the weighting model is more effective than the cutting model.<\/jats:p>","DOI":"10.1007\/s41109-020-00321-y","type":"journal-article","created":{"date-parts":[[2020,10,17]],"date-time":"2020-10-17T02:02:39Z","timestamp":1602900159000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Improving topic modeling through homophily for legal documents"],"prefix":"10.1007","volume":"5","author":[{"given":"Kazuki","family":"Ashihara","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Cheikh Brahim","family":"El Vaigh","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9848-6384","authenticated-orcid":false,"given":"Chenhui","family":"Chu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Benjamin","family":"Renoust","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Noriko","family":"Okubo","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Noriko","family":"Takemura","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yuta","family":"Nakashima","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hajime","family":"Nagahara","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2020,10,17]]},"reference":[{"key":"321_CR22","doi-asserted-by":"crossref","unstructured":"Ashihara K, Chu C, Renoust B, Okubo N, Takemura N, Nakashima Y, Nagahara H (2019) Legal information as a complex network: Improving topic modeling through homophily. In: Proceedings of the 8th international conference on complex networks and their applications, pp 28\u201339","DOI":"10.1007\/978-3-030-36683-4_3"},{"issue":"5916","key":"321_CR20","doi-asserted-by":"publisher","first-page":"892","DOI":"10.1126\/science.1165821","volume":"323","author":"SP Borgatti","year":"2009","unstructured":"Borgatti SP, Mehra A, Brass DJ, Labianca G (2009) Network analysis in the social sciences. Science 323(5916):892\u2013895","journal-title":"Science"},{"key":"321_CR29","unstructured":"Blei DM, McAuliffe JD (2007) Supervised topic models. In: Proceedings of the 20th international conference on neural information processing systems. NIPS\u201907, pp 121\u2013128. Curran Associates Inc., USA. http:\/\/dl.acm.org\/citation.cfm?id=2981562.2981578"},{"key":"321_CR28","doi-asserted-by":"publisher","unstructured":"Blei DM, Lafferty JD (2006) Dynamic topic models. In: Proceedings of the 23rd international conference on machine learning. ICML \u201906, pp 113\u2013120. ACM, New York, NY, USA. https:\/\/doi.org\/10.1145\/1143844.1143859","DOI":"10.1145\/1143844.1143859"},{"key":"321_CR27","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1214\/07-AOAS114","volume":"1","author":"D Blei","year":"2007","unstructured":"Blei D, Lafferty J (2007) A correlated topic model of science. Ann Appl Stat 1:17\u201335","journal-title":"Ann Appl Stat"},{"key":"321_CR26","first-page":"993","volume":"3","author":"DM Blei","year":"2003","unstructured":"Blei DM, Ng AY, Jordan MI (2003) Latent Dirichlet allocation. J Mach Learn Res 3:993\u20131022","journal-title":"J Mach Learn Res"},{"key":"321_CR37","doi-asserted-by":"publisher","first-page":"P10008","DOI":"10.1088\/1742-5468\/2008\/10\/P10008","volume":"10","author":"VD Blondel","year":"2008","unstructured":"Blondel VD, Guillaume J-L, Lambiotte R, Lefebvre E (2008) Fast unfolding of communities in large networks. J Stat Mech Theory Exp 10:P10008","journal-title":"J Stat Mech Theory Exp"},{"key":"321_CR36","doi-asserted-by":"crossref","unstructured":"Brochier R, Guille A, Velcin J (2020) Inductive document network embedding with topic-word attention. arXiv:2001.03369","DOI":"10.1007\/978-3-030-45439-5_22"},{"key":"321_CR18","unstructured":"Chang J, Blei DM (2009) Relational topic models for document networks. In: International conference on artificial intelligence and statistics, pp 81\u201388"},{"key":"321_CR23","unstructured":"Detyniecki M, Bouchon-meunier DB, Yager DR, Prade RH et al (2000) Mathematical aggregation operators and their application to video querying"},{"key":"321_CR32","doi-asserted-by":"publisher","unstructured":"Das R, Zaheer M, Dyer C (2015) Gaussian LDA for topic models with word embeddings. In: Proceedings of the 53rd annual meeting of the association for computational linguistics and the 7th international joint conference on natural language processing (vol 1: Long Papers). Association for Computational Linguistics, Beijing, pp 795\u2013804. https:\/\/doi.org\/10.3115\/v1\/P15-1077. https:\/\/www.aclweb.org\/anthology\/P15-1077","DOI":"10.3115\/v1\/P15-1077"},{"key":"321_CR33","doi-asserted-by":"crossref","unstructured":"Dieng AB, Ruiz FJR, Blei DM (2019) Topic modeling in embedding spaces. CoRR arXiv:1907.04907","DOI":"10.1162\/tacl_a_00325"},{"issue":"7","key":"321_CR50","doi-asserted-by":"publisher","first-page":"769","DOI":"10.1002\/andp.19163540702","volume":"49","author":"A Einstein","year":"1916","unstructured":"Einstein A et al (1916) The foundation of the general theory of relativity. Ann Phys 49(7):769\u2013822","journal-title":"Ann Phys"},{"issue":"3","key":"321_CR3","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1093\/pan\/mpm011","volume":"15","author":"JH Fowler","year":"2007","unstructured":"Fowler JH, Johnson TR, Spriggs JF, Jeon S, Wahlbeck PJ (2007) Network analysis and the law: measuring the legal importance of precedents at the US Supreme Court. Polit Anal 15(3):324\u2013346","journal-title":"Polit Anal"},{"key":"321_CR24","doi-asserted-by":"crossref","unstructured":"Grover A, Leskovec J (2016) node2vec: scalable feature learning for networks. In: Proceedings of the 22nd ACM SIGKDD international conference on knowledge discovery and data mining, pp 855\u2013864","DOI":"10.1145\/2939672.2939754"},{"issue":"2","key":"321_CR39","doi-asserted-by":"publisher","first-page":"795","DOI":"10.1016\/j.physa.2006.04.047","volume":"371","author":"J-L Guillaume","year":"2006","unstructured":"Guillaume J-L, Latapy M (2006) Bipartite graphs as models of complex networks. Physica A 371(2):795\u2013813","journal-title":"Physica A"},{"key":"321_CR48","unstructured":"Hamacher H (1976) On logical connectives of fuzzy statements. In: Proceedings of the 3rd European meeting cybernetics and systems"},{"issue":"46","key":"321_CR16","doi-asserted-by":"publisher","first-page":"16569","DOI":"10.1073\/pnas.0507655102","volume":"102","author":"JE Hirsch","year":"2005","unstructured":"Hirsch JE (2005) An index to quantify an individual\u2019s scientific research output. Proc Natl Acad Sci 102(46):16569\u201316572","journal-title":"Proc Natl Acad Sci"},{"key":"321_CR47","unstructured":"Hurley P (2005) A concise introduction to logic.\u00a0Cengage Learning"},{"key":"321_CR43","first-page":"547","volume":"37","author":"P Jaccard","year":"1901","unstructured":"Jaccard P (1901) \u00c9tude comparative de la distribution florale dans une portion des alpes et des jura. Bull Soc Vaudoise Sci Nat 37:547\u2013579","journal-title":"Bull Soc Vaudoise Sci Nat"},{"key":"321_CR1","unstructured":"Katz DM (2011) What is computation legal studies? University of Houston, workshop on law and computation"},{"key":"321_CR10","doi-asserted-by":"crossref","unstructured":"Katz DM, Bommarito MJ, Seaman J, Candeub A, Agichtein E (2011) Legal n-grams? A simple approach to track the \u2018evolution\u2019of legal language. In: Proceedings of JURIX","DOI":"10.2139\/ssrn.1971953"},{"issue":"3","key":"321_CR15","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/s10462-017-9566-2","volume":"51","author":"A Kanapala","year":"2019","unstructured":"Kanapala A, Pal S, Pamula R (2019) Text summarization from legal documents: a survey. Artif Intell Rev 51(3):371\u2013402","journal-title":"Artif Intell Rev"},{"issue":"4","key":"321_CR7","first-page":"23","volume":"6","author":"N Khanam","year":"2017","unstructured":"Khanam N, Wagh RS (2017) Application of network analysis for finding relatedness among legal documents by using case citation data. i-Manager\u0393\u00c7\u00d6s Journal on Information Technology 6(4):23","journal-title":"i-Manager\u0393\u00c7\u00d6s Journal on Information Technology"},{"issue":"5","key":"321_CR4","doi-asserted-by":"publisher","first-page":"980","DOI":"10.1016\/j.gloenvcha.2013.07.006","volume":"23","author":"RE Kim","year":"2013","unstructured":"Kim RE (2013) The emergent network structure of the multilateral environmental agreement system. Glob Environ Change 23(5):980\u2013991","journal-title":"Glob Environ Change"},{"issue":"5","key":"321_CR25","doi-asserted-by":"publisher","first-page":"604","DOI":"10.1145\/324133.324140","volume":"46","author":"JM Kleinberg","year":"1999","unstructured":"Kleinberg JM (1999) Authoritative sources in a hyperlinked environment. J ACM (JACM) 46(5):604\u2013632","journal-title":"J ACM (JACM)"},{"issue":"2","key":"321_CR6","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1093\/comnet\/cnx029","volume":"6","author":"M Koniaris","year":"2017","unstructured":"Koniaris M, Anagnostopoulos I, Vassiliou Y (2017) Network analysis in the legal domain: A complex model for european union legal sources. Journal of Complex Networks 6(2):243\u0393\u00c7\u00f4268","journal-title":"Journal of Complex Networks"},{"issue":"1","key":"321_CR9","first-page":"0209844","volume":"14","author":"B Lee","year":"2019","unstructured":"Lee B, Lee K-M, Yang J-S (2019) Network structure reveals patterns of legal complexity in human society: the case of the constitutional legal network. PLoS ONE 14(1):0209844","journal-title":"PLoS ONE"},{"key":"321_CR2","unstructured":"Lettieri N, Faro S (2012) Computational social science and its potential impact upon law. Eur J Law Technol 3(3)"},{"key":"321_CR8","doi-asserted-by":"crossref","unstructured":"Lettieri N, Faro S, Malandrino D, Faggiano A, Vestoso M (2018) Network, visualization, analytics. A tool allowing legal scholars to experimentally investigate EU case law, 543\u2013555","DOI":"10.1007\/978-3-030-00178-0_37"},{"key":"321_CR34","doi-asserted-by":"publisher","unstructured":"Liu Y, Niculescu-Mizil A, Gryc W (2009) Topic-link lda: joint models of topic and author community. In: Proceedings of the 26th annual international conference on machine learning. ICML \u201909. Association for Computing Machinery, New York, NY, USA, pp 665\u2013672. https:\/\/doi.org\/10.1145\/1553374.1553460","DOI":"10.1145\/1553374.1553460"},{"key":"321_CR42","unstructured":"Levi FW (1942) Finite geometrical systems: six public lectures Delivered in February, 1940, at the University of Calcutta. The University of Calcutta"},{"key":"321_CR51","unstructured":"Loper E, Bird S (2006) NLTK: the natural language toolkit. In: Proceedings of the annual meeting of the association for computational linguistics, pp 69\u201372. arXiv:0205028v1"},{"key":"321_CR11","doi-asserted-by":"crossref","unstructured":"Lu Q, Conrad JG, Al-Kofahi K, Keenan W (2011) Legal document clustering with built-in topic segmentation. In: Proceedings of the 20th ACM international conference on information and knowledge management, pp 383\u2013392","DOI":"10.1145\/2063576.2063636"},{"key":"321_CR45","doi-asserted-by":"crossref","unstructured":"McInnes L, Healy J, Melville J (2018) Umap: uniform manifold approximation and projection for dimension reduction. arXiv preprint arXiv:1802.03426","DOI":"10.21105\/joss.00861"},{"issue":"1","key":"321_CR19","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1146\/annurev.soc.27.1.415","volume":"27","author":"M McPherson","year":"2001","unstructured":"McPherson M, Smith-Lovin L, Cook JM (2001) Birds of a feather: homophily in social networks. Annu Rev Sociol 27(1):415\u2013444","journal-title":"Annu Rev Sociol"},{"key":"321_CR44","unstructured":"Mikolov T, Sutskever I, Chen K, Corrado GS, Dean J (2013) Distributed representations of words and phrases and their compositionality. In: Proceedings of advances in neural information processing systems, pp 3111\u20133119"},{"key":"321_CR55","unstructured":"Mimno D, Wallach HM, Talley E, Leenders M, McCallum A (2011) Optimizing semantic coherence in topic models. In: Proceedings of the conference on empirical methods in natural language processing. Association for Computational Linguistics, pp 262\u2013272"},{"issue":"23","key":"321_CR38","doi-asserted-by":"publisher","first-page":"8577","DOI":"10.1073\/pnas.0601602103","volume":"103","author":"ME Newman","year":"2006","unstructured":"Newman ME (2006) Modularity and community structure in networks. Proc Natl Acad Sci 103(23):8577\u20138582","journal-title":"Proc Natl Acad Sci"},{"key":"321_CR52","unstructured":"Newman D, Lau JH, Grieser K, Baldwin T (2010) Automatic evaluation of topic coherence. In: Proceedings of the annual conference of the North American Chapter of the Association for Computational Linguistics, pp 100\u2013108"},{"key":"321_CR30","doi-asserted-by":"publisher","unstructured":"Nguyen V-A, Boyd-Graber J, Resnik P, Miler K (2015) Tea party in the house: a hierarchical ideal point topic model and its application to republican legislators in the 112th congress. In: Proceedings of the 53rd annual meeting of the association for computational linguistics and the 7th international joint conference on natural language processing (vol 1: Long Papers). Association for Computational Linguistics, Beijing, pp 1438\u20131448. https:\/\/doi.org\/10.3115\/v1\/P15-1139","DOI":"10.3115\/v1\/P15-1139"},{"key":"321_CR12","unstructured":"O\u2019Neill J, Robin C, O\u2019Brien L, Buitelaar P (2016) An analysis of topic modelling for legislative texts. In: CEUR Workshop Proceedings"},{"issue":"3","key":"321_CR5","doi-asserted-by":"publisher","first-page":"547","DOI":"10.1017\/S0003055414000276","volume":"108","author":"KJ Pelc","year":"2014","unstructured":"Pelc KJ (2014) The politics of precedent in international law: a social network application. Am Polit Sci Rev 108(3):547\u2013564","journal-title":"Am Polit Sci Rev"},{"key":"321_CR53","doi-asserted-by":"crossref","unstructured":"Pennington J, Socher R, Manning C (2014) GloVe: global vectors for word representation. In: Proceedings of the conference on empirical methods in natural language processing, pp 1532\u20131543. arXiv:1504.06654","DOI":"10.3115\/v1\/D14-1162"},{"key":"321_CR40","unstructured":"Renoust B (2013) Analysis and visualisation of edge entanglement in multiplex networks. University of Bordeaux"},{"key":"321_CR41","unstructured":"Renoust B (2014) Voisinage et intrication dans les r\u00e9seaux multiplexes. In: Mod\u00e8les et Analyses R\u00e9seau: Approches Math\u00e9matiques et Informatiques (MARAMI) 2014, Proceedings RMPD"},{"key":"321_CR21","doi-asserted-by":"crossref","unstructured":"Renoust B, Melan\u00e7on G, Viaud M-L (2014) Entanglement in multiplex networks: understanding group cohesion in homophily networks, pp 89\u2013117","DOI":"10.1007\/978-3-319-12188-8_5"},{"key":"321_CR56","doi-asserted-by":"crossref","unstructured":"Renoust B, Melan\u00e7on G, Munzner T (2015) Detangler: visual analytics for multiplex networks. In: Computer graphics forum, vol 34. Wiley, pp 321\u2013330","DOI":"10.1111\/cgf.12644"},{"issue":"1","key":"321_CR17","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/s41109-017-0035-2","volume":"2","author":"B Renoust","year":"2017","unstructured":"Renoust B, Claver V, Baffier J-F (2017) Multiplex flows in citation networks. Appl Netw Sci 2(1):23","journal-title":"Appl Netw Sci"},{"key":"321_CR54","doi-asserted-by":"crossref","unstructured":"R\u00f6der M, Both A, Hinneburg A (2015) Exploring the space of topic coherence measures. In: Proceedings of the Eighth ACM international conference on web search and data mining, pp 399\u2013408","DOI":"10.1145\/2684822.2685324"},{"key":"321_CR46","unstructured":"Schweizer B, Sklar A (2011) Probabilistic metric spaces.\u00a0Dover Publications"},{"key":"321_CR31","doi-asserted-by":"publisher","unstructured":"Wang C, Blei DM (2011) Collaborative topic modeling for recommending scientific articles. In: Proceedings of the 17th ACM SIGKDD international conference on knowledge discovery and data mining. KDD \u201911, pp 448\u2013456. ACM, New York, NY, USA. https:\/\/doi.org\/10.1145\/2020408.2020480","DOI":"10.1145\/2020408.2020480"},{"key":"321_CR13","doi-asserted-by":"crossref","unstructured":"Wang Y, Ge J, Zhou Y, Feng Y, Li C, Li Z, Zhou X, Luo B (2017) Topic model based text similarity measure for chinese judgment document. In: International conference of pioneering computer scientists, engineers and educators. Springer, pp 42\u201354","DOI":"10.1007\/978-981-10-6388-6_4"},{"issue":"3","key":"321_CR49","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1016\/0165-0114(80)90013-5","volume":"4","author":"RR Yager","year":"1980","unstructured":"Yager RR (1980) On a general class of fuzzy connectives. Fuzzy Sets Syst 4(3):235\u2013242","journal-title":"Fuzzy Sets Syst"},{"key":"321_CR14","unstructured":"Yoshioka M, Kano Y, Kiyota N, Satoh K (2018) \u2018Overview of Japanese statute law retrieval and entailment task at coliee-2018\u2019. In: Twelfth international workshop on Juris-informatics (JURISIN 2018)"},{"key":"321_CR35","doi-asserted-by":"publisher","unstructured":"Zhu Y, Yan X, Getoor L, Moore C (2013) Scalable text and link analysis with mixed-topic link models. In: Proceedings of the 19th ACM SIGKDD international conference on knowledge discovery and data mining. KDD \u201913. Association for Computing Machinery, New York, NY, USA, pp 473\u2013481. https:\/\/doi.org\/10.1145\/2487575.2487693","DOI":"10.1145\/2487575.2487693"}],"container-title":["Applied Network Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41109-020-00321-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s41109-020-00321-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41109-020-00321-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,16]],"date-time":"2021-10-16T21:52:24Z","timestamp":1634421144000},"score":1,"resource":{"primary":{"URL":"https:\/\/appliednetsci.springeropen.com\/articles\/10.1007\/s41109-020-00321-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,10,17]]},"references-count":56,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2020,12]]}},"alternative-id":["321"],"URL":"https:\/\/doi.org\/10.1007\/s41109-020-00321-y","relation":{},"ISSN":["2364-8228"],"issn-type":[{"value":"2364-8228","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,10,17]]},"assertion":[{"value":"3 March 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 October 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 October 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The authors declare that they have no competing interests.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"77"}}