{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T18:48:03Z","timestamp":1772909283119,"version":"3.50.1"},"reference-count":58,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2023,8,9]],"date-time":"2023-08-09T00:00:00Z","timestamp":1691539200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,8,9]],"date-time":"2023-08-09T00:00:00Z","timestamp":1691539200000},"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"],"award-info":[{"award-number":["NRF- 2020R1C1C1008296"]}],"id":[{"id":"10.13039\/501100003725","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Institute of Information and Communications Technology Planning & Evaluation of Korea","award":["2022-0-00871"],"award-info":[{"award-number":["2022-0-00871"]}]},{"name":"Institute of Information and Communications Technology Planning & Evaluation of Korea","award":["2019-0-00075"],"award-info":[{"award-number":["2019-0-00075"]}]}],"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-00958-0","type":"journal-article","created":{"date-parts":[[2023,8,9]],"date-time":"2023-08-09T17:01:45Z","timestamp":1691600505000},"page":"2438-2493","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Improving the core resilience of real-world hypergraphs"],"prefix":"10.1007","volume":"37","author":[{"given":"Manh Tuan","family":"Do","sequence":"first","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,8,9]]},"reference":[{"key":"958_CR1","doi-asserted-by":"publisher","unstructured":"Akoglu L, Faloutsos C (2013) Anomaly, event, and fraud detection in large network datasets. In: Proceedings of the 6th ACM international conference on web search and data mining (WSDM), pp 773\u2013774, https:\/\/doi.org\/10.1145\/2433396.2433496","DOI":"10.1145\/2433396.2433496"},{"key":"958_CR2","doi-asserted-by":"publisher","unstructured":"Amburg I, Veldt N, Benson A (2020) Clustering in graphs and hypergraphs with categorical edge labels. In: Proceedings of the web conference 2020 (WWW), pp 706\u2013717. https:\/\/doi.org\/10.1145\/3366423.3380152","DOI":"10.1145\/3366423.3380152"},{"key":"958_CR3","doi-asserted-by":"publisher","unstructured":"Aridhi S, Brugnara M, Montresor A, et\u00a0al (2016) Distributed k-core decomposition and maintenance in large dynamic graphs. In: Proceedings of the 10th ACM international conference on distributed and event-based systems (DEBS), pp 161\u2013168. https:\/\/doi.org\/10.1145\/2933267.2933299","DOI":"10.1145\/2933267.2933299"},{"key":"958_CR4","doi-asserted-by":"publisher","unstructured":"de\u00a0Arruda GF, Petri G, Moreno Y (2020) Social contagion models on hypergraphs. Phys Rev Res 2(2):023,032. https:\/\/doi.org\/10.1103\/PhysRevResearch.2.023032","DOI":"10.1103\/PhysRevResearch.2.023032"},{"key":"958_CR5","doi-asserted-by":"publisher","unstructured":"Benson AR, Abebe R, Schaub MT, et\u00a0al (2018a) Simplicial closure and higher-order link prediction. Proc Natl Acad Sci 115(48):E11,221\u2013E11,230. https:\/\/doi.org\/10.1073\/pnas.1800683115doi:","DOI":"10.1073\/pnas.1800683115"},{"key":"958_CR6","doi-asserted-by":"publisher","unstructured":"Benson AR, Kumar R, Tomkins A (2018b) Sequences of sets. In: Proceedings of the 24th ACM SIGKDD international conference on knowledge discovery and data mining (KDD), pp 1148\u20131157. https:\/\/doi.org\/10.1145\/3219819.3220100","DOI":"10.1145\/3219819.3220100"},{"issue":"3","key":"958_CR7","doi-asserted-by":"publisher","first-page":"1452","DOI":"10.1137\/14097032X","volume":"29","author":"K Bhawalkar","year":"2015","unstructured":"Bhawalkar K, Kleinberg J, Lewi K et al (2015) Preventing unraveling in social networks: the anchored k-core problem. SIAM J Discret Math 29(3):1452\u20131475. https:\/\/doi.org\/10.1137\/14097032X","journal-title":"SIAM J Discret Math"},{"issue":"1","key":"958_CR8","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1109\/TKDE.2021.3085570","volume":"32","author":"C Chen","year":"2021","unstructured":"Chen C, Zhu Q, Sun R et al (2021) Edge manipulation approaches for k-core minimization: metrics and analytics. IEEE Trans Knowl Data Eng 32(1):390\u2013403. https:\/\/doi.org\/10.1109\/TKDE.2021.3085570","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"958_CR9","doi-asserted-by":"publisher","unstructured":"Chien E, Pan C, Peng J, et\u00a0al (2022) You are AllSet: a multiset function framework for hypergraph neural networks. In: Proceedings of the 10th international conference on learning representations (ICLR). https:\/\/doi.org\/10.48550\/arXiv.2106.13264","DOI":"10.48550\/arXiv.2106.13264"},{"key":"958_CR10","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 and Data Mining (KDD), pp 176\u2013186. https:\/\/doi.org\/10.1145\/3394486.3403060","DOI":"10.1145\/3394486.3403060"},{"key":"958_CR11","doi-asserted-by":"publisher","unstructured":"Feng Y, You H, Zhang Z, et\u00a0al (2019) Hypergraph Neural Networks. In: Proceedings of the 33rd AAAI Conference on Artificial Intelligence (AAAI), pp 3558\u20133565. https:\/\/doi.org\/10.1609\/aaai.v33i01.33013558","DOI":"10.1609\/aaai.v33i01.33013558"},{"key":"958_CR12","doi-asserted-by":"publisher","unstructured":"Freitas S, Yang D, Kumar S, et\u00a0al (2022) Graph vulnerability and robustness: A survey. IEEE Transactions on Knowledge and Data Engineering pp 5915\u20135934. https:\/\/doi.org\/10.1109\/TKDE.2022.3163672doi:","DOI":"10.1109\/TKDE.2022.3163672"},{"key":"958_CR13","doi-asserted-by":"publisher","unstructured":"Gabert K, Pinar A, \u00c7ataly\u00fcrek \u00dcV (2021a) Shared-memory scalable k-core maintenance on dynamic graphs and hypergraphs. In: Proceedings of the 2021 IEEE international parallel and distributed processing symposium workshops (IPDPSW), IEEE, pp 998\u20131007. https:\/\/doi.org\/10.1109\/IPDPSW52791.2021.00158","DOI":"10.1109\/IPDPSW52791.2021.00158"},{"key":"958_CR14","doi-asserted-by":"publisher","unstructured":"Gabert K, Pinar A, \u00c7ataly\u00fcrek \u00dcV (2021b) A unifying framework to identify dense subgraphs on streams: graph nuclei to hypergraph cores. In: Proceedings of the 14th ACM international conference on web search and data mining (WSDM), pp 689\u2013697. https:\/\/doi.org\/10.1145\/3437963.3441790","DOI":"10.1145\/3437963.3441790"},{"key":"958_CR15","doi-asserted-by":"publisher","unstructured":"Giatsidis C, Thilikos DM, Vazirgiannis M (2011) Evaluating cooperation in communities with the k-Core Structure. In: Proceedings of the 2021 international conference on advances in social networks analysis and mining (ASONAM), pp 87\u201393. https:\/\/doi.org\/10.1109\/ASONAM.2011.65","DOI":"10.1109\/ASONAM.2011.65"},{"issue":"4","key":"958_CR16","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1017\/nws.2022.35","volume":"10","author":"F Giroire","year":"2022","unstructured":"Giroire F, Nisse N, Trolliet T et al (2022) Preferential attachment hypergraph with high modularity. Network Science 10(4):400\u2013429. https:\/\/doi.org\/10.1017\/nws.2022.35","journal-title":"Network Science"},{"key":"958_CR17","doi-asserted-by":"publisher","unstructured":"Huang Z, Chung W, Ong TH, et\u00a0al (2002) A Graph-Based Recommender System for Digital Library. In: Proceedings of the 2nd ACM\/IEEE-CS Joint Conference on Digital Libraries (JCDL), pp 65\u201373. https:\/\/doi.org\/10.1145\/544220.544231","DOI":"10.1145\/544220.544231"},{"key":"958_CR18","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"},{"issue":"1","key":"958_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1038\/s41467-019-10431-6","volume":"10","author":"I Iacopini","year":"2019","unstructured":"Iacopini I, Petri G, Barrat A et al (2019) Simplicial models of social contagion. Nat Commun 10(1):1\u20139. https:\/\/doi.org\/10.1038\/s41467-019-10431-6","journal-title":"Nat Commun"},{"key":"958_CR20","doi-asserted-by":"publisher","unstructured":"Kim S, Choe M, Yoo J, et\u00a0al (2022) Reciprocity in directed hypergraphs: measures, findings, and generators. In: Proceedings of the 2022 IEEE international conference on data mining (ICDM), pp 1005\u20131010, https:\/\/doi.org\/10.1109\/ICDM54844.2022.00122","DOI":"10.1109\/ICDM54844.2022.00122"},{"key":"958_CR21","doi-asserted-by":"crossref","unstructured":"Kim S, Bu F, Choe M, et\u00a0al (2023) How transitive are real-world group interactions?\u2013Measurement and reproduction. arXiv preprint arXiv:2306.02358","DOI":"10.1145\/3580305.3599382"},{"issue":"11","key":"958_CR22","doi-asserted-by":"publisher","first-page":"888","DOI":"10.1038\/nphys1746","volume":"6","author":"M Kitsak","year":"2010","unstructured":"Kitsak M, Gallos LK, Havlin S et al (2010) Identification of influential spreaders in complex networks. Nat Phys 6(11):888\u2013893. https:\/\/doi.org\/10.1038\/nphys1746","journal-title":"Nat Phys"},{"key":"958_CR23","doi-asserted-by":"publisher","unstructured":"Klimt B, Yang Y (2004) The enron corpus: a new dataset for email classification research. In: Proceedings of the 15th European conference on machine learning (ECML), Springer, pp 217\u2013226, https:\/\/doi.org\/10.1007\/978-3-540-30115-8_22","DOI":"10.1007\/978-3-540-30115-8_22"},{"key":"958_CR24","doi-asserted-by":"publisher","unstructured":"Kook Y, Ko J, Shin K (2020) Evolution of real-world hypergraphs: patterns and models without oracles. In: Proceedings of the 2020 IEEE international conference on data mining (ICDM), https:\/\/doi.org\/10.1109\/ICDM50108.2020.00036","DOI":"10.1109\/ICDM50108.2020.00036"},{"key":"958_CR25","doi-asserted-by":"publisher","unstructured":"Kumar T, Darwin K, Parthasarathy S, et\u00a0al (2020) PHPRA: hyperedge prediction using resource allocation. In: Proceedings of the 12th ACM conference on web science, pp 135\u2013143, https:\/\/doi.org\/10.1145\/3394231.3397903","DOI":"10.1145\/3394231.3397903"},{"key":"958_CR26","unstructured":"Laishram R (2020) The resilience of k-cores in graphs. PhD thesis, Syracuse University"},{"key":"958_CR27","doi-asserted-by":"publisher","unstructured":"Laishram R, Sariy\u00fcce A, Eliassi-Rad T, et\u00a0al (2018) Measuring and Improving the Core Resilience of Networks. In: Proceedings of the web conference 2018 (WWW), pp 609\u2013618, https:\/\/doi.org\/10.1145\/3178876.3186127","DOI":"10.1145\/3178876.3186127"},{"key":"958_CR28","doi-asserted-by":"publisher","unstructured":"Laishram R, Erdem\u00a0Sar A, Eliassi-Rad T, et\u00a0al (2020) Residual core maximization: an efficient algorithm for maximizing the size of the k-core. In: Proceedings of the 2020 SIAM international conference on data mining (SDM), pp 325\u2013333. https:\/\/doi.org\/10.1137\/1.9781611976236.37","DOI":"10.1137\/1.9781611976236.37"},{"issue":"11","key":"958_CR29","doi-asserted-by":"publisher","first-page":"2256","DOI":"10.14778\/3407790.3407823","volume":"13","author":"G Lee","year":"2020","unstructured":"Lee G, Ko J, Shin K (2020) Hypergraph motifs: concepts, algorithms, and discoveries. Proc VLDB Endow 13(11):2256\u20132269. https:\/\/doi.org\/10.14778\/3407790.3407823","journal-title":"Proc VLDB Endow"},{"key":"958_CR30","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":"958_CR31","doi-asserted-by":"publisher","unstructured":"Lei S, Maniu S, Mo L, et\u00a0al (2015) Online influence maximization. In: Proceedings of the 21th ACM SIGKDD international conference on knowledge discovery and data mining (KDD), pp 645\u2013654. https:\/\/doi.org\/10.1145\/2783258.2783271","DOI":"10.1145\/2783258.2783271"},{"issue":"11","key":"958_CR32","first-page":"2568","volume":"34","author":"M Leng","year":"2013","unstructured":"Leng M, Sun L, Jn Bian et al (2013) An O(m) algorithm for cores decomposition of undirected hypergraph. J Chin Comput Syst 34(11):2568\u20132573","journal-title":"J Chin Comput Syst"},{"key":"958_CR33","doi-asserted-by":"publisher","unstructured":"Li P, Milenkovic O (2017) Inhomogeneous hypergraph clustering with applications. In: Proceedings of the 31st international conference on neural information processing systems, pp 2305\u20132315. https:\/\/doi.org\/10.48550\/arXiv.1709.01249s","DOI":"10.48550\/arXiv.1709.01249s"},{"issue":"10","key":"958_CR34","doi-asserted-by":"publisher","first-page":"2453","DOI":"10.1109\/TKDE.2013.158","volume":"26","author":"RH Li","year":"2013","unstructured":"Li RH, Yu JX, Mao R (2013) Efficient core maintenance in large dynamic graphs. IEEE Trans Knowl Data Eng 26(10):2453\u20132465. https:\/\/doi.org\/10.1109\/TKDE.2013.158","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"5","key":"958_CR35","doi-asserted-by":"publisher","first-page":"757","DOI":"10.14778\/3446095.3446099","volume":"14","author":"Z Lin","year":"2021","unstructured":"Lin Z, Zhang F, Lin X et al (2021) Hierarchical core maintenance on large dynamic graphs. Proc VLDB Endow 14(5):757\u2013770. https:\/\/doi.org\/10.14778\/3446095.3446099","journal-title":"Proc VLDB Endow"},{"key":"958_CR36","doi-asserted-by":"publisher","unstructured":"Linghu Q, Zhang F, Lin X, et\u00a0al (2020) Global reinforcement of social networks: the anchored coreness problem. In: Proceedings of the 2020 ACM SIGMOD international conference on management of data (SIGMOD), pp 2211\u20132226. https:\/\/doi.org\/10.1145\/3318464.3389744","DOI":"10.1145\/3318464.3389744"},{"issue":"10\u201311","key":"958_CR37","doi-asserted-by":"publisher","first-page":"2255","DOI":"10.1016\/j.patcog.2010.07.014","volume":"44","author":"Q Liu","year":"2011","unstructured":"Liu Q, Huang Y, Metaxas DN (2011) Hypergraph with sampling for image retrieval. Pattern Recogn 44(10\u201311):2255\u20132262. https:\/\/doi.org\/10.1016\/j.patcog.2010.07.014","journal-title":"Pattern Recogn"},{"key":"958_CR38","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1016\/j.physa.2018.06.122","volume":"510","author":"X Ma","year":"2018","unstructured":"Ma X, Ma F, Yin J et al (2018) Cascading failures of k uniform hyper-network based on the hyper adjacent matrix. Physica A 510:281\u2013289. https:\/\/doi.org\/10.1016\/j.physa.2018.06.122","journal-title":"Physica A"},{"key":"958_CR39","doi-asserted-by":"publisher","unstructured":"Medya S, Ma T, Silva A, et\u00a0al (2020) A game theoretic approach for core resilience. In: Proceedings of the 29th international joint conference on artificial intelligence (IJCAI), pp 3473\u20133479. https:\/\/doi.org\/10.24963\/ijcai.2020\/480","DOI":"10.24963\/ijcai.2020\/480"},{"issue":"107","key":"958_CR40","doi-asserted-by":"publisher","first-page":"564","DOI":"10.1016\/j.compeleceng.2021.107564","volume":"96","author":"G Mei","year":"2021","unstructured":"Mei G, Tu J, Xiao L et al (2021) An efficient graph clustering algorithm by exploiting k-core decomposition and motifs. Comput Electric Eng 96(107):564. https:\/\/doi.org\/10.1016\/j.compeleceng.2021.107564","journal-title":"Comput Electric Eng"},{"issue":"6","key":"958_CR41","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1109\/TCAD.2002.1004312","volume":"21","author":"M Ouyang","year":"2002","unstructured":"Ouyang M, Toulouse M, Thulasiraman K et al (2002) Multilevel cooperative search for the circuit\/hypergraph partitioning problem. IEEE Trans Comput Aided Des Integr Circuits Syst 21(6):685\u2013693. https:\/\/doi.org\/10.1109\/TCAD.2002.1004312","journal-title":"IEEE Trans Comput Aided Des Integr Circuits Syst"},{"key":"958_CR42","doi-asserted-by":"publisher","unstructured":"Peng H, Qian C, Zhao D, et\u00a0al (2022) Targeting attack hypergraph networks. Chaos Interdiscip J Nonlinear Sci 32(7):073,121. https:\/\/doi.org\/10.1063\/5.0090626","DOI":"10.1063\/5.0090626"},{"key":"958_CR43","doi-asserted-by":"publisher","unstructured":"Peng Y, Zhang Y, Zhang W, et\u00a0al (2018) Efficient Probabilistic K-Core Computation on Uncertain Graphs. In: Proceedings of the IEEE 34th international conference on data engineering (ICDE), pp 1192\u20131203. https:\/\/doi.org\/10.1109\/ICDE.2018.00110","DOI":"10.1109\/ICDE.2018.00110"},{"issue":"6","key":"958_CR44","doi-asserted-by":"publisher","first-page":"1312","DOI":"10.1109\/TPAMI.2012.226","volume":"35","author":"S Rota Bul\u00f2","year":"2013","unstructured":"Rota Bul\u00f2 S, Pelillo M (2013) A game-theoretic approach to hypergraph clustering. IEEE Trans Pattern Anal Mach Intell 35(6):1312\u20131327. https:\/\/doi.org\/10.1109\/TPAMI.2012.226","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"issue":"3","key":"958_CR45","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1016\/0378-8733(83)90028-X","volume":"5","author":"SB Seidman","year":"1983","unstructured":"Seidman SB (1983) Network structure and minimum degree. Soc Netw 5(3):269\u2013287. https:\/\/doi.org\/10.1016\/0378-8733(83)90028-X","journal-title":"Soc Netw"},{"key":"958_CR46","doi-asserted-by":"publisher","unstructured":"Shin K, Eliassi-Rad T, Faloutsos C (2016) Corescope: Graph Mining Using k-Core Analysis-Patterns, Anomalies and Algorithms. In: Proceedings of the IEEE 16th international conference on data mining (ICDM), pp 469\u2013478. https:\/\/doi.org\/10.1109\/ICDM.2016.0058","DOI":"10.1109\/ICDM.2016.0058"},{"key":"958_CR47","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 web conference 2015 (WWW), pp 243\u2013246. https:\/\/doi.org\/10.1145\/2740908.2742839","DOI":"10.1145\/2740908.2742839"},{"issue":"4","key":"958_CR48","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3385416","volume":"14","author":"B Sun","year":"2020","unstructured":"Sun B, Chan THH, Sozio M (2020) Fully dynamic approximate k-core decomposition in hypergraphs. ACM Trans Knowl Discov Data 14(4):1\u201321. https:\/\/doi.org\/10.1145\/3385416","journal-title":"ACM Trans Knowl Discov Data"},{"key":"958_CR49","doi-asserted-by":"publisher","unstructured":"Tan S, Guan Z, Cai D, et\u00a0al (2014) Mapping users across networks by manifold alignment on hypergraph. In: Proceedings of the 28th AAAI conference on artificial intelligence (AAAI), pp 159\u2013165. https:\/\/doi.org\/10.1609\/aaai.v28i1.8720","DOI":"10.1609\/aaai.v28i1.8720"},{"issue":"1","key":"958_CR50","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1145\/21465.21474","volume":"13","author":"JS Vitter","year":"1987","unstructured":"Vitter JS (1987) An efficient algorithm for sequential random sampling. ACM Trans Math Softw 13(1):58\u201367. https:\/\/doi.org\/10.1145\/21465.21474","journal-title":"ACM Trans Math Softw"},{"key":"958_CR51","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: Proceedings of the 33rd international conference on neural information processing systems (NeurIPS), pp 1511\u20131522. https:\/\/doi.org\/10.48550\/arXiv.1809.02589","DOI":"10.48550\/arXiv.1809.02589"},{"key":"958_CR52","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 and knowledge management (CIKM), pp 1705\u20131714. https:\/\/doi.org\/10.1145\/3340531.3411870","DOI":"10.1145\/3340531.3411870"},{"key":"958_CR53","doi-asserted-by":"publisher","unstructured":"Yang D, Qu B, Yang J, et\u00a0al (2019) Revisiting user mobility and social relationships in LBSNs: a hypergraph embedding approach. In: Proceedings of the web conference 2019 (WWW), pp 2147\u20132157. https:\/\/doi.org\/10.1145\/3308558.3313635","DOI":"10.1145\/3308558.3313635"},{"key":"958_CR54","doi-asserted-by":"publisher","unstructured":"Yin H, Benson AR, Leskovec J, et\u00a0al (2017) Local higher-order graph clustering. In: Proceedings of the 23rd ACM SIGKDD international conference on knowledge discovery and data mining (KDD), pp 555\u2013564. https:\/\/doi.org\/10.1145\/3097983.3098069","DOI":"10.1145\/3097983.3098069"},{"key":"958_CR55","doi-asserted-by":"publisher","unstructured":"Zhang F, Zhang Y, Qin L, et\u00a0al (2017) Finding critical users for social network engagement: the collapsed k-core problem. In: Proceedings of the 31st AAAI conference on artificial intelligence (AAAI), pp 245\u2013251. https:\/\/doi.org\/10.1609\/aaai.v31i1.10482","DOI":"10.1609\/aaai.v31i1.10482"},{"key":"958_CR56","doi-asserted-by":"publisher","unstructured":"Zhou Z, Zhang F, Lin X, et\u00a0al (2019) K-core maximization: an edge addition approach. In: Proceedings of the 28th international joint conference on artificial intelligence (IJCAI), pp 4867\u20134873. https:\/\/doi.org\/10.24963\/ijcai.2019\/676","DOI":"10.24963\/ijcai.2019\/676"},{"key":"958_CR57","doi-asserted-by":"publisher","unstructured":"Zhu W, Chen C, Wang X, et\u00a0al (2018) K-Core Minimization: An Edge Manipulation Approach. In: Proceedings of the 27th ACM international conference on information and knowledge management (CIKM), pp 1667\u20131670. https:\/\/doi.org\/10.1145\/3269206.3269254","DOI":"10.1145\/3269206.3269254"},{"key":"958_CR58","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1016\/j.neucom.2016.07.030","volume":"216","author":"Y Zhu","year":"2016","unstructured":"Zhu Y, Guan Z, Tan S et al (2016) Heterogeneous hypergraph embedding for document recommendation. Neurocomputing 216:150\u2013162. https:\/\/doi.org\/10.1016\/j.neucom.2016.07.030","journal-title":"Neurocomputing"}],"container-title":["Data Mining and Knowledge Discovery"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-023-00958-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10618-023-00958-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-023-00958-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,13]],"date-time":"2023-10-13T09:23:41Z","timestamp":1697189021000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10618-023-00958-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,8,9]]},"references-count":58,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2023,11]]}},"alternative-id":["958"],"URL":"https:\/\/doi.org\/10.1007\/s10618-023-00958-0","relation":{},"ISSN":["1384-5810","1573-756X"],"issn-type":[{"value":"1384-5810","type":"print"},{"value":"1573-756X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,8,9]]},"assertion":[{"value":"10 February 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 July 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 August 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"}}]}}