{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T16:43:54Z","timestamp":1743093834762,"version":"3.40.3"},"publisher-location":"Cham","reference-count":37,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031211263"},{"type":"electronic","value":"9783031211270"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-21127-0_29","type":"book-chapter","created":{"date-parts":[[2023,1,3]],"date-time":"2023-01-03T19:38:43Z","timestamp":1672774723000},"page":"350-363","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["HM-LDM: A Hybrid-Membership Latent Distance Model"],"prefix":"10.1007","author":[{"given":"Nikolaos","family":"Nakis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Abdulkadir","family":"\u00c7elikkanat","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Morten","family":"M\u00f8rup","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,1,4]]},"reference":[{"issue":"65","key":"29_CR1","first-page":"1981","volume":"9","author":"EM Airoldi","year":"2008","unstructured":"Airoldi, E.M., Blei, D.M., Fienberg, S.E., Xing, E.P.: Mixed membership stochastic blockmodels. J. Mach. Learn. Res. 9(65), 1981\u20132014 (2008)","journal-title":"J. Mach. Learn. Res."},{"key":"29_CR2","doi-asserted-by":"crossref","unstructured":"Ball, B., Karrer, B., Newman, M.E.J.: An efficient and principled method for detecting communities in networks. CoRR abs\/1104.3590 (2011)","DOI":"10.1103\/PhysRevE.84.036103"},{"key":"29_CR3","doi-asserted-by":"crossref","unstructured":"Bhowmick, A.K., Meneni, K., Danisch, M., Guillaume, J.L., 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":"29_CR4","doi-asserted-by":"crossref","unstructured":"\u00c7elikkanat, A., Malliaros, F.D.: Exponential family graph embeddings. In: AAAI, pp. 3357\u20133364 (2020)","DOI":"10.1609\/aaai.v34i04.5737"},{"key":"29_CR5","unstructured":"Chakraborty, T., Dalmia, A., Mukherjee, A., Ganguly, N.: Metrics for community analysis: a survey (2016)"},{"key":"29_CR6","doi-asserted-by":"crossref","unstructured":"Grover, A., Leskovec, J.: Node2Vec: scalable feature learning for networks. In: KDD, pp. 855\u2013864 (2016)","DOI":"10.1145\/2939672.2939754"},{"issue":"3","key":"29_CR7","first-page":"52","volume":"40","author":"WL Hamilton","year":"2017","unstructured":"Hamilton, W.L., Ying, R., Leskovec, J.: Representation learning on graphs: methods and applications. IEEE Data Eng. Bull. 40(3), 52\u201374 (2017)","journal-title":"IEEE Data Eng. Bull."},{"issue":"2","key":"29_CR8","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1111\/j.1467-985X.2007.00471.x","volume":"170","author":"MS Handcock","year":"2007","unstructured":"Handcock, M.S., Raftery, A.E., Tantrum, J.M.: Model-based clustering for social networks. J. R. Stat. Soc. Ser. A Stat. Soc. 170(2), 301\u2013354 (2007)","journal-title":"J. R. Stat. Soc. Ser. A Stat. Soc."},{"issue":"469","key":"29_CR9","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1198\/016214504000001015","volume":"100","author":"PD Hoff","year":"2005","unstructured":"Hoff, P.D.: Bilinear mixed-effects models for dyadic data. JASA 100(469), 286\u2013295 (2005)","journal-title":"JASA"},{"key":"29_CR10","unstructured":"Hoff, P.D.: Modeling homophily and stochastic equivalence in symmetric relational data (2007)"},{"issue":"460","key":"29_CR11","doi-asserted-by":"publisher","first-page":"1090","DOI":"10.1198\/016214502388618906","volume":"97","author":"PD Hoff","year":"2002","unstructured":"Hoff, P.D., Raftery, A.E., Handcock, M.S.: Latent space approaches to social network analysis. JASA 97(460), 1090\u20131098 (2002)","journal-title":"JASA"},{"issue":"1","key":"29_CR12","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1109\/TSP.2013.2285514","volume":"62","author":"K Huang","year":"2014","unstructured":"Huang, K., Sidiropoulos, N.D., Swami, A.: Non-negative matrix factorization revisited: uniqueness and algorithm for symmetric decomposition. IEEE Trans. Sign. Proc. 62(1), 211\u2013224 (2014)","journal-title":"IEEE Trans. Sign. Proc."},{"key":"29_CR13","doi-asserted-by":"crossref","unstructured":"Jianbo Shi, Malik, J.: Normalized cuts and image segmentation. IEEE Trans. Patt. Anal. Mach. Intell. 22(8), 888\u2013905 (2000)","DOI":"10.1109\/34.868688"},{"issue":"1","key":"29_CR14","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.83.016107","volume":"83","author":"B Karrer","year":"2011","unstructured":"Karrer, B., Newman, M.E.: Stochastic blockmodels and community structure in networks. Phys. Rev. E 83(1), 016107 (2011)","journal-title":"Phys. Rev. E"},{"key":"29_CR15","unstructured":"Kingma, D.P., Ba, J.: Adam: A method for stochastic optimization (2017)"},{"issue":"3","key":"29_CR16","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1016\/j.socnet.2009.04.001","volume":"31","author":"PN Krivitsky","year":"2009","unstructured":"Krivitsky, P.N., Handcock, M.S., Raftery, A.E., Hoff, P.D.: Representing degree distributions, clustering, and homophily in social networks with latent cluster random effects models. Soc. Netw. 31(3), 204\u2013213 (2009)","journal-title":"Soc. Netw."},{"key":"29_CR17","doi-asserted-by":"crossref","unstructured":"Kuang, D., Ding, C., Park, H.: Symmetric nonnegative matrix factorization for graph clustering. In: SDM (2012)","DOI":"10.1137\/1.9781611972825.10"},{"key":"29_CR18","doi-asserted-by":"publisher","first-page":"788","DOI":"10.1038\/44565","volume":"401","author":"DD Lee","year":"1999","unstructured":"Lee, D.D., Seung, H.S.: Learning the parts of objects by nonnegative matrix factorization. Nature 401, 788\u2013791 (1999)","journal-title":"Nature"},{"key":"29_CR19","unstructured":"Leskovec, J., Krevl, A.: SNAP Datasets: Stanford large network dataset collection (2014)"},{"key":"29_CR20","unstructured":"Mao, X., Sarkar, P., Chakrabarti, D.: On mixed memberships and symmetric nonnegative matrix factorizations. In: ICML, vol.\u00a070 (2017)"},{"key":"29_CR21","doi-asserted-by":"crossref","unstructured":"Mucha, P., Porter, M.: Social structure of facebook networks. Phys. A Stat. Mech. Appl. 391, 4165-4180 (2012)","DOI":"10.1016\/j.physa.2011.12.021"},{"key":"29_CR22","doi-asserted-by":"crossref","unstructured":"Nakis, N., \u00c7elikkanat, A., J\u00f8rgensen, S.L., M\u00f8rup, M.: A hierarchical block distance model for ultra low-dimensional graph representations (2022)","DOI":"10.1109\/TKDE.2023.3304344"},{"issue":"2","key":"29_CR23","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1137\/S003614450342480","volume":"45","author":"MEJ Newman","year":"2003","unstructured":"Newman, M.E.J.: The structure and function of complex networks. SIAM Rev. 45(2), 167\u2013256 (2003)","journal-title":"SIAM Rev."},{"key":"29_CR24","unstructured":"Ng, A.Y., Jordan, M.I., Weiss, Y.: On spectral clustering: analysis and an algorithm. In: Proceedings of the 14th International Conference on Neural Information Processing Systems: Natural and Synthetic, pp. 849-856. NIPS\u201901, MIT Press, Cambridge, MA, USA (2001)"},{"key":"29_CR25","doi-asserted-by":"crossref","unstructured":"Perozzi, B., Al-Rfou, R., Skiena, S.: Deepwalk: Online learning of social representations. In: KDD, pp. 701-710 (2014)","DOI":"10.1145\/2623330.2623732"},{"key":"29_CR26","doi-asserted-by":"crossref","unstructured":"Qiu, J., Dong, Y., Ma, H., Li, J., Wang, C., Wang, K., Tang, J.: NetSMF: Large-scale network embedding as sparse matrix factorization. In: WWW (2019)","DOI":"10.1145\/3308558.3313446"},{"key":"29_CR27","doi-asserted-by":"crossref","unstructured":"Qiu, J., Dong, Y., Ma, H., Li, J., Wang, K., Tang, J.: Network embedding as matrix factorization: unifying DeepWalk, LINE, PTE, and Node2Vec. In: WSDM, pp. 459\u2013467 (2018)","DOI":"10.1145\/3159652.3159706"},{"issue":"4","key":"29_CR28","doi-asserted-by":"publisher","first-page":"901","DOI":"10.1080\/10618600.2012.679240","volume":"21","author":"AE Raftery","year":"2012","unstructured":"Raftery, A.E., Niu, X., Hoff, P.D., Yeung, K.Y.: Fast inference for the latent space network model using a case-control approximate likelihood. J. Comput. Graph. Stat. 21(4), 901\u2013919 (2012)","journal-title":"J. Comput. Graph. Stat."},{"issue":"1","key":"29_CR29","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1017\/nws.2017.6","volume":"5","author":"C Ryan","year":"2017","unstructured":"Ryan, C., Wyse, J., Friel, N.: Bayesian model selection for the latent position cluster model for social networks. Netw. Sci. 5(1), 70\u201391 (2017)","journal-title":"Netw. Sci."},{"key":"29_CR30","doi-asserted-by":"crossref","unstructured":"Sun, B.J., Shen, H., Gao, J., Ouyang, W., Cheng, X.: A non-negative symmetric encoder-decoder approach for community detection. In: CIKM (2017)","DOI":"10.1145\/3132847.3132902"},{"key":"29_CR31","doi-asserted-by":"crossref","unstructured":"Tang, J., Qu, M., Wang, M., Zhang, M., Yan, J., Mei, Q.: LINE: Large-scale information network embedding. In: WWW, pp. 1067\u20131077 (2015)","DOI":"10.1145\/2736277.2741093"},{"key":"29_CR32","doi-asserted-by":"crossref","unstructured":"Wang, X., Cui, P., Wang, J., Pei, J., Zhu, W., Yang, S.: Community preserving network embedding. In: AAAI (2017)","DOI":"10.1609\/aaai.v31i1.10488"},{"key":"29_CR33","doi-asserted-by":"crossref","unstructured":"Wind, D.K., M\u00f8rup, M.: Link prediction in weighted networks. In: 2012 IEEE International Workshop MLSP, pp. 1\u20136 (2012)","DOI":"10.1109\/MLSP.2012.6349745"},{"key":"29_CR34","doi-asserted-by":"crossref","unstructured":"Yang, J., Leskovec, J.: Overlapping community detection at scale: a nonnegative matrix factorization approach. In: WSDM (2013)","DOI":"10.1145\/2433396.2433471"},{"key":"29_CR35","doi-asserted-by":"crossref","unstructured":"Yang, L., Gu, J., Wang, C., Cao, X., Zhai, L., Jin, D., Guo, Y.: Toward unsupervised graph neural network: interactive clustering and embedding via optimal transport. In: ICDM (2020)","DOI":"10.1109\/ICDM50108.2020.00177"},{"key":"29_CR36","doi-asserted-by":"crossref","unstructured":"Zhang, D., Yin, J., Zhu, X., Zhang, C.: Network representation learning: a survey. IEEE Trans. Big Data 6(1) (2020)","DOI":"10.1109\/TBDATA.2018.2850013"},{"key":"29_CR37","doi-asserted-by":"crossref","unstructured":"Zhang, J., Dong, Y., Wang, Y., Tang, J., Ding, M.: Prone: fast and scalable network representation learning. In: IJCAI (2019)","DOI":"10.24963\/ijcai.2019\/594"}],"container-title":["Studies in Computational Intelligence","Complex Networks and Their Applications XI"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-21127-0_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,3]],"date-time":"2023-12-03T23:58:51Z","timestamp":1701647931000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-21127-0_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031211263","9783031211270"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-21127-0_29","relation":{},"ISSN":["1860-949X","1860-9503"],"issn-type":[{"type":"print","value":"1860-949X"},{"type":"electronic","value":"1860-9503"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"4 January 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COMPLEX NETWORKS 2016","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Complex Networks and Their Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Palermo","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 November 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 November 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwcna2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.complexnetworks.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}