{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T11:48:09Z","timestamp":1753876089048,"version":"3.41.2"},"reference-count":91,"publisher":"Oxford University Press (OUP)","issue":"6","license":[{"start":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T00:00:00Z","timestamp":1729641600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/academic.oup.com\/pages\/standard-publication-reuse-rights"}],"funder":[{"DOI":"10.13039\/501100001665","name":"Agence Nationale de la Recherche","doi-asserted-by":"publisher","award":["ANR-21-CE23-0010"],"award-info":[{"award-number":["ANR-21-CE23-0010"]}],"id":[{"id":"10.13039\/501100001665","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024,10,23]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:p>Modelling information from complex systems such as humans social interaction or words co-occurrences in our languages can help to understand how these systems are organized and function. Such systems can be modelled by networks, and network theory provides a useful set of methods to analyze them. Among these methods, graph embedding is a powerful tool to summarize the interactions and topology of a network in a vectorized feature space. When used in input of machine learning algorithms, embedding vectors help with common graph problems such as link prediction, graph matching, etc In Natural Language Processing (NLP), such a vectorization process is also employed. Word embedding has the goal of representing the sense of words, extracting it from large text corpora. Despite differences in the structure of information in input of embedding algorithms, many graph embedding approaches are adapted and inspired from methods in NLP. Limits of these methods are observed in both domains. Most of these methods require long and resource greedy training. Another downside to most methods is that they are black-box, from which understanding how the information is structured is rather complex. Interpretability of a model allows understanding how the vector space is structured without the need for external information, and thus can be audited more easily. With both these limitations in mind, we propose a novel framework to efficiently embed network vertices in an interpretable vector space. Our Lower Dimension Bipartite Framework (LDBGF) leverages the bipartite projection of a network using cliques to reduce dimensionality. Along with LDBGF, we introduce two implementations of this framework that rely on communities instead of cliques: SINr-NR and SINr-MF. We show that SINr-MF can perform well on classical graphs and SINr-NR can produce high-quality graph and word embeddings that are interpretable and stable across runs.<\/jats:p>","DOI":"10.1093\/comnet\/cnae034","type":"journal-article","created":{"date-parts":[[2024,11,5]],"date-time":"2024-11-05T13:23:03Z","timestamp":1730812983000},"source":"Crossref","is-referenced-by-count":1,"title":["From communities to interpretable network and word embedding: an unified approach"],"prefix":"10.1093","volume":"12","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9610-3191","authenticated-orcid":false,"given":"Thibault","family":"Prouteau","sequence":"first","affiliation":[{"name":"Universit\u00e9 du Mans, Laboratoire d\u2019Informatique de l\u2019Universit\u00e9 du Mans (LIUM) , Avenue Olivier Messiaen , 72085 Le Mans CEDEX 9,","place":["France"]}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6150-1939","authenticated-orcid":false,"given":"Nicolas","family":"Dugu\u00e9","sequence":"additional","affiliation":[{"name":"Universit\u00e9 du Mans, Laboratoire d\u2019Informatique de l\u2019Universit\u00e9 du Mans (LIUM) , Avenue Olivier Messiaen , 72085 Le Mans CEDEX 9,","place":["France"]}]},{"given":"Simon","family":"Guillot","sequence":"additional","affiliation":[{"name":"Universit\u00e9 du Mans, Laboratoire d\u2019Informatique de l\u2019Universit\u00e9 du Mans (LIUM) , Avenue Olivier Messiaen , 72085 Le Mans CEDEX 9,","place":["France"]},{"name":"INaLCO, ERTIM , 65 rue des Grands Moulins , 75214 Paris,","place":["France"]}]}],"member":"286","published-online":{"date-parts":[[2024,11,5]]},"reference":[{"key":"2024110513592826200_cnae034-B1","first-page":"701","volume-title":"DeepWalk: online learning of social representations. SIGKDD","author":"Perozzi","year":"2014"},{"key":"2024110513592826200_cnae034-B2","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1145\/3110025.3110086","volume-title":"ASONAM","author":"Perozzi","year":"2017"},{"key":"2024110513592826200_cnae034-B3","first-page":"1105","volume-title":"SIGKDD","author":"Ou","year":"2016"},{"key":"2024110513592826200_cnae034-B4","first-page":"539","volume-title":"WWW","author":"Tsitsulin","year":"2018"},{"key":"2024110513592826200_cnae034-B5","first-page":"43","volume-title":"LouvainNE: hierarchical Louvain method for high quality and scalable network embedding. WSDM","author":"Bhowmick","year":"2020"},{"key":"2024110513592826200_cnae034-B6","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1080\/00437956.1954.11659520","article-title":"Distributional structure","volume":"10","author":"Harris","year":"1954","journal-title":"Word"},{"volume-title":"Efficient estimation of word representations in vector space","year":"2013","author":"Mikolov","key":"2024110513592826200_cnae034-B7"},{"key":"2024110513592826200_cnae034-B8","first-page":"1067","volume-title":"International World Wide Web Conferences Steering Committee","author":"Tang","year":"2015"},{"key":"2024110513592826200_cnae034-B9","first-page":"2111","volume-title":"IJCAI","author":"Yang","year":"2015"},{"key":"2024110513592826200_cnae034-B10","doi-asserted-by":"crossref","first-page":"13693","DOI":"10.1609\/aaai.v34i09.7123","article-title":"Energy and policy considerations for modern deep learning research","volume":"34","author":"Strubell","year":"2020","journal-title":"Proceedings of the AAAI Conference on Artificial Intelligence, New York, USA. Palo Alto, USA: AAAI Press"},{"key":"2024110513592826200_cnae034-B11","doi-asserted-by":"crossref","first-page":"2100707","DOI":"10.1002\/advs.202100707","article-title":"Green algorithms: quantifying the carbon footprint of computation","volume":"8","author":"Lannelongue","year":"2021","journal-title":"Adv. Sci"},{"issue":"10350","key":"2024110513592826200_cnae034-B12","article-title":"Carbon emissions and large neural network training","volume":"2104","author":"Patterson","year":"2021","journal-title":"CoRR abs"},{"key":"2024110513592826200_cnae034-B13","doi-asserted-by":"crossref","first-page":"206","DOI":"10.1038\/s42256-019-0048-x","article-title":"Stop explaining black box machine learning models for high stakes decisions and use interpretable models instead","volume":"1","author":"Rudin","year":"2019","journal-title":"Nat. Mach. Intell"},{"key":"2024110513592826200_cnae034-B14","first-page":"8521","volume-title":"ACL","author":"N\u00e9v\u00e9ol","year":"2022"},{"key":"2024110513592826200_cnae034-B15","first-page":"11806","volume-title":"ACL","author":"Kim","year":"2023"},{"year":"2022","author":"Choudhary","key":"2024110513592826200_cnae034-B16"},{"key":"2024110513592826200_cnae034-B17","first-page":"1933","volume-title":"COLING","author":"Murphy","year":"2012"},{"key":"2024110513592826200_cnae034-B18","first-page":"1532","volume-title":"EMNLP","author":"Pennington","year":"2014"},{"key":"2024110513592826200_cnae034-B19","first-page":"211","article-title":"Improving distributional similarity with lessons learned from word embeddings","volume":"3","author":"Levy","year":"2015","journal-title":"ACL"},{"key":"2024110513592826200_cnae034-B20","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1162\/tacl_a_00051","article-title":"Enriching word vectors with subword information","volume":"5","author":"Bojanowski","year":"2017","journal-title":"Trans. Assoc. Comput. Linguist"},{"key":"2024110513592826200_cnae034-B21","first-page":"151","volume-title":"COLING","author":"Tian","year":"2014"},{"key":"2024110513592826200_cnae034-B22","first-page":"4171","volume-title":"NAACL-HLT","author":"Devlin","year":"2018"},{"year":"2019","author":"Liu","key":"2024110513592826200_cnae034-B23"},{"year":"2020","author":"Raffel","key":"2024110513592826200_cnae034-B24"},{"key":"2024110513592826200_cnae034-B25","first-page":"1877","article-title":"Language models are few-shot learners","volume":"33","author":"Brown","year":"2020","journal-title":"Neurips"},{"year":"2022","author":"Neelakantan","key":"2024110513592826200_cnae034-B26"},{"key":"2024110513592826200_cnae034-B27","doi-asserted-by":"crossref","first-page":"2319","DOI":"10.1126\/science.290.5500.2319","article-title":"A global geometric framework for nonlinear dimensionality reduction","volume":"290","author":"Tenenbaum","year":"2000","journal-title":"Science"},{"key":"2024110513592826200_cnae034-B28","doi-asserted-by":"crossref","first-page":"2323","DOI":"10.1126\/science.290.5500.2323","article-title":"Nonlinear dimensionality reduction by locally linear embedding","volume":"290","author":"Roweis","year":"2000","journal-title":"Science"},{"key":"2024110513592826200_cnae034-B29","article-title":"Laplacian eigenmaps and spectral techniques for embedding and clustering","volume":"14","author":"Belkin","year":"2001","journal-title":"Adv. Neural Inf. Process. Syst"},{"key":"2024110513592826200_cnae034-B30","article-title":"node2vec: scalable feature learning for networks","author":"Grover","year":"2016","journal-title":"CoRR, abs\/1607.00653"},{"volume-title":"Neural Information Processing Systems Foundation","year":"2014","author":"Levy","key":"2024110513592826200_cnae034-B31"},{"key":"2024110513592826200_cnae034-B32","first-page":"891","volume-title":"CIKM","author":"Cao","year":"2015"},{"key":"2024110513592826200_cnae034-B33","doi-asserted-by":"crossref","first-page":"162","DOI":"10.1016\/j.neucom.2015.07.150","article-title":"Online graph regularized non-negative matrix factorization for large-scale datasets","volume":"204","author":"Liu","year":"2016","journal-title":"Neurocomputing"},{"first-page":"2587","year":"2019","author":"Brochier","key":"2024110513592826200_cnae034-B34"},{"year":"2017","author":"Wang","key":"2024110513592826200_cnae034-B35"},{"year":"2019","author":"Rozemberczki","key":"2024110513592826200_cnae034-B36"},{"key":"2024110513592826200_cnae034-B37","first-page":"1225","volume-title":"SIGKDD","author":"Wang","year":"2016"},{"key":"2024110513592826200_cnae034-B38","article-title":"Deep neural networks for learning graph representations","author":"Cao","year":"2016","journal-title":"Proceedings of the AAAI Conference on Artificial Intelligence, Phoenix, USA. Palo Alto, USA: AAAI Press, Vol. 30"},{"first-page":"e357","year":"2021","author":"Makarov","key":"2024110513592826200_cnae034-B39"},{"first-page":"97","year":"2016","author":"Ribeiro","key":"2024110513592826200_cnae034-B40"},{"key":"2024110513592826200_cnae034-B41","first-page":"4768","article-title":"A unified approach to interpreting model predictions","volume":"30","author":"Lundberg","year":"2017","journal-title":"Adv. Neural Inf. Process. Syst"},{"year":"2021","author":"Broniatowski","key":"2024110513592826200_cnae034-B42"},{"key":"2024110513592826200_cnae034-B43","article-title":"SPINE: SParse Interpretable Neural Embeddings","author":"Subramanian","year":"2018","journal-title":"Thirty-Second AAAI Conference on Artificial Intelligence. New Orleans, USA. Palo Alto, USA: AAAI Press"},{"key":"2024110513592826200_cnae034-B44","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1016\/0010-0285(77)90016-0","article-title":"Hierarchical structure in perceptual representation","volume":"9","author":"Palmer","year":"1977","journal-title":"Cognit. Psychol"},{"key":"2024110513592826200_cnae034-B45","doi-asserted-by":"crossref","first-page":"788","DOI":"10.1038\/44565","article-title":"Learning the parts of objects by nonnegative matrix factorization","volume":"401","author":"Lee","year":"1999","journal-title":"Nature"},{"key":"2024110513592826200_cnae034-B46","first-page":"1491","volume-title":"Sparse overcomplete word vector representations","author":"Faruqui","year":"2015"},{"key":"2024110513592826200_cnae034-B47","first-page":"5692","volume-title":"Word2Sense: sparse interpretable word embeddings","author":"Panigrahi","year":"2019"},{"volume-title":"Interpretable node embeddings with mincut loss. Learning and Reasoning with Graph-Structured Representations Workshop-ICML","year":"2019","author":"Duong","key":"2024110513592826200_cnae034-B48"},{"key":"2024110513592826200_cnae034-B49","first-page":"1","volume-title":"IJCNN","author":"Serra","year":"2021"},{"key":"2024110513592826200_cnae034-B50","first-page":"325","volume-title":"SINr: fast computing of sparse interpretable node representations is not a","author":"Prouteau","year":"2021"},{"key":"2024110513592826200_cnae034-B51","doi-asserted-by":"crossref","first-page":"P10008","DOI":"10.1088\/1742-5468\/2008\/10\/P10008","article-title":"Fast unfolding of communities in large networks","author":"Blondel","year":"2008","journal-title":"J. Stat. Mech. Theory Exp"},{"key":"2024110513592826200_cnae034-B52","first-page":"4414","volume-title":"LREC","author":"Prouteau","year":"2022"},{"key":"2024110513592826200_cnae034-B53","first-page":"725","volume-title":"International Conference on Web Intelligence and Intelligent Agent Technology","author":"Chen","year":"2008"},{"key":"2024110513592826200_cnae034-B54","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/j.ipl.2004.03.007","article-title":"Bipartite structure of all complex networks","volume":"90","author":"Guillaume","year":"2004","journal-title":"Inf. Process. Lett"},{"key":"2024110513592826200_cnae034-B55","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/0012-365X(88)90197-5","article-title":"Clique partitions and clique coverings","volume":"72","author":"Erdos","year":"1988","journal-title":"Discret. Math"},{"key":"2024110513592826200_cnae034-B56","doi-asserted-by":"crossref","first-page":"7821","DOI":"10.1073\/pnas.122653799","article-title":"Community structure in social and biological networks","volume":"99","author":"Girvan","year":"2002","journal-title":"Proc. Natl. Acad. Sci. USA"},{"key":"2024110513592826200_cnae034-B57","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1073\/pnas.0605965104","article-title":"Resolution limit in community detection","volume":"104","author":"Fortunato","year":"2007","journal-title":"Proc. Natl. Acad. Sci. USA"},{"first-page":"125","year":"2013","author":"Lambiotte","key":"2024110513592826200_cnae034-B58"},{"key":"2024110513592826200_cnae034-B59","article-title":"Near linear time algorithm to detect community structures in large-scale networks","volume":"036106","author":"Raghavan","year":"2007","journal-title":"Phys. Rev. E Stat. Nonlinear Soft Matter Phys"},{"key":"2024110513592826200_cnae034-B60","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/978-3-319-10377-8_1","article-title":"Community detection and visualization of networks with the map equation framework","author":"Bohlin","year":"2014","journal-title":"Measuring Scholarly Impact Methods Pract"},{"key":"2024110513592826200_cnae034-B61","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1371\/journal.pone.0018961","article-title":"Finding statistically significant communities in networks","volume":"6","author":"Lancichinetti","year":"2011","journal-title":"PLoS ONE"},{"key":"2024110513592826200_cnae034-B62","first-page":"107","volume-title":"Complex Networks and Their Applications","author":"Dugu\u00e9","year":"2019"},{"issue":"1\u20138","key":"2024110513592826200_cnae034-B63","article-title":"Characterizing the community structure of complex networks","volume":"5","author":"Lancichinetti","year":"2010","journal-title":"PLoS ONE"},{"key":"2024110513592826200_cnae034-B64","doi-asserted-by":"crossref","first-page":"508","DOI":"10.1017\/nws.2016.20","article-title":"NetworKit: an interactive tool suite for high-performance network analysis","volume":"4","author":"Staudt","year":"2014","journal-title":"Network Science"},{"key":"2024110513592826200_cnae034-B65","first-page":"81","volume-title":"Complex Networks","author":"Sinha","year":"2019"},{"key":"2024110513592826200_cnae034-B66","first-page":"395","volume-title":"ASoNAM\u201917","author":"Dao","year":"2017"},{"key":"2024110513592826200_cnae034-B67","first-page":"45","volume-title":"WWW\u201918","author":"Chakraborty","year":"2018"},{"key":"2024110513592826200_cnae034-B68","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1093\/comnet\/cnt012","article-title":"Community detection: effective evaluation on large social networks","volume":"2","author":"Lee","year":"2014","journal-title":"J. Complex Net"},{"key":"2024110513592826200_cnae034-B69","doi-asserted-by":"crossref","first-page":"e1602548","DOI":"10.1126\/sciadv.1602548","article-title":"The ground truth about metadata and community detection in networks","volume":"3","author":"Peel","year":"2017","journal-title":"Sci. Adv"},{"key":"2024110513592826200_cnae034-B70","doi-asserted-by":"crossref","first-page":"888","DOI":"10.1109\/34.868688","article-title":"Normalized cuts and image segmentation","volume":"22","author":"Shi","year":"2000","journal-title":"IEEE Trans. Pattern Anal. Machine Intell"},{"key":"2024110513592826200_cnae034-B71","doi-asserted-by":"crossref","first-page":"033015","DOI":"10.1088\/1367-2630\/11\/3\/033015","article-title":"Detecting the overlapping and hierarchical community structure in complex networks","volume":"11","author":"Lancichinetti","year":"2009","journal-title":"N. J. Phys"},{"key":"2024110513592826200_cnae034-B72","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/S0169-7552(98)00110-X","article-title":"The anatomy of a large-scale hypertextual web search engine","volume":"30","author":"Brin","year":"1998","journal-title":"Comput. Netw. ISDN Syst"},{"first-page":"971","year":"2022","author":"Austin","key":"2024110513592826200_cnae034-B73"},{"key":"2024110513592826200_cnae034-B74","article-title":"The Open ANC (OANC)","author":"Nancy","year":"2011","journal-title":"ORTOLANG"},{"year":"2007","author":"Consortium","key":"2024110513592826200_cnae034-B75"},{"volume-title":"The Measurement of Meaning","year":"1957","author":"Osgood","key":"2024110513592826200_cnae034-B76"},{"key":"2024110513592826200_cnae034-B77","doi-asserted-by":"crossref","first-page":"627","DOI":"10.1145\/365628.365657","article-title":"Contextual correlates of synonymy","volume":"8","author":"Rubenstein","year":"1965","journal-title":"Commun. ACM"},{"key":"2024110513592826200_cnae034-B78","first-page":"238","volume-title":"ACL","author":"Baroni","year":"2014"},{"key":"2024110513592826200_cnae034-B79","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1613\/jair.4135","article-title":"Multimodal distributional semantics","volume":"49","author":"Bruni","year":"2014","journal-title":"J. Artif. Intell. Res"},{"first-page":"406","year":"2001","author":"Finkelstein","key":"2024110513592826200_cnae034-B80"},{"volume-title":"Improving word representations via global context and multipleword prototypes. ACL, Jeju Island, Korea","year":"2012","author":"Huang","key":"2024110513592826200_cnae034-B81"},{"key":"2024110513592826200_cnae034-B82","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1145\/219717.219748","article-title":"WordNet: a lexical database for English","volume":"38","author":"Miller","year":"1995","journal-title":"Commun. ACM"},{"year":"2005","author":"Almuhareb","key":"2024110513592826200_cnae034-B83"},{"first-page":"1","year":"2011","author":"Baroni","key":"2024110513592826200_cnae034-B84"},{"year":"2008","author":"ESSLLI","key":"2024110513592826200_cnae034-B85"},{"year":"2020","author":"Pierrejean","key":"2024110513592826200_cnae034-B86"},{"key":"2024110513592826200_cnae034-B87","first-page":"12","volume-title":"JADH","author":"Gefen","year":"2017"},{"key":"2024110513592826200_cnae034-B88","first-page":"2116","article-title":"Cultural shift or linguistic drift? comparing two computational measures of semantic change","author":"Hamilton","year":"2016","journal-title":"EMNLP, Austin, Texas. Stroudsburg, Pennsylvania, United States: Association for Computational Linguistics"},{"key":"2024110513592826200_cnae034-B89","doi-asserted-by":"crossref","first-page":"E3635","DOI":"10.1073\/pnas.1720347115","article-title":"Word embeddings quantify 100 years of gender and ethnic stereotypes","volume":"115","author":"Garg","year":"2018","journal-title":"Proc. Natl. Acad. Sci. USA"},{"volume-title":"Neural Information Processing Systems Foundation, Inc","year":"2009","author":"Chang","key":"2024110513592826200_cnae034-B90"},{"key":"2024110513592826200_cnae034-B91","first-page":"530","volume-title":"Machine reading tea leaves: automatically evaluating topic coherence and topic model quality. EACL","author":"Lau","year":"2014"}],"container-title":["Journal of Complex Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/academic.oup.com\/comnet\/article-pdf\/12\/6\/cnae034\/60424432\/cnae034.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/comnet\/article-pdf\/12\/6\/cnae034\/60424432\/cnae034.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,5]],"date-time":"2024-11-05T13:59:54Z","timestamp":1730815194000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/comnet\/article\/doi\/10.1093\/comnet\/cnae034\/7876231"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,10,23]]},"references-count":91,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2024,10,23]]}},"URL":"https:\/\/doi.org\/10.1093\/comnet\/cnae034","relation":{},"ISSN":["2051-1329"],"issn-type":[{"type":"electronic","value":"2051-1329"}],"subject":[],"published-other":{"date-parts":[[2024,12]]},"published":{"date-parts":[[2024,10,23]]},"article-number":"cnae034"}}