{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,30]],"date-time":"2025-03-30T20:45:49Z","timestamp":1743367549524,"version":"3.37.3"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2023,7,7]],"date-time":"2023-07-07T00:00:00Z","timestamp":1688688000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,7,7]],"date-time":"2023-07-07T00:00:00Z","timestamp":1688688000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["JP22K12279"],"award-info":[{"award-number":["JP22K12279"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Netw Sci"],"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Hypergraph is a graph structure that can efficiently express the relationship of multiple nodes and has attracted attention in recent years. As with normal graphs, the structure changes every moment, and it is an important research topic in graph mining to capture structural changes. Many existing graph embedding methods focus on prediction tasks, and few focus on the visualization of structural changes. In this study, we aim to output embeddings for effective visualization in terms of spatial efficiency, node classification accuracy, graph structure maintenance, computational efficiency, and structural change detection performance. Our proposed method gets inspired by modularity maximization, quantifies connection strength between hypernodes and hyperedges, and embeds hypernodes on the surface of concentric spheres with a radius equal to the timestep, where a spherical surface has a wide area in the middle range. These devices are expected to correspond to the following two characteristics: (1) a graph has more node pairs whose distances are middle-range than short- and long-range; (2) a growing graph generally has an increasing number of nodes. Evaluation experiments using multiple real hypergraphs show that the proposed method is superior to existing visualization methods in the abovementioned terms.<\/jats:p>","DOI":"10.1007\/s41109-023-00568-1","type":"journal-article","created":{"date-parts":[[2023,7,7]],"date-time":"2023-07-07T13:01:45Z","timestamp":1688734905000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Dynamic hypergraph embedding onto concentric hypersphere manifold intended for effective visualization"],"prefix":"10.1007","volume":"8","author":[{"given":"Shuta","family":"Ito","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Takayasu","family":"Fushimi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,7,7]]},"reference":[{"key":"568_CR1","doi-asserted-by":"publisher","first-page":"066102","DOI":"10.1103\/PhysRevE.76.066102","volume":"76","author":"M Barber","year":"2007","unstructured":"Barber M (2007) Modularity and community detection in bipartite networks. Phys Rev E 76:066102. https:\/\/doi.org\/10.1103\/PhysRevE.76.066102","journal-title":"Phys Rev E"},{"issue":"1","key":"568_CR2","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1111\/cgf.12791","volume":"36","author":"F Beck","year":"2017","unstructured":"Beck F, Burch M, Diehl S, Weiskopf D (2017) A taxonomy and survey of dynamic graph visualization. Comput Graph Forum 36(1):133\u2013159. https:\/\/doi.org\/10.1111\/cgf.12791","journal-title":"Comput Graph Forum"},{"issue":"6","key":"568_CR3","doi-asserted-by":"publisher","first-page":"1373","DOI":"10.1162\/089976603321780317","volume":"15","author":"M Belkin","year":"2003","unstructured":"Belkin M, Niyogi P (2003) Laplacian eigenmaps for dimensionality reduction and data representation. Neural Comput 15(6):1373\u20131396","journal-title":"Neural Comput"},{"issue":"10","key":"568_CR4","doi-asserted-by":"publisher","first-page":"P10008","DOI":"10.1088\/1742-5468\/2008\/10\/P10008","volume":"2008","author":"VD Blondel","year":"2008","unstructured":"Blondel VD, Guillaume JL, Lambiotte R, Lefebvre E (2008) Fast unfolding of communities in large networks. J Stat Mech Theory Exp 2008(10):P10008","journal-title":"J Stat Mech Theory Exp"},{"key":"568_CR5","doi-asserted-by":"publisher","unstructured":"Cao S, Lu W, Xu Q (2015) Grarep: learning graph representations with global structural information. In: Proceedings of the 24th ACM international on conference on information and knowledge management, CIKM \u201915. Association for Computing Machinery, New York, NY, USA, pp 891\u2013900. https:\/\/doi.org\/10.1145\/2806416.2806512","DOI":"10.1145\/2806416.2806512"},{"key":"568_CR6","volume-title":"Spectral graph theory","author":"FRK Chung","year":"1997","unstructured":"Chung FRK (1997) Spectral graph theory. American Mathematical Society, New York"},{"key":"568_CR7","doi-asserted-by":"publisher","DOI":"10.1103\/physreve.70.066111","author":"A Clauset","year":"2004","unstructured":"Clauset A, Newman MEJ, Moore C (2004) Finding community structure in very large networks. Phys Rev E. https:\/\/doi.org\/10.1103\/physreve.70.066111","journal-title":"Phys Rev E"},{"key":"568_CR8","doi-asserted-by":"publisher","unstructured":"Do M, Yoon S, Hooi B, Shin K (2020) Structural patterns and generative models of real-world hypergraphs. In: Proceedings of the 26th ACM SIGKDD international conference on knowledge discovery & data mining, KDD 20. Association for Computing Machinery, New York, NY, USA, pp 176\u2013186. https:\/\/doi.org\/10.1145\/3394486.3403060","DOI":"10.1145\/3394486.3403060"},{"key":"568_CR9","doi-asserted-by":"publisher","unstructured":"Feng Y, You H, Zhang Z, Ji R, Gao Y (2019) Hypergraph neural networks. In: Proceedings of the AAAI conference on artificial intelligence, vol 33(01), pp 3558\u20133565. https:\/\/doi.org\/10.1609\/aaai.v33i01.33013558. https:\/\/ojs.aaai.org\/index.php\/AAAI\/article\/view\/4235","DOI":"10.1609\/aaai.v33i01.33013558"},{"issue":"11","key":"568_CR10","doi-asserted-by":"publisher","first-page":"1129","DOI":"10.1002\/spe.4380211102","volume":"21","author":"TMJ Fruchterman","year":"1991","unstructured":"Fruchterman TMJ, Reingold EM (1991) Graph drawing by force-directed placement. Softw Pract Exp 21(11):1129\u20131164","journal-title":"Softw Pract Exp"},{"issue":"3","key":"568_CR11","doi-asserted-by":"publisher","first-page":"3181","DOI":"10.1109\/TPAMI.2022.3182052","volume":"45","author":"Y Gao","year":"2023","unstructured":"Gao Y, Feng Y, Ji S, Ji R (2023) Hgnn+: general hypergraph neural networks. IEEE Trans Pattern Anal Mach Intell 45(3):3181\u20133199. https:\/\/doi.org\/10.1109\/TPAMI.2022.3182052","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"568_CR12","doi-asserted-by":"publisher","unstructured":"Grover A, Leskovec J (2016) Node2vec: scalable feature learning for networks. In: Proceedings of the 22nd ACM SIGKDD international conference on knowledge discovery and data mining, KDD \u201916. Association for Computing Machinery, New York, NY, USA, pp 855\u2013864. https:\/\/doi.org\/10.1145\/2939672.2939754","DOI":"10.1145\/2939672.2939754"},{"key":"568_CR13","first-page":"37","volume":"10","author":"Y Hu","year":"2005","unstructured":"Hu Y (2005) Efficient and high quality force-directed graph drawing. Math J 10:37\u201371","journal-title":"Math J"},{"key":"568_CR14","first-page":"536","volume-title":"Complex Networks & Their Applications X","author":"S Ito","year":"2021","unstructured":"Ito S, Fushimi T (2021) High-speed and noise-robust embedding of hypergraphs based on double-centered incidence matrix. In: Benito RM, Cherifi C, Cherifi H, Moro E, Rocha LM, Sales-Pardo M (eds) Complex Networks & Their Applications X. Springer, Cham, pp 536\u2013548"},{"key":"568_CR15","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1016\/0020-0190(89)90102-6","volume":"31","author":"T Kamada","year":"1989","unstructured":"Kamada T, Kawai S (1989) An algorithm for drawing general undirected graphs. Inf Process Lett 31:7\u201315","journal-title":"Inf Process Lett"},{"issue":"11","key":"568_CR16","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 (2019) Clustering via hypergraph modularity. PLOS ONE 14(11):1\u201315. https:\/\/doi.org\/10.1371\/journal.pone.0224307","journal-title":"PLOS ONE"},{"key":"568_CR17","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/j.ins.2022.10.006","volume":"616","author":"X Kang","year":"2022","unstructured":"Kang X, Li X, Yao H, Li D, Jiang B, Peng X, Wu T, Qi S, Dong L (2022) Dynamic hypergraph neural networks based on key hyperedges. Inf Sci 616:37\u201351. https:\/\/doi.org\/10.1016\/j.ins.2022.10.006","journal-title":"Inf Sci"},{"key":"568_CR18","unstructured":"Kumar T, Vaidyanathan S, Ananthapadmanabhan H, Parthasarathy S, Ravindran B (2018) Hypergraph clustering: a modularity maximization approach. CoRR abs\/1812.10869. arxiv:1812.10869"},{"key":"568_CR19","first-page":"2579","volume":"9","author":"Lvd Maaten","year":"2008","unstructured":"Maaten Lvd, Hinton G (2008) Visualizing data using t-SNE. J Mach Learn Res 9:2579\u20132605","journal-title":"J Mach Learn Res"},{"key":"568_CR20","unstructured":"Maleki S, Wall D, Pingali K (2021) Netvec: a scalable hypergraph embedding system. CoRR. arxiv:2103.09660"},{"issue":"2","key":"568_CR21","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1137\/S003614450342480","volume":"45","author":"MEJ Newman","year":"2003","unstructured":"Newman MEJ (2003) The structure and function of complex networks. SIAM Rev 45(2):167\u2013256","journal-title":"SIAM Rev"},{"issue":"23","key":"568_CR22","doi-asserted-by":"publisher","first-page":"8577","DOI":"10.1073\/pnas.0601602103","volume":"103","author":"MEJ Newman","year":"2006","unstructured":"Newman MEJ (2006) Modularity and community structure in networks. Proc Natl Acad Sci 103(23):8577\u20138582. https:\/\/doi.org\/10.1073\/pnas.0601602103","journal-title":"Proc Natl Acad Sci"},{"key":"568_CR23","unstructured":"Peng C, Xiao W, Jian P, Z, W (2017) A survey on network embedding. CoRR abs\/1711.08752. arxiv:1711.08752"},{"key":"568_CR24","doi-asserted-by":"publisher","unstructured":"Perozzi B, Al-Rfou R, Skiena S (2014) Deepwalk: online learning of social representations. In: Proceedings of the 20th ACM SIGKDD international conference on knowledge discovery and data mining, KDD \u201914. Association for Computing Machinery, New York, NY, USA, pp 701\u2013710. https:\/\/doi.org\/10.1145\/2623330.2623732","DOI":"10.1145\/2623330.2623732"},{"key":"568_CR25","unstructured":"Takeshi Y, Kazumi S, Naonori U (2003) Cross-entropy directed embedding of network data. In: Proceedings of the 20th international conference on machine learning. AAAI Press, pp 832\u2013839"},{"key":"568_CR26","doi-asserted-by":"publisher","unstructured":"Tang J, Qu M, Wang M, Zhang M, Yan J, Mei Q (2015) Line: large-scale information network embedding. In: Proceedings of the 24th international conference on world wide web. ACM, pp 1067\u20131077. https:\/\/doi.org\/10.1145\/2736277.2741093","DOI":"10.1145\/2736277.2741093"},{"key":"568_CR27","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/BF02288916","volume":"17","author":"W Torgerson","year":"1952","unstructured":"Torgerson W (1952) Multidimensional scaling: I. Theory and method. Psychometrika 17:401\u2013419","journal-title":"Psychometrika"},{"issue":"4","key":"568_CR28","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 (2007) A tutorial on spectral clustering. Stat Comput 17(4):395\u2013416","journal-title":"Stat Comput"},{"key":"568_CR29","doi-asserted-by":"publisher","unstructured":"Wang D, Cui P, Zhu W (2016) Structural deep network embedding. In: Proceedings of the 22nd ACM SIGKDD international conference on knowledge discovery and data mining, KDD \u201916. Association for Computing Machinery, New York, NY, USA, pp 1225\u20131234. https:\/\/doi.org\/10.1145\/2939672.2939753","DOI":"10.1145\/2939672.2939753"},{"key":"568_CR30","doi-asserted-by":"publisher","unstructured":"Yang D, Qu B, Yang J, Cudre-Mauroux P (2019) Revisiting user mobility and social relationships in LBSNs: a hypergraph embedding approach. In: The World Wide Web conference, WWW \u201919. Association for Computing Machinery, New York, NY, USA, pp 2147\u20132157. https:\/\/doi.org\/10.1145\/3308558.3313635","DOI":"10.1145\/3308558.3313635"},{"key":"568_CR31","doi-asserted-by":"crossref","unstructured":"Zhou D, Huang J, Sch\u00f6lkopf B (2006) Learning with hypergraphs: clustering, classification, and embedding. In: Proceedings of the 19th international conference on neural information processing systems, NIPS\u201906. MIT Press, Cambridge, MA, USA, pp 1601\u20131608","DOI":"10.7551\/mitpress\/7503.003.0205"}],"container-title":["Applied Network Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41109-023-00568-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s41109-023-00568-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41109-023-00568-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,7]],"date-time":"2023-07-07T13:12:50Z","timestamp":1688735570000},"score":1,"resource":{"primary":{"URL":"https:\/\/appliednetsci.springeropen.com\/articles\/10.1007\/s41109-023-00568-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7,7]]},"references-count":31,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2023,12]]}},"alternative-id":["568"],"URL":"https:\/\/doi.org\/10.1007\/s41109-023-00568-1","relation":{},"ISSN":["2364-8228"],"issn-type":[{"type":"electronic","value":"2364-8228"}],"subject":[],"published":{"date-parts":[[2023,7,7]]},"assertion":[{"value":"12 March 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 June 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 July 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Not applicable.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval and consent to participate"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}},{"value":"All authors declare no financial and non-financial competing interests.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"41"}}