{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:20:23Z","timestamp":1740122423464,"version":"3.37.3"},"reference-count":100,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2023,7,26]],"date-time":"2023-07-26T00:00:00Z","timestamp":1690329600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,7,26]],"date-time":"2023-07-26T00:00:00Z","timestamp":1690329600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100003725","name":"National Research Foundation of Korea","doi-asserted-by":"crossref","award":["NRF-2020R1C1C1008296"],"id":[{"id":"10.13039\/501100003725","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Samsung Electronics Co., Ltd."},{"DOI":"10.13039\/501100010418","name":"Institute for Information and Communications Technology Promotion","doi-asserted-by":"publisher","award":["2022-0-00157","2019-0-00075"],"id":[{"id":"10.13039\/501100010418","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Data Min Knowl Disc"],"published-print":{"date-parts":[[2023,11]]},"DOI":"10.1007\/s10618-023-00952-6","type":"journal-article","created":{"date-parts":[[2023,7,26]],"date-time":"2023-07-26T13:02:49Z","timestamp":1690376569000},"page":"2216-2254","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Datasets, tasks, and training methods for large-scale hypergraph learning"],"prefix":"10.1007","volume":"37","author":[{"given":"Sunwoo","family":"Kim","sequence":"first","affiliation":[]},{"given":"Dongjin","family":"Lee","sequence":"additional","affiliation":[]},{"given":"Yul","family":"Kim","sequence":"additional","affiliation":[]},{"given":"Jungho","family":"Park","sequence":"additional","affiliation":[]},{"given":"Taeho","family":"Hwang","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2872-1526","authenticated-orcid":false,"given":"Kijung","family":"Shin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,7,26]]},"reference":[{"key":"952_CR1","doi-asserted-by":"publisher","unstructured":"Addanki R, Battaglia P, Budden D, et\u00a0al (2021) Large-scale graph representation learning with very deep GNNs and self-supervision. arXiv:2107.09422, https:\/\/doi.org\/10.48550\/arXiv.2107.09422","DOI":"10.48550\/arXiv.2107.09422"},{"issue":"8","key":"952_CR2","doi-asserted-by":"publisher","first-page":"4110","DOI":"10.1109\/TPAMI.2021.3066111","volume":"44","author":"I Ahmed","year":"2021","unstructured":"Ahmed I, Galoppo T, Hu X et al (2021) Graph regularized autoencoder and its application in unsupervised anomaly detection. IEEE Trans Pattern Anal Mach Intell (TPAMI) 44(8):4110\u20134124. https:\/\/doi.org\/10.1109\/TPAMI.2021.3066111","journal-title":"IEEE Trans Pattern Anal Mach Intell (TPAMI)"},{"key":"952_CR3","doi-asserted-by":"publisher","unstructured":"Arya D, Gupta DK, Rudinac S, et\u00a0al (2020) HyperSAGE: Generalizing inductive representation learning on hypergraphs. arXiv:2010.04558, https:\/\/doi.org\/10.48550\/arXiv.2010.04558","DOI":"10.48550\/arXiv.2010.04558"},{"issue":"107","key":"952_CR4","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1016\/j.patcog.2020.107637","volume":"110","author":"S Bai","year":"2021","unstructured":"Bai S, Zhang F, Torr PH (2021) Hypergraph convolution and hypergraph attention. Pattern Recogn 110(107):637. https:\/\/doi.org\/10.1016\/j.patcog.2020.107637","journal-title":"Pattern Recogn"},{"issue":"48","key":"952_CR5","doi-asserted-by":"publisher","first-page":"E11221","DOI":"10.1073\/pnas.1800683115","volume":"115","author":"AR Benson","year":"2018","unstructured":"Benson AR, Abebe R, Schaub MT et al (2018) Simplicial closure and higher-order link prediction. Proceed Nat Acad Sci 115(48):E11221\u2013E11230. https:\/\/doi.org\/10.1073\/pnas.1800683115","journal-title":"Proceed Nat Acad Sci"},{"key":"952_CR6","doi-asserted-by":"publisher","unstructured":"Caldwell AE, Kahng AB, Markov IL (2000) Improved algorithms for hypergraph bipartitioning. In: Proceedings of the 2000 Asia and South pacific design automation conference (ASP-DAC), pp 661\u2013666, https:\/\/doi.org\/10.1109\/ASPDAC.2000.835182","DOI":"10.1109\/ASPDAC.2000.835182"},{"key":"952_CR7","doi-asserted-by":"publisher","unstructured":"Caron E, van Eck NJ (2014) Large scale author name disambiguation using rule-based scoring and clustering. In: Proceedings of the 19th international conference on science and technology indicators (STI), pp 79\u201386, https:\/\/doi.org\/10.1007\/978-981-32-9298-7_12","DOI":"10.1007\/978-981-32-9298-7_12"},{"key":"952_CR8","doi-asserted-by":"publisher","unstructured":"\u00c7ataly\u00fcrek \u00dcV, Aykanat C (2011) PaToH (partitioning tool for hypergraphs). In: Encyclopedia of parallel computing. Springer, pp 1479\u20131487, https:\/\/doi.org\/10.1007\/978-0-387-09766-4_93","DOI":"10.1007\/978-0-387-09766-4_93"},{"key":"952_CR9","doi-asserted-by":"publisher","unstructured":"Chen J, Ma T, Xiao C (2018a) FastGCN: Fast learning with graph convolutional networks via importance sampling. In: International conference on learning representations (ICLR), https:\/\/doi.org\/10.48550\/arXiv.1801.10247","DOI":"10.48550\/arXiv.1801.10247"},{"key":"952_CR10","doi-asserted-by":"publisher","unstructured":"Chen J, Zhu J, Song L (2018b) Stochastic training of graph convolutional networks with variance reduction. In: International conference on machine learning (ICML), pp 942\u2013950, https:\/\/doi.org\/10.48550\/arXiv.1710.10568","DOI":"10.48550\/arXiv.1710.10568"},{"key":"952_CR11","doi-asserted-by":"publisher","unstructured":"Chen T, Kornblith S, Norouzi M, et\u00a0al. (2020) A simple framework for contrastive learning of visual representations. In: International conference on machine learning (ICML), pp 1597\u20131607, https:\/\/doi.org\/10.48550\/arXiv.2002.05709","DOI":"10.48550\/arXiv.2002.05709"},{"key":"952_CR12","doi-asserted-by":"publisher","unstructured":"Chiang WL, Liu X, Si S, et\u00a0al (2019) Cluster-GCN: An efficient algorithm for training deep and large graph convolutional networks. In: Proceedings of the 25th ACM SIGKDD international conference on knowledge discovery & data mining (KDD), pp 257\u2013266, https:\/\/doi.org\/10.1145\/3292500.3330925","DOI":"10.1145\/3292500.3330925"},{"key":"952_CR13","doi-asserted-by":"publisher","unstructured":"Chien E, Pan C, Peng J, et\u00a0al (2021) You are AllSet: A multiset function framework for hypergraph neural networks. In: International conference on learning representations (ICLR), https:\/\/doi.org\/10.48550\/arXiv.2106.13264","DOI":"10.48550\/arXiv.2106.13264"},{"key":"952_CR14","doi-asserted-by":"publisher","first-page":"eabh1303","DOI":"10.1126\/sciadv.abh1303","volume":"28","author":"PS Chodrow","year":"2021","unstructured":"Chodrow PS, Veldt N, Benson AR (2021) Generative hypergraph clustering: from blockmodels to modularity. Sci Adv 28:eabh1303. https:\/\/doi.org\/10.1126\/sciadv.abh1303","journal-title":"Sci Adv"},{"issue":"1","key":"952_CR15","doi-asserted-by":"publisher","first-page":"7229","DOI":"10.1038\/s41467-022-34714-7","volume":"13","author":"M Contisciani","year":"2022","unstructured":"Contisciani M, Battiston F, De Bacco C (2022) Inference of hyperedges and overlapping communities in hypergraphs. Nat Commun 13(1):7229. https:\/\/doi.org\/10.1038\/s41467-022-34714-7","journal-title":"Nat Commun"},{"key":"952_CR16","doi-asserted-by":"publisher","first-page":"47114","DOI":"10.1109\/ACCESS.2019.2909089","volume":"7","author":"K Deng","year":"2019","unstructured":"Deng K, Xing L, Zheng L et al (2019) A user identification algorithm based on user behavior analysis in social networks. IEEE Access 7:47114\u201347123. https:\/\/doi.org\/10.1109\/ACCESS.2019.2909089","journal-title":"IEEE Access"},{"key":"952_CR17","doi-asserted-by":"publisher","unstructured":"Do MT, Yoon Se, Hooi B, et\u00a0al (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), pp 176\u2013186, https:\/\/doi.org\/10.1145\/3394486.3403060","DOI":"10.1145\/3394486.3403060"},{"key":"952_CR18","doi-asserted-by":"publisher","unstructured":"Dong Y, Sawin W, Bengio Y (2020) HNHN: hypergraph networks with hyperedge neurons. arXiv:2006.12278, https:\/\/doi.org\/10.48550\/arXiv.2006.12278","DOI":"10.48550\/arXiv.2006.12278"},{"key":"952_CR19","doi-asserted-by":"publisher","unstructured":"Feng Y, You H, Zhang Z, et\u00a0al (2019) Hypergraph neural networks. In: Proceedings of the AAAI conference on artificial intelligence (AAAI), pp 3558\u20133565, https:\/\/doi.org\/10.1609\/aaai.v33i01.33013558","DOI":"10.1609\/aaai.v33i01.33013558"},{"key":"952_CR20","doi-asserted-by":"publisher","unstructured":"Fey M, Lenssen JE (2019) Fast graph representation learning with pytorch geometric. arXiv:1903.02428, https:\/\/doi.org\/10.48550\/arXiv.1903.02428","DOI":"10.48550\/arXiv.1903.02428"},{"key":"952_CR21","doi-asserted-by":"publisher","unstructured":"Gao T, Yao X, Chen D (2021) SimCSE: Simple contrastive learning of sentence embeddings. In: Proceedings of the 2021 conference on empirical methods in natural language processing (EMNLP), pp 6894\u20136910, https:\/\/doi.org\/10.18653\/v1\/2021.emnlp-main.552","DOI":"10.18653\/v1\/2021.emnlp-main.552"},{"issue":"12","key":"952_CR22","doi-asserted-by":"publisher","first-page":"7821","DOI":"10.1073\/pnas.122653799","volume":"99","author":"M Girvan","year":"2002","unstructured":"Girvan M, Newman ME (2002) Community structure in social and biological networks. Proc Natl Acad Sci 99(12):7821\u20137826. https:\/\/doi.org\/10.1073\/pnas.122653799","journal-title":"Proc Natl Acad Sci"},{"key":"952_CR23","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), pp 855\u2013864, https:\/\/doi.org\/10.1145\/2939672.2939754","DOI":"10.1145\/2939672.2939754"},{"issue":"13","key":"952_CR24","doi-asserted-by":"publisher","first-page":"8102","DOI":"10.3390\/ijerph19138102","volume":"19","author":"G Grunig","year":"2022","unstructured":"Grunig G, Durmus N, Zhang Y et al (2022) Molecular clustering analysis of blood biomarkers in world trade center exposed community members with persistent lower respiratory symptoms. Int J Environ Res Public Health 19(13):8102. https:\/\/doi.org\/10.3390\/ijerph19138102","journal-title":"Int J Environ Res Public Health"},{"key":"952_CR25","doi-asserted-by":"publisher","unstructured":"Guo M, Yi T, Zhu Y, et\u00a0al (2021) JITuNE: Just-in-time hyperparameter tuning for network embedding algorithms. arXiv:2101.06427, https:\/\/doi.org\/10.48550\/arXiv.2101.06427","DOI":"10.48550\/arXiv.2101.06427"},{"key":"952_CR26","doi-asserted-by":"publisher","unstructured":"Hamilton WL, Ying R, Leskovec J (2017) Inductive representation learning on large graphs. In: Advances in neural information processing systems (NeurIPS), https:\/\/doi.org\/10.48550\/arXiv.1706.02216","DOI":"10.48550\/arXiv.1706.02216"},{"key":"952_CR27","doi-asserted-by":"publisher","unstructured":"Hassani K, Khasahmadi AH (2020) Contrastive multi-view representation learning on graphs. In: International conference on machine learning (ICML), pp 4116\u20134126, https:\/\/doi.org\/10.48550\/arXiv.2006.05582","DOI":"10.48550\/arXiv.2006.05582"},{"key":"952_CR28","doi-asserted-by":"publisher","unstructured":"He K, Fan H, Wu Y, et\u00a0al (2020) Momentum contrast for unsupervised visual representation learning. In: Proceedings of the IEEE\/CVF conference on computer vision and pattern recognition (CVPR), pp 9729\u20139738, https:\/\/doi.org\/10.48550\/arXiv.1911.05722","DOI":"10.48550\/arXiv.1911.05722"},{"key":"952_CR29","doi-asserted-by":"publisher","unstructured":"Hein M, Setzer S, Jost L, et\u00a0al (2013) The total variation on hypergraphs-learning on hypergraphs revisited. In: Advances in neural information processing systems (NeurIPS), https:\/\/doi.org\/10.48550\/arXiv.1312.5179","DOI":"10.48550\/arXiv.1312.5179"},{"key":"952_CR30","doi-asserted-by":"publisher","unstructured":"Huang J, Yang J (2021) UniGNN: A unified framework for graph and hypergraph neural networks. In: Proceedings of the Thirtieth international joint conference on artificial intelligence (IJCAI), pp 2563\u20132569, https:\/\/doi.org\/10.24963\/ijcai.2021\/353","DOI":"10.24963\/ijcai.2021\/353"},{"key":"952_CR31","doi-asserted-by":"publisher","unstructured":"Huang W, Zhang T, Rong Y, et\u00a0al (2018) Adaptive sampling towards fast graph representation learning. In: Advances in neural information processing systems (NeurIPS), https:\/\/doi.org\/10.48550\/arXiv.1809.05343","DOI":"10.48550\/arXiv.1809.05343"},{"key":"952_CR32","doi-asserted-by":"publisher","unstructured":"Hwang H, Lee S, Park C, et\u00a0al (2022) AHP: learning to negative sample for hyperedge prediction. In: Proceedings of the 45th International ACM SIGIR conference on research and development in information retrieval (SIGIR), pp 2237\u20132242, https:\/\/doi.org\/10.1145\/3477495.3531836","DOI":"10.1145\/3477495.3531836"},{"key":"952_CR33","doi-asserted-by":"publisher","unstructured":"Jecmen S, Yoon M, Conitzer V, et\u00a0al (2023) A dataset on malicious paper bidding in peer review. In: Proceedings of the ACM web conference 2023 (WWW), pp 3816\u20133826, https:\/\/doi.org\/10.1145\/3543507.3583424","DOI":"10.1145\/3543507.3583424"},{"key":"952_CR34","doi-asserted-by":"publisher","unstructured":"Karypis G, Aggarwal R, Kumar V, et\u00a0al (1997) Multilevel hypergraph partitioning: Application in VLSI domain. In: Proceedings of the 34th annual Design Automation Conference (DAC), pp 526\u2013529, https:\/\/doi.org\/10.1145\/266021.266273","DOI":"10.1145\/266021.266273"},{"key":"952_CR35","doi-asserted-by":"publisher","unstructured":"Kim S, Choe M, Yoo J, et\u00a0al (2022) Reciprocity in directed hypergraphs: measures, findings, and generators. In: IEEE International conference on data mining (ICDM), https:\/\/doi.org\/10.1109\/ICDM54844.2022.00122","DOI":"10.1109\/ICDM54844.2022.00122"},{"key":"952_CR36","doi-asserted-by":"publisher","unstructured":"Kingma DP, Ba J (2015) Adam: a method for stochastic optimization. In: International conference on learning representations (ICLR), https:\/\/doi.org\/10.48550\/arXiv.1412.6980","DOI":"10.48550\/arXiv.1412.6980"},{"key":"952_CR37","doi-asserted-by":"publisher","unstructured":"Kipf TN, Welling M (2017) Semi-supervised classification with graph convolutional networks. In: International conference on learning representations (ICLR), https:\/\/doi.org\/10.48550\/arXiv.1609.02907","DOI":"10.48550\/arXiv.1609.02907"},{"issue":"5","key":"952_CR38","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pcbi.1000385","volume":"5","author":"S Klamt","year":"2009","unstructured":"Klamt S, Haus UU, Theis F (2009) Hypergraphs and cellular networks. PLoS Comput Biol 5(5):e1000385. https:\/\/doi.org\/10.1371\/journal.pcbi.1000385","journal-title":"PLoS Comput Biol"},{"issue":"11","key":"952_CR39","doi-asserted-by":"publisher","first-page":"2883","DOI":"10.1007\/s10115-022-01739-9","volume":"64","author":"J Ko","year":"2022","unstructured":"Ko J, Kook Y, Shin K (2022) Growth patterns and models of real-world hypergraphs. Knowl Inf Syst 64(11):2883\u20132920. https:\/\/doi.org\/10.1007\/s10115-022-01739-9","journal-title":"Knowl Inf Syst"},{"issue":"1\u20133","key":"952_CR40","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1016\/S0012-365X(00)00290-9","volume":"235","author":"EV Konstantinova","year":"2001","unstructured":"Konstantinova EV, Skorobogatov VA (2001) Application of hypergraph theory in chemistry. Discret Math 235(1\u20133):365\u2013383. https:\/\/doi.org\/10.1016\/S0012-365X(00)00290-9","journal-title":"Discret Math"},{"issue":"8","key":"952_CR41","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1109\/MC.2009.263","volume":"42","author":"Y Koren","year":"2009","unstructured":"Koren Y, Bell R, Volinsky C (2009) Matrix factorization techniques for recommender systems. Computer 42(8):30\u201337. https:\/\/doi.org\/10.1109\/MC.2009.263","journal-title":"Computer"},{"key":"952_CR42","doi-asserted-by":"publisher","unstructured":"Lee D, Shin K (2023) I\u2019m me, we\u2019re us, and i\u2019m us: Tri-directional contrastive learning on hypergraphs. In: Proceedings of the AAAI conference on artificial intelligence (AAAI), https:\/\/doi.org\/10.48550\/arXiv.2206.04739","DOI":"10.48550\/arXiv.2206.04739"},{"key":"952_CR43","doi-asserted-by":"publisher","unstructured":"Lee G, Choe M, Shin K (2021) How do hyperedges overlap in real-world hypergraphs?-patterns, measures, and generators. In: Proceedings of the web conference 2021 (WWW), pp 3396\u20133407, https:\/\/doi.org\/10.1145\/3442381.3450010","DOI":"10.1145\/3442381.3450010"},{"key":"952_CR44","doi-asserted-by":"publisher","unstructured":"Lee J, Lee Y, Kim J, et\u00a0al (2019) Set transformer: a framework for attention-based permutation-invariant neural networks. In: International conference on machine learning (ICML), pp 3744\u20133753, https:\/\/doi.org\/10.48550\/arXiv.1810.00825","DOI":"10.48550\/arXiv.1810.00825"},{"key":"952_CR45","doi-asserted-by":"publisher","unstructured":"Li P, Milenkovic O (2018) Submodular hypergraphs: p-laplacians, cheeger inequalities and spectral clustering. In: International conference on machine learning (ICML), pp 3014\u20133023, https:\/\/doi.org\/10.48550\/arXiv.1803.03833","DOI":"10.48550\/arXiv.1803.03833"},{"key":"952_CR46","doi-asserted-by":"publisher","unstructured":"Li Z, Huang C, Xia L, et\u00a0al (2022) Spatial-temporal hypergraph self-supervised learning for crime prediction. In: IEEE 38th international conference on data engineering (ICDE), pp 2984\u20132996, https:\/\/doi.org\/10.1109\/ICDE53745.2022.00269","DOI":"10.1109\/ICDE53745.2022.00269"},{"key":"952_CR47","doi-asserted-by":"publisher","unstructured":"Liu Z, Ma Y, Ouyang Y, et\u00a0al (2021) Contrastive learning for recommender system. arXiv:2101.01317, https:\/\/doi.org\/10.48550\/arXiv.2101.01317","DOI":"10.48550\/arXiv.2101.01317"},{"key":"952_CR48","doi-asserted-by":"publisher","unstructured":"Luo Q, Yu D, Cai Z, et\u00a0al (2021) Hypercore maintenance in dynamic hypergraphs. In: IEEE 37th international conference on data engineering (ICDE), pp 2051\u20132056, https:\/\/doi.org\/10.1109\/ICDE51399.2021.00199","DOI":"10.1109\/ICDE51399.2021.00199"},{"key":"952_CR49","doi-asserted-by":"publisher","unstructured":"Luo X, Ju W, Qu M, et\u00a0al (2022) DualGraph: Improving semi-supervised graph classification via dual contrastive learning. In: IEEE 38th international conference on data engineering (ICDE), pp 699\u2013712, https:\/\/doi.org\/10.1109\/ICDE53745.2022.00057","DOI":"10.1109\/ICDE53745.2022.00057"},{"issue":"6","key":"952_CR50","doi-asserted-by":"publisher","first-page":"653","DOI":"10.1007\/s10207-016-0340-2","volume":"16","author":"A Malatras","year":"2017","unstructured":"Malatras A, Geneiatakis D, Vakalis I (2017) On the efficiency of user identification: a system-based approach. Int J Inf Secur 16(6):653\u2013671. https:\/\/doi.org\/10.1007\/s10207-016-0340-2","journal-title":"Int J Inf Secur"},{"key":"952_CR51","doi-asserted-by":"publisher","unstructured":"Maleki S, Saless D, Wall DP, et\u00a0al (2022) HyperNetVec: Fast and scalable hierarchical embedding for hypergraphs. In: Network Science (NetSci), Springer, pp 169\u2013183, https:\/\/doi.org\/10.1007\/978-3-030-97240-0_13","DOI":"10.1007\/978-3-030-97240-0_13"},{"key":"952_CR52","doi-asserted-by":"publisher","unstructured":"Mayer C, Mayer R, Bhowmik S, et\u00a0al (2018) HYPE: Massive hypergraph partitioning with neighborhood expansion. In: IEEE International conference on big data (Big Data), pp 458\u2013467, https:\/\/doi.org\/10.1109\/BigData.2018.8621968","DOI":"10.1109\/BigData.2018.8621968"},{"issue":"4","key":"952_CR53","doi-asserted-by":"publisher","first-page":"767","DOI":"10.1016\/j.joi.2013.06.006","volume":"7","author":"S Milojevi\u0107","year":"2013","unstructured":"Milojevi\u0107 S (2013) Accuracy of simple, initials-based methods for author name disambiguation. J Informet 7(4):767\u2013773. https:\/\/doi.org\/10.1016\/j.joi.2013.06.006","journal-title":"J Informet"},{"key":"952_CR54","doi-asserted-by":"publisher","unstructured":"Muttakin MN, Hossain MI, Rahman MS (2022) Overlapping community detection using dynamic dilated aggregation in deep residual GCN. arXiv:2210.11174, https:\/\/doi.org\/10.48550\/arXiv.2210.11174","DOI":"10.48550\/arXiv.2210.11174"},{"key":"952_CR55","unstructured":"Nair V, Hinton GE (2010) Rectified linear units improve restricted boltzmann machines. In: Proceedings of the 27th international conference on machine learning (ICML-10), pp 807\u2013814"},{"key":"952_CR56","doi-asserted-by":"publisher","unstructured":"Oord Avd, Li Y, Vinyals O (2018) Representation learning with contrastive predictive coding. arXiv:1807.03748, https:\/\/doi.org\/10.48550\/arXiv.1807.03748","DOI":"10.48550\/arXiv.1807.03748"},{"key":"952_CR57","doi-asserted-by":"publisher","unstructured":"Paszke A, Gross S, Massa F, et\u00a0al (2019) PyTorch: An imperative style, high-performance deep learning library. In: Advances in Neural information processing systems (NeurIPS), https:\/\/doi.org\/10.48550\/arXiv.1912.01703","DOI":"10.48550\/arXiv.1912.01703"},{"key":"952_CR58","doi-asserted-by":"publisher","unstructured":"Pennington J, Socher R, Manning CD (2014) GloVe: Global vectors for word representation. In: Proceedings of the 2014 conference on empirical methods in natural language processing (EMNLP), pp 1532\u20131543, https:\/\/doi.org\/10.3115\/v1\/D14-1162","DOI":"10.3115\/v1\/D14-1162"},{"issue":"9","key":"952_CR59","doi-asserted-by":"publisher","first-page":"2784","DOI":"10.3390\/s18092784","volume":"18","author":"C Qu","year":"2018","unstructured":"Qu C, Tao M, Yuan R (2018) A hypergraph-based blockchain model and application in internet of things-enabled smart homes. Sensors 18(9):2784. https:\/\/doi.org\/10.3390\/s18092784","journal-title":"Sensors"},{"key":"952_CR60","doi-asserted-by":"publisher","unstructured":"Robinson J, Chuang CY, Sra S, et\u00a0al (2021) Contrastive learning with hard negative samples. In: International conference on learning representations (ICLR), https:\/\/doi.org\/10.48550\/arXiv.2010.04592","DOI":"10.48550\/arXiv.2010.04592"},{"issue":"2","key":"952_CR61","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3172867","volume":"51","author":"G Rossetti","year":"2018","unstructured":"Rossetti G, Cazabet R (2018) Community discovery in dynamic networks: a survey. ACM Comput Surv 51(2):1\u201337. https:\/\/doi.org\/10.1145\/3172867","journal-title":"ACM Comput Surv"},{"key":"952_CR62","doi-asserted-by":"publisher","unstructured":"Rossi E, Frasca F, Chamberlain B, et\u00a0al (2020) SIGN: scalable inception graph neural networks. arXiv:2004.11198, https:\/\/doi.org\/10.48550\/arXiv.2004.11198","DOI":"10.48550\/arXiv.2004.11198"},{"key":"952_CR63","doi-asserted-by":"publisher","unstructured":"Rossi R, Ahmed N (2015) The network data repository with interactive graph analytics and visualization. In: Proceedings of the AAAI conference on artificial intelligence (AAAI), https:\/\/doi.org\/10.1609\/aaai.v29i1.9277","DOI":"10.1609\/aaai.v29i1.9277"},{"key":"952_CR64","doi-asserted-by":"publisher","unstructured":"Ruan B, Gan J, Wu H, et\u00a0al (2021) Dynamic structural clustering on graphs. In: Proceedings of the 2021 international conference on management of data (SIGMOD), pp 1491\u20131503, https:\/\/doi.org\/10.1145\/3448016.3452828","DOI":"10.1145\/3448016.3452828"},{"issue":"6088","key":"952_CR65","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1038\/323533a0","volume":"323","author":"DE Rumelhart","year":"1986","unstructured":"Rumelhart DE, Hinton GE, Williams RJ (1986) Learning representations by back-propagating errors. Nature 323(6088):533\u2013536. https:\/\/doi.org\/10.1038\/323533a0","journal-title":"Nature"},{"issue":"2","key":"952_CR66","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1177\/0165551519888605","volume":"47","author":"DK Sanyal","year":"2021","unstructured":"Sanyal DK, Bhowmick PK, Das PP (2021) A review of author name disambiguation techniques for the PubMed bibliographic database. J Inf Sci 47(2):227\u2013254. https:\/\/doi.org\/10.1177\/0165551519888605","journal-title":"J Inf Sci"},{"key":"952_CR67","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3529090","volume":"27","author":"S Schlag","year":"2023","unstructured":"Schlag S, Heuer T, Gottesb\u00fcren L et al (2023) High-quality hypergraph partitioning. ACM J Exp Algorithmics 27:1\u201339. https:\/\/doi.org\/10.1145\/3529090","journal-title":"ACM J Exp Algorithmics"},{"key":"952_CR68","doi-asserted-by":"publisher","unstructured":"Shchur O, G\u00fcnnemann S (2019) Overlapping community detection with graph neural networks. arXiv:1909.12201, https:\/\/doi.org\/10.48550\/arXiv.1909.12201","DOI":"10.48550\/arXiv.1909.12201"},{"key":"952_CR69","doi-asserted-by":"publisher","unstructured":"Sinha A, Shen Z, Song Y, et\u00a0al (2015) An overview of microsoft academic service (MAS) and applications. In: Proceedings of the 24th international conference on world wide web (WWW), pp 243\u2013246, https:\/\/doi.org\/10.1145\/2740908.2742839","DOI":"10.1145\/2740908.2742839"},{"key":"952_CR70","doi-asserted-by":"publisher","unstructured":"Tang J, Zhang J, Yao L, et\u00a0al (2008) ArnetMiner: Extraction and mining of academic social networks. In: Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining (KDD), pp 990\u2013998, https:\/\/doi.org\/10.1145\/1401890.1402008","DOI":"10.1145\/1401890.1402008"},{"issue":"3","key":"952_CR71","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1137\/20M1355896","volume":"63","author":"L Torres","year":"2021","unstructured":"Torres L, Blevins AS, Bassett D et al (2021) The why, how, and when of representations for complex systems. SIAM Rev 63(3):435\u2013485. https:\/\/doi.org\/10.1137\/20M1355896","journal-title":"SIAM Rev"},{"key":"952_CR72","doi-asserted-by":"publisher","unstructured":"Tsitsulin A, Palowitch J, Perozzi B, et\u00a0al (2020) Graph clustering with graph neural networks. arXiv:2006.16904, https:\/\/doi.org\/10.48550\/arXiv.2006.16904","DOI":"10.48550\/arXiv.2006.16904"},{"issue":"8","key":"952_CR73","doi-asserted-by":"publisher","first-page":"3846","DOI":"10.1021\/acs.jcim.1c00670","volume":"61","author":"M Tynes","year":"2021","unstructured":"Tynes M, Gao W, Burrill DJ et al (2021) Pairwise difference regression: a machine learning meta-algorithm for improved prediction and uncertainty quantification in chemical search. J Chem Inf Model 61(8):3846\u20133857. https:\/\/doi.org\/10.1021\/acs.jcim.1c00670","journal-title":"J Chem Inf Model"},{"key":"952_CR74","doi-asserted-by":"publisher","unstructured":"Veli\u010dkovi\u0107 P, Fedus W, Hamilton WL, et\u00a0al (2018) Deep graph infomax. In: International conference on learning representations (ICLR), https:\/\/doi.org\/10.48550\/arXiv.1809.10341","DOI":"10.48550\/arXiv.1809.10341"},{"issue":"1","key":"952_CR75","doi-asserted-by":"publisher","first-page":"396","DOI":"10.1162\/qss_a_00021","volume":"1","author":"K Wang","year":"2020","unstructured":"Wang K, Shen Z, Huang C et al (2020) Microsoft academic graph: when experts are not enough. Quant Sci Stud 1(1):396\u2013413. https:\/\/doi.org\/10.1162\/qss_a_00021","journal-title":"Quant Sci Stud"},{"key":"952_CR76","doi-asserted-by":"publisher","unstructured":"Wang Z, Zheng L, Li Y, et\u00a0al (2019) Linkage based face clustering via graph convolution network. In: Proceedings of the IEEE\/CVF conference on computer vision and pattern recognition (CVPR), pp 1117\u20131125, https:\/\/doi.org\/10.1109\/CVPR.2019.00121","DOI":"10.1109\/CVPR.2019.00121"},{"key":"952_CR77","doi-asserted-by":"publisher","unstructured":"Wu F, Souza A, Zhang T, et\u00a0al (2019) Simplifying graph convolutional networks. In: International conference on machine learning (ICML), pp 6861\u20136871, https:\/\/doi.org\/10.48550\/arXiv.1902.07153","DOI":"10.48550\/arXiv.1902.07153"},{"key":"952_CR78","doi-asserted-by":"publisher","unstructured":"Xia X, Yin H, Yu J, et\u00a0al (2021) Self-supervised hypergraph convolutional networks for session-based recommendation. In: Proceedings of the AAAI conference on artificial intelligence (AAAI), pp 4503\u20134511, https:\/\/doi.org\/10.1609\/aaai.v35i5.16578","DOI":"10.1609\/aaai.v35i5.16578"},{"issue":"4","key":"952_CR79","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2501654.2501657","volume":"45","author":"J Xie","year":"2013","unstructured":"Xie J, Kelley S, Szymanski BK (2013) Overlapping community detection in networks: the state-of-the-art and comparative study. ACM Comput Surv 45(4):1\u201335. https:\/\/doi.org\/10.1145\/2501654.2501657","journal-title":"ACM Comput Surv"},{"key":"952_CR80","doi-asserted-by":"publisher","unstructured":"Xie X, Sun F, Liu Z, et\u00a0al (2022) Contrastive learning for sequential recommendation. In: IEEE 38th International conference on data engineering (ICDE), pp 1259\u20131273, https:\/\/doi.org\/10.1109\/ICDE53745.2022.00099","DOI":"10.1109\/ICDE53745.2022.00099"},{"key":"952_CR81","doi-asserted-by":"publisher","unstructured":"Yadati N, Nimishakavi M, Yadav P, et\u00a0al (2019) HyperGCN: a new method of training graph convolutional networks on hypergraphs. In: Advances in neural information processing systems (NeurIPS), pp 1509\u20131520, https:\/\/doi.org\/10.48550\/arXiv.1809.02589","DOI":"10.48550\/arXiv.1809.02589"},{"key":"952_CR82","doi-asserted-by":"publisher","unstructured":"Yadati N, Nitin V, Nimishakavi M, et\u00a0al (2020) NHP: neural hypergraph link prediction. In: Proceedings of the 29th ACM international conference on information & knowledge management (CIKM), pp 1705\u20131714, https:\/\/doi.org\/10.1145\/3340531.3411870","DOI":"10.1145\/3340531.3411870"},{"key":"952_CR83","doi-asserted-by":"publisher","unstructured":"Yang J, Leskovec J (2011) Patterns of temporal variation in online media. In: Proceedings of the fourth ACM international conference on Web search and data mining (WSDM), pp 177\u2013186, https:\/\/doi.org\/10.1145\/1935826.1935863","DOI":"10.1145\/1935826.1935863"},{"key":"952_CR84","doi-asserted-by":"publisher","unstructured":"Yang J, Leskovec J (2013) Overlapping community detection at scale: a nonnegative matrix factorization approach. In: Proceedings of the sixth ACM international conference on Web search and data mining (WSDM), pp 587\u2013596, https:\/\/doi.org\/10.1145\/2433396.2433471","DOI":"10.1145\/2433396.2433471"},{"key":"952_CR85","doi-asserted-by":"publisher","unstructured":"Yin N, Feng F, Luo Z, et\u00a0al (2022) Dynamic hypergraph convolutional network. In: IEEE 38th international conference on data engineering (ICDE), pp 1621\u20131634, https:\/\/doi.org\/10.1109\/ICDE53745.2022.00167","DOI":"10.1109\/ICDE53745.2022.00167"},{"key":"952_CR86","doi-asserted-by":"publisher","unstructured":"You Y, Chen T, Sui Y, et\u00a0al (2020) Graph contrastive learning with augmentations. In: Advances in neural information processing systems (NeurIPS), pp 5812\u20135823, https:\/\/doi.org\/10.48550\/arXiv.2010.13902","DOI":"10.48550\/arXiv.2010.13902"},{"key":"952_CR87","doi-asserted-by":"publisher","unstructured":"Yu J, Yin H, Li J, et\u00a0al (2021) Self-supervised multi-channel hypergraph convolutional network for social recommendation. In: Proceedings of the web conference 2021 (WWW), pp 413\u2013424, https:\/\/doi.org\/10.1145\/3442381.3449844","DOI":"10.1145\/3442381.3449844"},{"key":"952_CR88","doi-asserted-by":"publisher","unstructured":"Zaheer M, Kottur S, Ravanbhakhsh S, et\u00a0al (2017) Deep sets. In: Advances in neural information processing systems (NeurIPS), https:\/\/doi.org\/10.48550\/arXiv.1703.06114","DOI":"10.48550\/arXiv.1703.06114"},{"key":"952_CR89","doi-asserted-by":"publisher","unstructured":"Zeng H, Zhou H, Srivastava A, et\u00a0al (2019) GraphSAINT: Graph sampling based inductive learning method. In: International conference on learning representations (ICLR), https:\/\/doi.org\/10.48550\/arXiv.1907.04931","DOI":"10.48550\/arXiv.1907.04931"},{"key":"952_CR90","doi-asserted-by":"publisher","unstructured":"Zhang D, Huang X, Liu Z, et\u00a0al (2020a) AGL: A scalable system for industrial-purpose graph machine learning. Proc VLDB Endow (PVLDB) 13(12): 3125\u20133137. https:\/\/doi.org\/10.14778\/3415478.3415539","DOI":"10.14778\/3415478.3415539"},{"key":"952_CR91","doi-asserted-by":"publisher","unstructured":"Zhang F, Liu X, Tang J, et\u00a0al (2019) OAG: Toward linking large-scale heterogeneous entity graphs. In: Proceedings of the 25th ACM SIGKDD international conference on knowledge discovery & data mining (KDD), pp 2585\u20132595, https:\/\/doi.org\/10.1145\/3292500.3330785","DOI":"10.1145\/3292500.3330785"},{"key":"952_CR92","doi-asserted-by":"publisher","unstructured":"Zhang J, Gao M, Yu J, et\u00a0al (2021) Double-scale self-supervised hypergraph learning for group recommendation. In: Proceedings of the 30th ACM international conference on information & knowledge management (CIKM), pp 2557\u20132567, https:\/\/doi.org\/10.1145\/3459637.3482426","DOI":"10.1145\/3459637.3482426"},{"key":"952_CR93","doi-asserted-by":"publisher","unstructured":"Zhang J, Li F, Xiao X, et\u00a0al (2022) Hypergraph convolutional networks via equivalency between hypergraphs and undirected graphs. arXiv:2203.16939, https:\/\/doi.org\/10.48550\/arXiv.2203.16939","DOI":"10.48550\/arXiv.2203.16939"},{"key":"952_CR94","doi-asserted-by":"publisher","unstructured":"Zhang R, Zou Y, Ma J (2020b) Hyper-SAGNN: a self-attention based graph neural network for hypergraphs. In: International conference on learning representations (ICLR), https:\/\/doi.org\/10.48550\/arXiv.1911.02613","DOI":"10.48550\/arXiv.1911.02613"},{"key":"952_CR95","doi-asserted-by":"publisher","unstructured":"Zhang S, Tong H (2016) FINAL: Fast attributed network alignment. In: Proceedings of the 22nd ACM SIGKDD international conference on knowledge discovery and data (KDD), pp 1345\u20131354, https:\/\/doi.org\/10.1145\/2939672.2939766","DOI":"10.1145\/2939672.2939766"},{"key":"952_CR96","doi-asserted-by":"crossref","unstructured":"Zheng C, Chen H, Cheng Y, et al. (2022a) ByteGNN: efficient graph neural network training at large scale. Proc VLDB Endow (PVLDB) 15(6):1228\u20131242.https:\/\/doi.org\/10.14778\/3514061.3514069","DOI":"10.14778\/3514061.3514069"},{"key":"952_CR97","doi-asserted-by":"publisher","unstructured":"Zheng D, Ma C, Wang M, et\u00a0al (2020) DistDGL: Distributed graph neural network training for billion-scale graphs. In: IEEE\/ACM 10th workshop on irregular applications: architectures and algorithms (IA3), pp 36\u201344, https:\/\/doi.org\/10.1109\/IA351965.2020.00011","DOI":"10.1109\/IA351965.2020.00011"},{"key":"952_CR98","doi-asserted-by":"publisher","unstructured":"Zheng Y, Pan S, Lee VC, et\u00a0al (2022b) Rethinking and scaling up graph contrastive learning: an extremely efficient approach with group discrimination. In: Advances in neural information processing systems (NeurIPS), pp 10809\u201310820, https:\/\/doi.org\/10.48550\/arXiv.2206.01535","DOI":"10.48550\/arXiv.2206.01535"},{"key":"952_CR99","doi-asserted-by":"publisher","unstructured":"Zhu Y, Xu Y, Yu F, et\u00a0al (2020) Deep graph contrastive representation learning. arXiv:2006.04131, https:\/\/doi.org\/10.48550\/arXiv.2006.04131","DOI":"10.48550\/arXiv.2006.04131"},{"key":"952_CR100","doi-asserted-by":"publisher","unstructured":"Zhu Y, Xu Y, Yu F, et\u00a0al (2021) Graph contrastive learning with adaptive augmentation. In: Proceedings of the web conference 2021 (WWW), pp 2069\u20132080, https:\/\/doi.org\/10.1145\/3442381.3449802","DOI":"10.1145\/3442381.3449802"}],"container-title":["Data Mining and Knowledge Discovery"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-023-00952-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10618-023-00952-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-023-00952-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,13]],"date-time":"2023-10-13T09:20:21Z","timestamp":1697188821000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10618-023-00952-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7,26]]},"references-count":100,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2023,11]]}},"alternative-id":["952"],"URL":"https:\/\/doi.org\/10.1007\/s10618-023-00952-6","relation":{},"ISSN":["1384-5810","1573-756X"],"issn-type":[{"type":"print","value":"1384-5810"},{"type":"electronic","value":"1573-756X"}],"subject":[],"published":{"date-parts":[[2023,7,26]]},"assertion":[{"value":"10 February 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 June 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 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":"The authors have no relevant financial or non-financial interests to disclose.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}