{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T15:59:45Z","timestamp":1772207985755,"version":"3.50.1"},"reference-count":60,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2024,2,28]],"date-time":"2024-02-28T00:00:00Z","timestamp":1709078400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,2,28]],"date-time":"2024-02-28T00:00:00Z","timestamp":1709078400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Data Sci. Eng."],"published-print":{"date-parts":[[2024,6]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Community search (CS) is a vital research area in network science that focuses on discovering personalized communities for query vertices from graphs. However, existing CS methods mainly concentrate on homogeneous or simple attributed graphs, often disregarding complex semantic information and rich contents carried by entities in heterogeneous graphs (HGs). In this paper, we propose a novel problem, namely the \u201cSemantic Network Oriented Community Search with Meta-Structures in Heterogeneous Graphs (SNCS),\u201d which aims to find dense communities that contain the query vertex, with vertices of the same type sharing similar topics. In response to this new problem, we present a novel approach, also named SNCS, representing the first solution employing meta-structures and topic constraints to tackle community search, leveraging both topological and latent features. To overcome the high-time complexity challenge posed by searching through meta-structures, we introduce a unique graph reconstruction technique. Our proposed method\u2019s superiority is validated through extensive evaluations on real-world datasets. The results demonstrate a significant improvement in the quality of the obtained communities, with increases of 3.5\u20134.4% in clustering coefficient and 5\u201311% in density while requiring only 4\u201346% of the running time when compared with the state-of-the-art methods.<\/jats:p>","DOI":"10.1007\/s41019-024-00244-z","type":"journal-article","created":{"date-parts":[[2024,2,28]],"date-time":"2024-02-28T08:02:17Z","timestamp":1709107337000},"page":"220-237","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Leveraging Semantic Information for Enhanced Community Search in Heterogeneous Graphs"],"prefix":"10.1007","volume":"9","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8993-8190","authenticated-orcid":false,"given":"Yuqi","family":"Li","sequence":"first","affiliation":[]},{"given":"Guosheng","family":"Zang","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5715-5092","authenticated-orcid":false,"given":"Chunyao","family":"Song","sequence":"additional","affiliation":[]},{"given":"Xiaojie","family":"Yuan","sequence":"additional","affiliation":[]},{"given":"Tingjian","family":"Ge","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,2,28]]},"reference":[{"issue":"2","key":"244_CR1","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1007\/S41019-023-00207-W","volume":"8","author":"L Li","year":"2023","unstructured":"Li L, Duan L, Wang J, He C, Chen Z, Xie G, Deng S, Luo Z (2023) Memory-enhanced transformer for representation learning on temporal heterogeneous graphs. Data Sci Eng 8(2):98\u2013111. https:\/\/doi.org\/10.1007\/S41019-023-00207-W","journal-title":"Data Sci Eng"},{"issue":"1","key":"244_CR2","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/S41019-021-00174-0","volume":"7","author":"S Tuteja","year":"2022","unstructured":"Tuteja S, Kumar R (2022) A unification of heterogeneous data sources into a graph model in e-commerce. Data Sci Eng 7(1):57\u201370. https:\/\/doi.org\/10.1007\/S41019-021-00174-0","journal-title":"Data Sci Eng"},{"key":"244_CR3","doi-asserted-by":"crossref","unstructured":"Ni J, Li J, McAuley J (2019) Justifying recommendations using distantly-labeled reviews and fine-grained aspects. In: Proceedings of the 2019 conference on empirical methods in natural language processing and the 9th international joint conference on natural language processing (EMNLP-IJCNLP), pp 188\u2013197","DOI":"10.18653\/v1\/D19-1018"},{"key":"244_CR4","doi-asserted-by":"crossref","unstructured":"Cui W, Xiao Y, Wang H, Lu Y, Wang W (2013) Online search of overlapping communities. In: Proceedings of the 2013 ACM SIGMOD international conference on management of data, pp 277\u2013288","DOI":"10.1145\/2463676.2463722"},{"key":"244_CR5","doi-asserted-by":"crossref","unstructured":"Cui W, Xiao Y, Wang H, Wang W (2014) Local search of communities in large graphs. In: Proceedings of the 2014 ACM SIGMOD international conference on management of data, pp 991\u20131002","DOI":"10.1145\/2588555.2612179"},{"issue":"4","key":"244_CR6","doi-asserted-by":"publisher","first-page":"783","DOI":"10.1109\/TKDE.2018.2845414","volume":"31","author":"Y Fang","year":"2018","unstructured":"Fang Y, Wang Z, Cheng R, Li X, Luo S, Hu J, Chen X (2018) On spatial-aware community search. IEEE Trans Knowl Data Eng 31(4):783\u2013798","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"10","key":"244_CR7","doi-asserted-by":"publisher","first-page":"913","DOI":"10.14778\/2536206.2536218","volume":"6","author":"N Armenatzoglou","year":"2013","unstructured":"Armenatzoglou N, Papadopoulos S, Papadias D (2013) A general framework for geo-social query processing. Proc VLDB Endow 6(10):913\u2013924. https:\/\/doi.org\/10.14778\/2536206.2536218","journal-title":"Proc VLDB Endow"},{"key":"244_CR8","doi-asserted-by":"crossref","unstructured":"Li R-H, Qin L, Ye F, Yu JX, Xiao X, Xiao N, Zheng Z (2018) Skyline community search in multi-valued networks. In: Proceedings of the 2018 international conference on management of data, pp 457\u2013472","DOI":"10.1145\/3183713.3183736"},{"issue":"12","key":"244_CR9","doi-asserted-by":"publisher","first-page":"1233","DOI":"10.14778\/2994509.2994538","volume":"9","author":"Y Fang","year":"2016","unstructured":"Fang Y, Cheng R, Luo S, Hu J (2016) Effective community search for large attributed graphs. Proc VLDB Endow 9(12):1233\u20131244","journal-title":"Proc VLDB Endow"},{"issue":"9","key":"244_CR10","doi-asserted-by":"publisher","first-page":"949","DOI":"10.14778\/3099622.3099626","volume":"10","author":"X Huang","year":"2017","unstructured":"Huang X, Lakshmanan LV (2017) Attribute-driven community search. Proc VLDB Endow 10(9):949\u2013960","journal-title":"Proc VLDB Endow"},{"issue":"6","key":"244_CR11","doi-asserted-by":"publisher","first-page":"854","DOI":"10.14778\/3380750.3380756","volume":"13","author":"Y Fang","year":"2020","unstructured":"Fang Y, Yang Y, Zhang W, Lin X, Cao X (2020) Effective and efficient community search over large heterogeneous information networks. Proc VLDB Endow 13(6):854\u2013867","journal-title":"Proc VLDB Endow"},{"key":"244_CR12","doi-asserted-by":"crossref","unstructured":"Yang Y, Fang Y, Lin X, Zhang W (2020) Effective and efficient truss computation over large heterogeneous information networks. In: 2020 IEEE 36th international conference on data engineering (ICDE), pp 901\u2013912. IEEE","DOI":"10.1109\/ICDE48307.2020.00083"},{"key":"244_CR13","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1007\/978-3-030-73194-6_12","volume-title":"Database systems for advanced applications","author":"L Qiao","year":"2021","unstructured":"Qiao L, Zhang Z, Yuan Y, Chen C, Wang G (2021) Keyword-centric community search over large heterogeneous information networks. In: Jensen CS, Lim E-P, Yang D-N, Lee W-C, Tseng VS, Kalogeraki V, Huang J-W, Shen C-Y (eds) Database systems for advanced applications. Springer, Cham, pp 158\u2013173"},{"issue":"4","key":"244_CR14","doi-asserted-by":"publisher","first-page":"164345","DOI":"10.1007\/s11704-022-1329-9","volume":"16","author":"F Yang","year":"2022","unstructured":"Yang F, Ma H, Gao W, Li Z (2022) Community search over heterogeneous information networks via weighting strategy and query replacement. Front Comput Sci 16(4):164345. https:\/\/doi.org\/10.1007\/s11704-022-1329-9","journal-title":"Front Comput Sci"},{"key":"244_CR15","doi-asserted-by":"crossref","unstructured":"Huang Z, Zheng Y, Cheng R, Sun Y, Mamoulis N, Li X (2016) Meta structure: Computing relevance in large heterogeneous information networks. In: Proceedings of the 22nd ACM SIGKDD international conference on knowledge discovery and data mining, pp 1595\u20131604","DOI":"10.1145\/2939672.2939815"},{"key":"244_CR16","doi-asserted-by":"crossref","unstructured":"Terragni S, Fersini E, Galuzzi BG, Tropeano P, Candelieri A (2021) OCTIS: comparing and optimizing topic models is simple! In: Proceedings of the 16th conference of the European chapter of the association for computational linguistics: system demonstrations, pp 263\u2013270","DOI":"10.18653\/v1\/2021.eacl-demos.31"},{"key":"244_CR17","doi-asserted-by":"crossref","unstructured":"Sozio M, Gionis A (2010) The community-search problem and how to plan a successful cocktail party. In: Proceedings of the 16th ACM SIGKDD international conference on knowledge discovery and data mining, pp 939\u2013948","DOI":"10.1145\/1835804.1835923"},{"issue":"1","key":"244_CR18","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/s00778-019-00556-x","volume":"29","author":"Y Fang","year":"2020","unstructured":"Fang Y, Huang X, Qin L, Zhang Y, Zhang W, Cheng R, Lin X (2020) A survey of community search over big graphs. VLDB J 29(1):353\u2013392","journal-title":"VLDB J"},{"issue":"1","key":"244_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10618-020-00716-6","volume":"35","author":"X Huang","year":"2021","unstructured":"Huang X, Chen D, Ren T, Wang D (2021) A survey of community detection methods in multilayer networks. Data Min Knowl Disc 35(1):1\u201345","journal-title":"Data Min Knowl Disc"},{"issue":"2","key":"244_CR20","doi-asserted-by":"publisher","first-page":"1149","DOI":"10.1109\/TKDE.2021.3104155","volume":"35","author":"D Jin","year":"2023","unstructured":"Jin D, Yu Z, Jiao P, Pan S, He D, Wu J, Yu PS, Zhang W (2023) A survey of community detection approaches: from statistical modeling to deep learning. IEEE Trans Knowl Data Eng 35(2):1149\u20131170. https:\/\/doi.org\/10.1109\/TKDE.2021.3104155","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"244_CR21","doi-asserted-by":"crossref","unstructured":"Sun Y, Tang J, Han J, Gupta M, Zhao B (2010) Community evolution detection in dynamic heterogeneous information networks. In: Proceedings of the eighth workshop on mining and learning with graphs, pp 137\u2013146","DOI":"10.1145\/1830252.1830270"},{"key":"244_CR22","doi-asserted-by":"crossref","unstructured":"Basu S, Shekhar S, Kumar N, Mukherjee S, Pan I (2017) A particle swarm modelforstatic community detection based on homogeneous features. In: 2017 2nd IEEE international conference on recent trends in electronics, information communication technology (RTEICT). IEEE, pp 1507\u20131510","DOI":"10.1109\/RTEICT.2017.8256849"},{"key":"244_CR23","doi-asserted-by":"publisher","first-page":"652","DOI":"10.1016\/j.ins.2022.10.126","volume":"621","author":"Y Wu","year":"2023","unstructured":"Wu Y, Fu Y, Xu J, Yin H, Zhou Q, Liu D (2023) Heterogeneous question answering community detection based on graph neural network. Inf Sci 621:652\u2013671. https:\/\/doi.org\/10.1016\/j.ins.2022.10.126","journal-title":"Inf Sci"},{"issue":"3","key":"244_CR24","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/S41019-021-00160-6","volume":"6","author":"J Liu","year":"2021","unstructured":"Liu J, Shao Y, Su S (2021) Multiple local community detection via high-quality seed identification over both static and dynamic networks. Data Sci Eng 6(3):249\u2013264. https:\/\/doi.org\/10.1007\/S41019-021-00160-6","journal-title":"Data Sci Eng"},{"key":"244_CR25","doi-asserted-by":"publisher","first-page":"107112","DOI":"10.1016\/j.knosys.2021.107112","volume":"224","author":"V Moscato","year":"2021","unstructured":"Moscato V, Sperl\u00ec G (2021) A survey about community detection over on-line social and heterogeneous information networks. Knowl Based Syst 224:107112. https:\/\/doi.org\/10.1016\/j.knosys.2021.107112","journal-title":"Knowl Based Syst"},{"key":"244_CR26","doi-asserted-by":"publisher","unstructured":"Luo L, Fang Y, Cao X, Zhang X, Zhang W (2021) Detecting communities from heterogeneous graphs: a context path-based graph neural network model. In: Proceedings of the 30th ACM international conference on information & knowledge management. CIKM \u201921. Association for Computing Machinery, New York, NY, USA, pp 1170\u20131180. https:\/\/doi.org\/10.1145\/3459637.3482250","DOI":"10.1145\/3459637.3482250"},{"issue":"2","key":"244_CR27","doi-asserted-by":"publisher","first-page":"2173","DOI":"10.1109\/TKDE.2021.3096122","volume":"35","author":"Y Zheng","year":"2023","unstructured":"Zheng Y, Zhang X, Chen S, Zhang X, Yang X, Wang D (2023) When convolutional network meets temporal heterogeneous graphs: an effective community detection method. IEEE Trans Knowl Data Eng 35(2):2173\u20132178. https:\/\/doi.org\/10.1109\/TKDE.2021.3096122","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"2","key":"244_CR28","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1002\/j.1538-7305.1970.tb01770.x","volume":"49","author":"BW Kernighan","year":"1970","unstructured":"Kernighan BW, Lin S (1970) An efficient heuristic procedure for partitioning graphs. Bell Syst Tech J 49(2):291\u2013307","journal-title":"Bell Syst Tech J"},{"issue":"2","key":"244_CR29","doi-asserted-by":"publisher","first-page":"026113","DOI":"10.1103\/PhysRevE.69.026113","volume":"69","author":"ME Newman","year":"2004","unstructured":"Newman ME, Girvan M (2004) Finding and evaluating community structure in networks. Phys Rev E 69(2):026113","journal-title":"Phys Rev E"},{"issue":"3","key":"244_CR30","doi-asserted-by":"publisher","first-page":"036106","DOI":"10.1103\/PhysRevE.76.036106","volume":"76","author":"UN Raghavan","year":"2007","unstructured":"Raghavan UN, Albert R, Kumara S (2007) Near linear time algorithm to detect community structures in large-scale networks. Phys Rev E 76(3):036106","journal-title":"Phys Rev E"},{"key":"244_CR31","doi-asserted-by":"crossref","unstructured":"Yue Y, Wang G, Hu J, Li Y (2023) An improved label propagation algorithm based on community core node and label importance for community detection in sparse network. Appl Intell 1\u201317","DOI":"10.1007\/s10489-022-04397-0"},{"issue":"11","key":"244_CR32","doi-asserted-by":"publisher","first-page":"2104","DOI":"10.14778\/3407790.3407812","volume":"13","author":"A Al-Baghdadi","year":"2020","unstructured":"Al-Baghdadi A, Lian X (2020) Topic-based community search over spatial-social networks. Proc VLDB Endow 13(11):2104\u20132117","journal-title":"Proc VLDB Endow"},{"key":"244_CR33","doi-asserted-by":"publisher","first-page":"110077","DOI":"10.1016\/j.knosys.2022.110077","volume":"259","author":"H Liu","year":"2023","unstructured":"Liu H, Ma H, Li Z, Chang L (2023) Adaptive target community search with sample expansion. Knowl Based Syst 259:110077. https:\/\/doi.org\/10.1016\/j.knosys.2022.110077","journal-title":"Knowl Based Syst"},{"issue":"3","key":"244_CR34","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1007\/S41019-021-00163-3","volume":"6","author":"Y Wu","year":"2021","unstructured":"Wu Y, Zhao J, Sun R, Chen C, Wang X (2021) Efficient personalized influential community search in large networks. Data Sci Eng 6(3):310\u2013322. https:\/\/doi.org\/10.1007\/S41019-021-00163-3","journal-title":"Data Sci Eng"},{"key":"244_CR35","doi-asserted-by":"publisher","unstructured":"Huang X, Cheng H, Qin L, Tian W, Yu JX (2014) Querying k-truss community in large and dynamic graphs. In: Proceedings of the 2014 ACM SIGMOD international conference on management of data. SIGMOD \u201914. Association for Computing Machinery, New York, NY, USA, pp 1311\u20131322. https:\/\/doi.org\/10.1145\/2588555.2610495","DOI":"10.1145\/2588555.2610495"},{"issue":"6","key":"244_CR36","doi-asserted-by":"publisher","first-page":"709","DOI":"10.14778\/3055330.3055337","volume":"10","author":"Y Fang","year":"2017","unstructured":"Fang Y, Cheng R, Li X, Luo S, Hu J (2017) Effective community search over large spatial graphs. Proc VLDB Endow 10(6):709\u2013720","journal-title":"Proc VLDB Endow"},{"issue":"2","key":"244_CR37","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/BF02289146","volume":"14","author":"RD Luce","year":"1949","unstructured":"Luce RD, Perry AD (1949) A method of matrix analysis of group structure. Psychometrika 14(2):95\u2013116","journal-title":"Psychometrika"},{"key":"244_CR38","unstructured":"Cohen J (2008) Trusses: Cohesive subgraphs for social network analysis. National security agency technical report 16(3.1)"},{"key":"244_CR39","doi-asserted-by":"publisher","first-page":"101914","DOI":"10.1016\/j.is.2021.101914","volume":"104","author":"MS Islam","year":"2022","unstructured":"Islam MS, Ali ME, Kang Y, Sellis T, Choudhury FM, Roy S (2022) Keyword aware influential community search in large attributed graphs. Inf Syst 104:101914. https:\/\/doi.org\/10.1016\/j.is.2021.101914","journal-title":"Inf Syst"},{"issue":"8","key":"244_CR40","doi-asserted-by":"publisher","first-page":"2047","DOI":"10.14778\/3594512.3594532","volume":"16","author":"Y Zhou","year":"2023","unstructured":"Zhou Y, Fang Y, Luo W, Ye Y (2023) Influential community search over large heterogeneous information networks. Proc VLDB Endow 16(8):2047\u20132060","journal-title":"Proc VLDB Endow"},{"key":"244_CR41","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/978-3-031-32910-4_7","volume-title":"Spatial data and intelligence","author":"Y Zhou","year":"2023","unstructured":"Zhou Y, Zhou L, Wang J, Wang L, Kong B (2023) Spatial-aware community search over heterogeneous information networks. In: Meng X, Li X, Xu J, Zhang X, Fang Y, Zheng B, Li Y (eds) Spatial data and intelligence. Springer, Cham, pp 103\u2013114"},{"issue":"3","key":"244_CR42","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1007\/s10115-013-0646-6","volume":"37","author":"N Barbieri","year":"2013","unstructured":"Barbieri N, Bonchi F, Manco G (2013) Topic-aware social influence propagation models. Knowl Inf Syst 37(3):555\u2013584","journal-title":"Knowl Inf Syst"},{"issue":"2","key":"244_CR43","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1006\/jcss.2000.1711","volume":"61","author":"CH Papadimitriou","year":"2000","unstructured":"Papadimitriou CH, Raghavan P, Tamaki H, Vempala S (2000) Latent semantic indexing: a probabilistic analysis. J Comput Syst Sci 61(2):217\u2013235","journal-title":"J Comput Syst Sci"},{"issue":"9","key":"244_CR44","doi-asserted-by":"publisher","first-page":"2421","DOI":"10.1162\/NECO_a_00168","volume":"23","author":"C F\u00e9votte","year":"2011","unstructured":"F\u00e9votte C, Idier J (2011) Algorithms for nonnegative matrix factorization with the $$\\beta$$-divergence. Neural Comput 23(9):2421\u20132456","journal-title":"Neural Comput"},{"key":"244_CR45","first-page":"993","volume":"3","author":"DM Blei","year":"2003","unstructured":"Blei DM, Ng AY, Jordan MI (2003) Latent Dirichlet allocation. J Mach Learn Res 3:993\u20131022","journal-title":"J Mach Learn Res"},{"key":"244_CR46","unstructured":"Srivastava A, Sutton C (2017) Autoencoding variational inference for topic models. arXiv preprint arXiv:1703.01488"},{"key":"244_CR47","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1162\/tacl_a_00325","volume":"8","author":"AB Dieng","year":"2020","unstructured":"Dieng AB, Ruiz FJ, Blei DM (2020) Topic modeling in embedding spaces. Trans Assoc Comput Linguist 8:439\u2013453","journal-title":"Trans Assoc Comput Linguist"},{"issue":"11","key":"244_CR48","doi-asserted-by":"publisher","first-page":"992","DOI":"10.14778\/3402707.3402736","volume":"4","author":"Y Sun","year":"2011","unstructured":"Sun Y, Han J, Yan X, Yu PS, Wu T (2011) PathSim: meta path-based top-k similarity search in heterogeneous information networks. Proc VLDB Endow 4(11):992\u20131003","journal-title":"Proc VLDB Endow"},{"key":"244_CR49","doi-asserted-by":"crossref","unstructured":"Liu X, Yu Y, Guo C, Sun Y (2014) Meta-path-based ranking with pseudo relevance feedback on heterogeneous graph for citation recommendation. In: Proceedings of the 23rd ACM international conference on conference on information and knowledge management, pp. 121\u2013130","DOI":"10.1145\/2661829.2661965"},{"key":"244_CR50","doi-asserted-by":"publisher","unstructured":"Zheng Y, Shi C, Cao X, Li X, Wu B (2017) Entity set expansion with meta path in knowledge graph. In: Kim J, Shim K, Cao L, Lee J, Lin X, Moon Y (eds) Advances in knowledge discovery and data mining\u201421st Pacific-Asia conference, PAKDD 2017, Jeju, South Korea, May 23-26, 2017, Proceedings, Part I. Lecture notes in computer science, vol 10234, pp 317\u2013329. https:\/\/doi.org\/10.1007\/978-3-319-57454-7_25","DOI":"10.1007\/978-3-319-57454-7_25"},{"issue":"1","key":"244_CR51","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/s10994-010-5205-8","volume":"81","author":"N Lao","year":"2010","unstructured":"Lao N, Cohen WW (2010) Relational retrieval using a combination of path-constrained random walks. Mach Learn 81(1):53\u201367","journal-title":"Mach Learn"},{"key":"244_CR52","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1016\/j.physa.2017.04.126","volume":"482","author":"J Li","year":"2017","unstructured":"Li J, Ge B, Yang K, Chen Y, Tan Y (2017) Meta-path based heterogeneous combat network link prediction. Physica A 482:507\u2013523","journal-title":"Physica A"},{"key":"244_CR53","doi-asserted-by":"crossref","unstructured":"Ji H, Shi C, Wang B (2018) Attention based meta path fusion for heterogeneous information network embedding. In: Pacific rim international conference on artificial intelligence, pp 348\u2013360. Springer, Berlin","DOI":"10.1007\/978-3-319-97304-3_27"},{"key":"244_CR54","doi-asserted-by":"crossref","unstructured":"Kabir H, Madduri K (2017) Parallel k-core decomposition on multicore platforms. In: 2017 IEEE international parallel and distributed processing symposium workshops (IPDPSW). IEEE, pp 1482\u20131491","DOI":"10.1109\/IPDPSW.2017.151"},{"key":"244_CR55","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.physrep.2019.10.004","volume":"832","author":"Y-X Kong","year":"2019","unstructured":"Kong Y-X, Shi G-Y, Wu R-J, Zhang Y-C (2019) K-core: theories and applications. Phys Rep 832:1\u201332","journal-title":"Phys Rep"},{"issue":"2","key":"244_CR56","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/0095-8956(77)90031-4","volume":"23","author":"PD Seymour","year":"1977","unstructured":"Seymour PD (1977) The matroids with the max-flow min-cut property. J Combin Theory Ser B 23(2):189\u2013222. https:\/\/doi.org\/10.1016\/0095-8956(77)90031-4","journal-title":"J Combin Theory Ser B"},{"key":"244_CR57","doi-asserted-by":"crossref","unstructured":"Tang J, Zhang J, Yao L, Li J, Zhang L, Su Z (2008) Arnetminer: extraction and mining of academic social networks. In: Proceedings of the 14th ACM SIGKDD international conference on knowledge discovery and data mining, pp 990\u2013998","DOI":"10.1145\/1401890.1402008"},{"issue":"4","key":"244_CR58","doi-asserted-by":"publisher","first-page":"276","DOI":"10.14778\/2856318.2856323","volume":"9","author":"X Huang","year":"2015","unstructured":"Huang X, Lakshmanan LVS, Yu JX, Cheng H (2015) Approximate closest community search in networks. Proc VLDB Endow 9(4):276\u2013287. https:\/\/doi.org\/10.14778\/2856318.2856323","journal-title":"Proc VLDB Endow"},{"issue":"7","key":"244_CR59","doi-asserted-by":"publisher","first-page":"798","DOI":"10.14778\/2752939.2752948","volume":"8","author":"Y Wu","year":"2015","unstructured":"Wu Y, Jin R, Li J, Zhang X (2015) Robust local community detection: on free rider effect and its elimination. Proc VLDB Endow 8(7):798\u2013809","journal-title":"Proc VLDB Endow"},{"issue":"2","key":"244_CR60","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1177\/104649647100200201","volume":"2","author":"PW Holland","year":"1971","unstructured":"Holland PW, Leinhardt S (1971) Transitivity in structural models of small groups. Comp Group Stud 2(2):107\u2013124","journal-title":"Comp Group Stud"}],"container-title":["Data Science and Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41019-024-00244-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s41019-024-00244-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41019-024-00244-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,11]],"date-time":"2024-06-11T17:19:16Z","timestamp":1718126356000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s41019-024-00244-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,2,28]]},"references-count":60,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2024,6]]}},"alternative-id":["244"],"URL":"https:\/\/doi.org\/10.1007\/s41019-024-00244-z","relation":{},"ISSN":["2364-1185","2364-1541"],"issn-type":[{"value":"2364-1185","type":"print"},{"value":"2364-1541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,2,28]]},"assertion":[{"value":"17 October 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 December 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 January 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 February 2024","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}