{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T19:17:28Z","timestamp":1743103048724,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030934125"},{"type":"electronic","value":"9783030934132"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[[2022]]},"DOI":"10.1007\/978-3-030-93413-2_45","type":"book-chapter","created":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T03:18:22Z","timestamp":1641007102000},"page":"536-548","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["High-Speed and\u00a0Noise-Robust Embedding of\u00a0Hypergraphs Based on\u00a0Double-Centered Incidence Matrix"],"prefix":"10.1007","author":[{"given":"Shuta","family":"Ito","sequence":"first","affiliation":[]},{"given":"Takayasu","family":"Fushimi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,1,1]]},"reference":[{"issue":"21","key":"45_CR1","doi-asserted-by":"publisher","first-page":"5706","DOI":"10.1109\/TSP.2015.2458782","volume":"63","author":"PY Chen","year":"2015","unstructured":"Chen, P.Y., Hero, A.O.: Deep community detection. IEEE Trans. Sig. Process. 63(21), 5706\u20135719 (2015)","journal-title":"IEEE Trans. Sig. Process."},{"key":"45_CR2","doi-asserted-by":"crossref","unstructured":"Chodrow, P.S., Veldt, N., Benson, A.R.: Generative hypergraph clustering: from blockmodels to modularity. Sci. Adv. 7(28), 1\u201314 (2021). https:\/\/advances.sciencemag.org\/content\/7\/28\/eabh1303","DOI":"10.1126\/sciadv.abh1303"},{"key":"45_CR3","doi-asserted-by":"publisher","unstructured":"Clauset, A., Newman, M.E.J., Moore, C.: Finding community structure in very large networks. Phys. Rev. E 70(6), 1\u20136 (2004). https:\/\/doi.org\/10.1103\/PhysRevE.70.066111","DOI":"10.1103\/PhysRevE.70.066111"},{"key":"45_CR4","doi-asserted-by":"publisher","unstructured":"Do, M., Yoon, S., Hooi, B., Shin, K.: Structural patterns and generative models of real-world hypergraphs. In: Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, KDD 2000, pp. 176\u2013186. Association for Computing Machinery, New York (2020). https:\/\/doi.org\/10.1145\/3394486.3403060","DOI":"10.1145\/3394486.3403060"},{"key":"45_CR5","doi-asserted-by":"publisher","unstructured":"Grover, A., Leskovec, J.: node2vec: scalable feature learning for networks. In: Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD 2016, pp. 855\u2013864. Association for Computing Machinery, New York (2016). https:\/\/doi.org\/10.1145\/2939672.2939754","DOI":"10.1145\/2939672.2939754"},{"key":"45_CR6","doi-asserted-by":"publisher","unstructured":"Ito, S., Fushimi, T.: Fast clustering of hypergraphs based on bipartite-edge restoration and node reachability. In: Proceedings of the 22nd International Conference on Information Integration and Web-Based Applications & Services, iiWAS 2020, pp. 115\u2013124, Association for Computing Machinery, New York (2020). https:\/\/doi.org\/10.1145\/3428757.3429095","DOI":"10.1145\/3428757.3429095"},{"issue":"11","key":"45_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1371\/journal.pone.0224307","volume":"14","author":"B Kami\u0144ski","year":"2019","unstructured":"Kami\u0144ski, B., Poulin, V., Pralat, P., Szufel, P., Th\u00e9berge, F.: Clustering via hypergraph modularity. PLOS ONE 14(11), 1\u201315 (2019). https:\/\/doi.org\/10.1371\/journal.pone.0224307","journal-title":"PLOS ONE"},{"key":"45_CR8","doi-asserted-by":"publisher","unstructured":"Kami\u0144ski, B., Pra\u0142at, P., Th\u00e9berge, F.: Community detection algorithm using hypergraph modularity. In: Benito, R.M., Cherifi, C., Cherifi, H., Moro, E., Rocha, L.M., Sales-Pardo, M. (eds.) Complex Networks & Their Applications IX. COMPLEX NETWORKS 2020. Studies in Computational Intelligence, vol. 943. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-65347-7_13","DOI":"10.1007\/978-3-030-65347-7_13"},{"key":"45_CR9","unstructured":"Kumar, T., Vaidyanathan, S., Ananthapadmanabhan, H., Parthasarathy, S., Ravindran, B.: Hypergraph clustering: a modularity maximization approach. CoRR abs\/1812.10869 (2018). http:\/\/arxiv.org\/abs\/1812.10869"},{"issue":"1","key":"45_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s41109-020-00300-3","volume":"5","author":"T Kumar","year":"2020","unstructured":"Kumar, T., Vaidyanathan, S., Ananthapadmanabhan, H., Parthasarathy, S., Ravindran, B.: Hypergraph clustering by iteratively reweighted modularity maximization. Appl. Netw. Sci. 5(1), 1\u201322 (2020). https:\/\/doi.org\/10.1007\/s41109-020-00300-3","journal-title":"Appl. Netw. Sci."},{"issue":"4","key":"45_CR11","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/s11222-007-9033-z","volume":"17","author":"U von Luxburg","year":"2007","unstructured":"von Luxburg, U.: A tutorial on spectral clustering. Stat. Comput. 17(4), 395\u2013416 (2007)","journal-title":"Stat. Comput."},{"key":"45_CR12","unstructured":"Maleki, S., Wall, D., Pingali, K.: NetVec: a scalable hypergraph embedding system (March 2021). https:\/\/arxiv.org\/abs\/2103.09660"},{"key":"45_CR13","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/BF02288916","volume":"17","author":"W Torgerson","year":"1952","unstructured":"Torgerson, W.: Multidimensional scaling: I. Theory and method. Psychometrika 17, 401\u2013419 (1952). https:\/\/doi.org\/10.1007\/BF02288916","journal-title":"Psychometrika"},{"key":"45_CR14","doi-asserted-by":"publisher","first-page":"016114","DOI":"10.1103\/PhysRevE.83.016114","volume":"83","author":"H Wen","year":"2011","unstructured":"Wen, H., Leicht, E.A., D\u2019Souza, R.M.: Improving community detection in networks by targeted node removal. Phys. Rev. E 83, 016114 (2011). https:\/\/doi.org\/10.1103\/PhysRevE.83.016114","journal-title":"Phys. Rev. E"},{"key":"45_CR15","doi-asserted-by":"crossref","unstructured":"Yang, D., Qu, B., Yang, J., Cudre-Mauroux, P.: Revisiting user mobility and social relationships in LBSNs: a hypergraph embedding approach. In: The World Wide Web Conference, WWW 2019, pp. 2147\u20132157. Association for Computing Machinery, New York (2019). https:\/\/doi.org\/10.1145\/3308558.3313635","DOI":"10.1145\/3308558.3313635"},{"key":"45_CR16","doi-asserted-by":"crossref","unstructured":"Zhou, D., Huang, J., Sch\u00f6lkopf, B.: Learning with hypergraphs: clustering, classification, and embedding. In: Proceedings of the 19th International Conference on Neural Information Processing Systems, NIPS 2006, pp. 1601\u20131608. MIT Press, Cambridge (2006)","DOI":"10.7551\/mitpress\/7503.003.0205"}],"container-title":["Studies in Computational Intelligence","Complex Networks & Their Applications X"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-93413-2_45","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,15]],"date-time":"2023-11-15T03:21:54Z","timestamp":1700018514000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-93413-2_45"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783030934125","9783030934132"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-93413-2_45","relation":{},"ISSN":["1860-949X","1860-9503"],"issn-type":[{"type":"print","value":"1860-949X"},{"type":"electronic","value":"1860-9503"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"1 January 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COMPLEX NETWORKS","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":"Madrid","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","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":"30 November 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 December 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwcna2021","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"}}]}}