{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T00:30:23Z","timestamp":1743035423305,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031592041"},{"type":"electronic","value":"9783031592058"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-59205-8_5","type":"book-chapter","created":{"date-parts":[[2024,4,28]],"date-time":"2024-04-28T15:01:38Z","timestamp":1714316498000},"page":"65-79","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Network Embedding Exploration Tool (NEExT)"],"prefix":"10.1007","author":[{"given":"Ashkan","family":"Dehghan","sequence":"first","affiliation":[]},{"given":"Pawe\u0142","family":"Pra\u0142at","sequence":"additional","affiliation":[]},{"given":"Fran\u00e7ois","family":"Th\u00e9berge","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,4,29]]},"reference":[{"key":"5_CR1","doi-asserted-by":"crossref","unstructured":"Aggarwal, M., Murty, M.N.: Machine learning in social networks: embedding nodes, edges, communities, and graphs. Springer Nature (2020)","DOI":"10.1007\/978-981-33-4022-0"},{"key":"5_CR2","unstructured":"Arora, S., Liang, Y., Ma, T.: A simple but tough-to-beat baseline for sentence embeddings. In: International Conference on Learning Representations (2017)"},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"Barrett, J., Kami\u0144ski, B., Pankratz, B., Pra\u0142at, P., Th\u00e9berge, F.: Self-similarity of communities of the ABCD model. preprint, arXiv (2023)","DOI":"10.1007\/978-3-031-59205-8_2"},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"Borgwardt, K.M., Ong, C.S., Sch\u00f6nauer, S., Vishwanathan, S., Smola, A.J., Kriegel, H.P.: Protein function prediction via graph kernels. Bioinformatics 21(suppl_1), i47\u2013i56 (2005)","DOI":"10.1093\/bioinformatics\/bti1007"},{"key":"5_CR5","unstructured":"Cuturi, M.: Sinkhorn distances: Lightspeed computation of optimal transport. In: Burges, C., Bottou, L., Welling, M., Ghahramani, Z., Weinberger, K. (eds.) Advances in Neural Information Processing Systems. vol.\u00a026. Curran Associates, Inc. (2013)"},{"key":"5_CR6","doi-asserted-by":"crossref","unstructured":"Debnath, A.K., Lopez\u00a0de Compadre, R.L., Debnath, G., Shusterman, A.J., Hansch, C.: Structure-activity relationship of mutagenic aromatic and heteroaromatic nitro compounds. correlation with molecular orbital energies and hydrophobicity. J. Med. Chem. 34(2), 786\u2013797 (1991)","DOI":"10.1021\/jm00106a046"},{"key":"5_CR7","unstructured":"Ester, M., Kriegel, H.P., Sander, J., Xu, X., et\u00a0al.: A density-based algorithm for discovering clusters in large spatial databases with noise. In: kdd, vol.\u00a096, pp. 226\u2013231 (1996)"},{"issue":"4","key":"5_CR8","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1017\/nws.2022.27","volume":"10","author":"B Kami\u0144ski","year":"2022","unstructured":"Kami\u0144ski, B., Krai\u0144ski, \u0141, Pra\u0142at, P., Th\u00e9berge, F.: A multi-purposed unsupervised framework for comparing embeddings of undirected and directed graphs. Network Sci. 10(4), 323\u2013346 (2022)","journal-title":"Network Sci."},{"key":"5_CR9","doi-asserted-by":"crossref","unstructured":"Kami\u0144ski, B., Pankratz, B., Pra\u0142at, P., Th\u00e9berge, F.: Modularity of the ABCD random graph model with community structure. J. Complex Networks 10(6), cnac050 (2022)","DOI":"10.1093\/comnet\/cnac050"},{"issue":"2","key":"5_CR10","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1017\/nws.2020.45","volume":"9","author":"B Kami\u0144ski","year":"2021","unstructured":"Kami\u0144ski, B., Pra\u0142at, P., Th\u00e9berge, F.: Artificial benchmark for community detection (ABCD)-fast random graph model with community structure. Network Sci. 9(2), 153\u2013178 (2021)","journal-title":"Network Sci."},{"key":"5_CR11","doi-asserted-by":"crossref","unstructured":"Kami\u0144ski, B., Pra\u0142at, P., Th\u00e9berge, F.: Mining Complex Networks. CRC Press, Boca Raton (2022)","DOI":"10.1201\/9781003218869"},{"issue":"1","key":"5_CR12","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/s41109-023-00552-9","volume":"8","author":"B Kami\u0144ski","year":"2023","unstructured":"Kami\u0144ski, B., Pra\u0142at, P., Th\u00e9berge, F.: Artificial benchmark for community detection with outliers (ABCD+o). Appl. Netw. Sci. 8(1), 25 (2023)","journal-title":"Appl. Netw. Sci."},{"key":"5_CR13","doi-asserted-by":"crossref","unstructured":"Kami\u0144ski, B., Pra\u0142at, P., Th\u00e9berge, F.: Hypergraph artificial benchmark for community detection (h\u2013ABCD). J. Complex Networks 11(4), cnad028 (2023)","DOI":"10.1093\/comnet\/cnad028"},{"key":"5_CR14","doi-asserted-by":"publisher","unstructured":"Kami\u0144ski, B., Pra\u0142at, P., Th\u00e9berge, F., Zajac, S.: Predicting properties of nodes via community-aware features. arXiv preprint 2311.04730 (2023). https:\/\/doi.org\/10.48550\/arXiv.2311.04730","DOI":"10.48550\/arXiv.2311.04730"},{"key":"5_CR15","doi-asserted-by":"publisher","first-page":"100348","DOI":"10.1016\/j.bdr.2022.100348","volume":"30","author":"B Kami\u0144ski","year":"2022","unstructured":"Kami\u0144ski, B., Olczak, T., Pankratz, B., Pra\u0142at, P., Th\u00e9berge, F.: Properties and performance of the ABCDE random graph model with community structure. Big Data Res. 30, 100348 (2022)","journal-title":"Big Data Res."},{"key":"5_CR16","unstructured":"Kolouri, S., Naderializadeh, N., Rohde, G.K., Hoffmann, H.: Wasserstein embedding for graph learning. In: International Conference on Learning Representations (2021)"},{"issue":"4","key":"5_CR17","doi-asserted-by":"publisher","first-page":"046110","DOI":"10.1103\/PhysRevE.78.046110","volume":"78","author":"A Lancichinetti","year":"2008","unstructured":"Lancichinetti, A., Fortunato, S., Radicchi, F.: Benchmark graphs for testing community detection algorithms. Phys. Rev. E 78(4), 046110 (2008)","journal-title":"Phys. Rev. E"},{"key":"5_CR18","unstructured":"Narayanan, A., Chandramohan, M., Chen, L., Liu, Y., Saminathan, S.: subgraph2vec: learning distributed representations of rooted sub-graphs from large graphs. arXiv preprint arXiv:1606.08928 (2016)"},{"key":"5_CR19","unstructured":"Narayanan, A., Chandramohan, M., Venkatesan, R., Chen, L., Liu, Y., Jaiswal, S.: graph2vec: learning distributed representations of graphs. arXiv preprint arXiv:1707.05005 (2017)"},{"issue":"7024","key":"5_CR20","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1038\/nature03248","volume":"433","author":"C Song","year":"2005","unstructured":"Song, C., Havlin, S., Makse, H.A.: Self-similarity of complex networks. Nature 433(7024), 392\u2013395 (2005)","journal-title":"Nature"},{"key":"5_CR21","doi-asserted-by":"crossref","unstructured":"Sutherland, J.J., O\u2019brien, L.A., Weaver, D.F.: Spline-fitting with a genetic algorithm: a method for developing classification structure- activity relationships. J. Chem. Inf. Comput. Sci. 43(6), 1906\u20131915 (2003)","DOI":"10.1021\/ci034143r"},{"key":"5_CR22","unstructured":"Togninalli, M., Ghisu, E., Llinares-L\u00f3pez, F., Rieck, B., Borgwardt, K.: Wasserstein weisfeiler-lehman graph kernels. In: Advances in Neural Information Processing Systems, vol. 32 (2019)"},{"key":"5_CR23","doi-asserted-by":"publisher","unstructured":"Villani, C., et\u00a0al.: Optimal Transport: Old and New, vol.\u00a0338. Springer, Berlin (2009). https:\/\/doi.org\/10.1007\/978-3-540-71050-9","DOI":"10.1007\/978-3-540-71050-9"},{"key":"5_CR24","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/s10115-007-0103-5","volume":"14","author":"N Wale","year":"2008","unstructured":"Wale, N., Watson, I.A., Karypis, G.: Comparison of descriptor spaces for chemical compound retrieval and classification. Knowl. Inf. Syst. 14, 347\u2013375 (2008)","journal-title":"Knowl. Inf. Syst."},{"key":"5_CR25","doi-asserted-by":"crossref","unstructured":"Yanardag, P., Vishwanathan, S.: Deep graph kernels. In: Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 1365\u20131374 (2015)","DOI":"10.1145\/2783258.2783417"}],"container-title":["Lecture Notes in Computer Science","Modelling and Mining Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-59205-8_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,10]],"date-time":"2024-05-10T16:02:45Z","timestamp":1715356965000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-59205-8_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031592041","9783031592058"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-59205-8_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"29 April 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WAW","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Algorithms and Models for the Web-Graph","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Warsaw","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Poland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 June 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 June 2024","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":"waw2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/math.torontomu.ca\/waw2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}