{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,8]],"date-time":"2025-10-08T16:19:30Z","timestamp":1759940370592,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030742508"},{"type":"electronic","value":"9783030742515"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-74251-5_26","type":"book-chapter","created":{"date-parts":[[2021,4,12]],"date-time":"2021-04-12T15:20:40Z","timestamp":1618240840000},"page":"325-337","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["SINr: Fast Computing of Sparse Interpretable Node Representations is not a Sin!"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9610-3191","authenticated-orcid":false,"given":"Thibault","family":"Prouteau","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2788-3742","authenticated-orcid":false,"given":"Victor","family":"Connes","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6150-1939","authenticated-orcid":false,"given":"Nicolas","family":"Dugu\u00e9","sequence":"additional","affiliation":[]},{"given":"Anthony","family":"Perez","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7461-1785","authenticated-orcid":false,"given":"Jean-Charles","family":"Lamirel","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6786-1372","authenticated-orcid":false,"given":"Nathalie","family":"Camelin","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7687-073X","authenticated-orcid":false,"given":"Sylvain","family":"Meignier","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,4,13]]},"reference":[{"key":"26_CR1","doi-asserted-by":"crossref","unstructured":"Belkin, M., Niyogi, P.: Laplacian eigenmaps and spectral techniques for embedding and clustering. In: NIPS, pp. 585\u2013591 (2002)","DOI":"10.7551\/mitpress\/1120.003.0080"},{"key":"26_CR2","doi-asserted-by":"crossref","unstructured":"Bhowmick, A.K., Meneni, K., Danisch, M., Guillaume, J., Mitra, B.: Louvainne: hierarchical louvain method for high quality and scalable network embedding. In: WSDM, pp. 43\u201351 (2020)","DOI":"10.1145\/3336191.3371800"},{"key":"26_CR3","doi-asserted-by":"publisher","first-page":"P10008","DOI":"10.1088\/1742-5468\/2008\/10\/P10008","volume":"2008","author":"VD Blondel","year":"2008","unstructured":"Blondel, V.D., Guillaume, J.L., Lambiotte, R., Lefebvre, E.: Fast unfolding of communities in large networks. J. Stat. Mech.: Theory Exp. 2008, P10008 (2008)","journal-title":"J. Stat. Mech.: Theory Exp."},{"key":"26_CR4","unstructured":"Brandes, U., et al.: Maximizing modularity is hard. arXiv preprint physics\/0608255 (2006)"},{"key":"26_CR5","doi-asserted-by":"crossref","unstructured":"Brochier, R., Guille, A., Velcin, J.: Global vectors for node representations. In: WWW, pp. 2587\u20132593 (2019)","DOI":"10.1145\/3308558.3313595"},{"key":"26_CR6","doi-asserted-by":"crossref","unstructured":"Cao, S., Lu, W., Xu, Q.: GraRep: learning graph representations with global structural information. In: CIKM, pp. 891\u2013900 (2015)","DOI":"10.1145\/2806416.2806512"},{"key":"26_CR7","series-title":"Studies in Computational Intelligence","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/978-3-030-05414-4_9","volume-title":"Complex Networks and Their Applications VII","author":"N Dugu\u00e9","year":"2019","unstructured":"Dugu\u00e9, N., Lamirel, J.-C., Perez, A.: Bringing a feature selection metric from machine learning to complex networks. In: Aiello, L.M., Cherifi, C., Cherifi, H., Lambiotte, R., Li\u00f3, P., Rocha, L.M. (eds.) Complex Networks 2018. SCI, vol. 813, pp. 107\u2013118. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-05414-4_9"},{"issue":"2","key":"26_CR8","doi-asserted-by":"publisher","first-page":"795","DOI":"10.1016\/j.physa.2006.04.047","volume":"371","author":"JL Guillaume","year":"2006","unstructured":"Guillaume, J.L., Latapy, M.: Bipartite graphs as models of complex networks. Physica A 371(2), 795\u2013813 (2006)","journal-title":"Physica A"},{"key":"26_CR9","unstructured":"Kunegis, J.: The Koblenz network collection. In: WWW, pp. 1343\u20131350 (2013)"},{"key":"26_CR10","doi-asserted-by":"publisher","first-page":"104432","DOI":"10.1016\/j.dib.2019.104432","volume":"26","author":"JJ Lastra-D\u00edz","year":"2019","unstructured":"Lastra-D\u00edz, J.J., et al.: Reproducibility dataset for a large experimental survey on word embeddings and ontology-based methods for word similarity. Data Brief 26, 104432 (2019)","journal-title":"Data Brief"},{"issue":"1","key":"26_CR11","doi-asserted-by":"publisher","first-page":"2-es","DOI":"10.1145\/1217299.1217301","volume":"1","author":"J Leskovec","year":"2007","unstructured":"Leskovec, J., Kleinberg, J., Faloutsos, C.: Graph evolution: densification and shrinking diameters. ACM Trans. Knowl. Discov. Data 1(1), 2-es (2007)","journal-title":"ACM Trans. Knowl. Discov. Data"},{"key":"26_CR12","first-page":"211","volume":"3","author":"O Levy","year":"2015","unstructured":"Levy, O., Goldberg, Y., Dagan, I.: Improving distributional similarity with lessons learned from word embeddings. ACL 3, 211\u2013225 (2015)","journal-title":"ACL"},{"key":"26_CR13","unstructured":"Lu, Q., Getoor, L.: Link-based classification. In: ICML, pp. 496\u2013503 (2003)"},{"issue":"4","key":"26_CR14","doi-asserted-by":"publisher","first-page":"69:1","DOI":"10.1145\/3012704","volume":"49","author":"V Mart\u00ednez","year":"2017","unstructured":"Mart\u00ednez, V., Berzal, F., Talavera, J.C.C.: A survey of link prediction in complex networks. ACM Comput. Surv. 49(4), 69:1\u201369:33 (2017)","journal-title":"ACM Comput. Surv."},{"key":"26_CR15","unstructured":"Mikolov, T., Sutskever, I., Chen, K., Corrado, G.S., Dean, J.: Distributed representations of words and phrases and their compositionality. In: NIPS, pp. 3111\u20133119 (2013)"},{"key":"26_CR16","first-page":"17","volume":"14","author":"SD Monson","year":"1995","unstructured":"Monson, S.D., Pullman, N.J., Rees, R.: A survey of clique and biclique coverings and factorizations of (0, 1)-matrices. Bull. Inst. Combin. Appl. 14, 17\u201386 (1995)","journal-title":"Bull. Inst. Combin. Appl."},{"key":"26_CR17","doi-asserted-by":"crossref","unstructured":"Ou, M., Cui, P., Pei, J., Zhang, Z., Zhu, W.: Asymmetric transitivity preserving graph embedding. In: SIGKDD, pp. 1105\u20131114 (2016)","DOI":"10.1145\/2939672.2939751"},{"key":"26_CR18","doi-asserted-by":"crossref","unstructured":"Pennington, J., Socher, R., Manning, C.D.: Glove: global vectors for word representation. In: EMNLP, pp. 1532\u20131543 (2014)","DOI":"10.3115\/v1\/D14-1162"},{"key":"26_CR19","doi-asserted-by":"crossref","unstructured":"Perozzi, B., Al-Rfou, R., Skiena, S.: DeepWalk: online learning of social representations. In: SIGKDD, pp. 701\u2013710 (2014)","DOI":"10.1145\/2623330.2623732"},{"key":"26_CR20","doi-asserted-by":"crossref","unstructured":"Perozzi, B., Kulkarni, V., Chen, H., Skiena, S.: Don\u2019t walk, skip! online learning of multi-scale network embeddings. In: ASONAM, pp. 258\u2013265 (2017)","DOI":"10.1145\/3110025.3110086"},{"issue":"3","key":"26_CR21","doi-asserted-by":"publisher","first-page":"036106","DOI":"10.1103\/PhysRevE.76.036106","volume":"76","author":"UN Raghavan","year":"2007","unstructured":"Raghavan, U.N., Albert, R., Kumara, S.: Near linear time algorithm to detect community structures in large-scale networks. Phys. Rev. E 76(3), 036106 (2007)","journal-title":"Phys. Rev. E"},{"key":"26_CR22","unstructured":"\u0158eh\u016f\u0159ek, R., Sojka, P.: Software framework for topic modelling with large corpora. In: LREC, pp. 45\u201350 (2010)"},{"key":"26_CR23","unstructured":"Rozemberczki, B., Kiss, O., Sarkar, R.: An API oriented open-source python framework for unsupervised learning on graphs (2020)"},{"issue":"3","key":"26_CR24","doi-asserted-by":"publisher","first-page":"032801","DOI":"10.1103\/PhysRevE.92.032801","volume":"92","author":"VA Traag","year":"2015","unstructured":"Traag, V.A.: Faster unfolding of communities: speeding up the Louvain algorithm. Phys. Rev. E 92(3), 032801 (2015)","journal-title":"Phys. Rev. E"}],"container-title":["Lecture Notes in Computer Science","Advances in Intelligent Data Analysis XIX"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-74251-5_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,28]],"date-time":"2024-08-28T04:43:12Z","timestamp":1724820192000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-74251-5_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030742508","9783030742515"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-74251-5_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"13 April 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IDA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Intelligent Data Analysis","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Porto","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Portugal","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 April 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 April 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ida2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ida2021.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"113","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"35","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"31% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The conference was held online due to the COVID-19 pandemic","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}