{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T11:37:28Z","timestamp":1760441848174,"version":"3.28.0"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2024,10,12]],"date-time":"2024-10-12T00:00:00Z","timestamp":1728691200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,10,12]],"date-time":"2024-10-12T00:00:00Z","timestamp":1728691200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Memetic Comp."],"published-print":{"date-parts":[[2024,12]]},"DOI":"10.1007\/s12293-024-00430-6","type":"journal-article","created":{"date-parts":[[2024,10,12]],"date-time":"2024-10-12T07:01:54Z","timestamp":1728716514000},"page":"537-547","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Quantifying inter-vertices correlation strength and its universal enhancement role in representation learning"],"prefix":"10.1007","volume":"16","author":[{"given":"Lihua","family":"Liu","sequence":"first","affiliation":[]},{"given":"Kaiming","family":"Xiao","sequence":"additional","affiliation":[]},{"given":"Jibing","family":"Wu","sequence":"additional","affiliation":[]},{"given":"Ningchao","family":"Ge","sequence":"additional","affiliation":[]},{"given":"Xuan","family":"Li","sequence":"additional","affiliation":[]},{"given":"Hongbin","family":"Huang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,10,12]]},"reference":[{"key":"430_CR1","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1016\/J.KNOSYS.2018.03.022","volume":"151","author":"P Goyal","year":"2018","unstructured":"Goyal P, Ferrara E (2018) Graph embedding techniques, applications, and performance: a survey. Knowl Based Syst 151:78\u201394. https:\/\/doi.org\/10.1016\/J.KNOSYS.2018.03.022","journal-title":"Knowl Based Syst"},{"key":"430_CR2","doi-asserted-by":"publisher","unstructured":"Perozzi B, Al-Rfou R, Skiena S (2014) Deepwalk: online learning of social representations. In: The 20th ACM SIGKDD international conference on knowledge discovery and data mining, KDD \u201914, New York, NY, USA-August 24\u201327 2014, pp 701\u2013710. https:\/\/doi.org\/10.1145\/2623330.2623732","DOI":"10.1145\/2623330.2623732"},{"issue":"1","key":"430_CR3","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1007\/S41019-023-00206-X","volume":"8","author":"Z Lu","year":"2023","unstructured":"Lu Z, Yu Q, Li X, Li X, Yang Q (2023) Learning weight signed network embedding with graph neural networks. Data Sci Eng 8(1):36\u201346. https:\/\/doi.org\/10.1007\/S41019-023-00206-X","journal-title":"Data Sci Eng"},{"issue":"2","key":"430_CR4","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1007\/S41019-022-00184-6","volume":"7","author":"J Luo","year":"2022","unstructured":"Luo J, Xiao S, Jiang S, Gao H, Xiao Y (2022) ripple2vec: node embedding with ripple distance of structures. Data Sci Eng 7(2):156\u2013174. https:\/\/doi.org\/10.1007\/S41019-022-00184-6","journal-title":"Data Sci Eng"},{"issue":"3","key":"430_CR5","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/S41019-022-00190-8","volume":"7","author":"M Chen","year":"2022","unstructured":"Chen M, Lin J, Li X, Liu B, Wang C, Huang D, Lai J (2022) Representation learning in multi-view clustering: a literature review. Data Sci Eng 7(3):225\u2013241. https:\/\/doi.org\/10.1007\/S41019-022-00190-8","journal-title":"Data Sci Eng"},{"issue":"2","key":"430_CR6","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1109\/TBDATA.2022.3177455","volume":"9","author":"X Wang","year":"2023","unstructured":"Wang X, Bo D, Shi C, Fan S, Ye Y, Yu PS (2023) A survey on heterogeneous graph embedding: methods, techniques, applications and sources. IEEE Trans Big Data 9(2):415\u2013436. https:\/\/doi.org\/10.1109\/TBDATA.2022.3177455","journal-title":"IEEE Trans Big Data"},{"key":"430_CR7","doi-asserted-by":"publisher","unstructured":"Ahmed A, Shervashidze N, Narayanamurthy SM, Josifovski V, Smola AJ (2013) Distributed large-scale natural graph factorization. In: 22nd international world wide web conference, WWW 2013, Rio de Janeiro, Brazil, May 13\u201317 2013, pp 37\u201348. https:\/\/doi.org\/10.1145\/2488388.2488393","DOI":"10.1145\/2488388.2488393"},{"issue":"5500","key":"430_CR8","doi-asserted-by":"publisher","first-page":"2323","DOI":"10.1126\/science.290.5500.2323","volume":"290","author":"ST Roweis","year":"2000","unstructured":"Roweis ST, Saul LK (2000) Nonlinear dimensionality reduction by locally linear embedding. Science 290(5500):2323\u20132326","journal-title":"Science"},{"key":"430_CR9","first-page":"119","volume":"4","author":"LK Saul","year":"2003","unstructured":"Saul LK, Roweis ST (2003) Think globally, fit locally: unsupervised learning of low dimensional manifold. J Mach Learn Res 4:119\u2013155","journal-title":"J Mach Learn Res"},{"key":"430_CR10","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, San Francisco, CA, USA, August 13\u201317 2016, pp 855\u2013864. https:\/\/doi.org\/10.1145\/2939672.2939754","DOI":"10.1145\/2939672.2939754"},{"key":"430_CR11","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, WWW 2015, Florence, Italy, May 18\u201322 2015, pp 1067\u20131077. https:\/\/doi.org\/10.1145\/2736277.2741093","DOI":"10.1145\/2736277.2741093"},{"key":"430_CR12","unstructured":"Mikolov T, Chen K, Corrado G, Dean J (2013) Efficient estimation of word representations in vector space. In: Bengio Y, LeCun Y (eds) 1st international conference on learning representations, ICLR 2013, Scottsdale, Arizona, USA, May 2\u20134 2013, workshop track proceedings. arXiv:1301.3781"},{"key":"430_CR13","unstructured":"Kipf TN, Welling M (2017) Semi-supervised classification with graph convolutional networks. In: 5th international conference on learning representations, ICLR 2017, Toulon, France, April 24\u201326 2017, conference track proceedings. https:\/\/openreview.net\/forum?id=SJU4ayYgl"},{"issue":"4","key":"430_CR14","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1007\/S41019-020-00135-Z","volume":"5","author":"S Wu","year":"2020","unstructured":"Wu S, Zhang Y, Gao C, Bian K, Cui B (2020) GARG: anonymous recommendation of point-of-interest in mobile networks by graph convolution network. Data Sci Eng 5(4):433\u2013447. https:\/\/doi.org\/10.1007\/S41019-020-00135-Z","journal-title":"Data Sci Eng"},{"key":"430_CR15","unstructured":"Hamilton WL, Ying Z, Leskovec J (2017) Inductive representation learning on large graphs. In: Guyon I, Luxburg U, Bengio S, Wallach HM, Fergus R, Vishwanathan SVN, Garnett R (eds) Advances in neural information processing systems 30: annual conference on neural information processing systems 2017, December 4\u20139 2017, Long Beach, CA, USA, pp 1024\u20131034. https:\/\/proceedings.neurips.cc\/paper\/2017\/hash\/5dd9db5e033da9c6fb5ba83c7a7ebea9-Abstract.html"},{"key":"430_CR16","unstructured":"Velickovic P, Cucurull G, Casanova A, Romero A, Li\u00f2 P, Bengio Y (2017) Graph attention networks. CoRR arXiv:1710.10903"},{"key":"430_CR17","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1186\/1752-0509-2-73","volume":"2","author":"AS Konagurthu","year":"2008","unstructured":"Konagurthu AS, Lesk AM (2008) On the origin of distribution patterns of motifs in biological networks. BMC Syst Biol 2:73. https:\/\/doi.org\/10.1186\/1752-0509-2-73","journal-title":"BMC Syst Biol"},{"key":"430_CR18","doi-asserted-by":"publisher","unstructured":"Li X, Cheng R, Najafi M, Chang KC, Han X, Cao H (2020) M-cypher: a GQL framework supporting motifs. In: CIKM \u201920: the 29th ACM international conference on information and knowledge management, virtual event, Ireland, October 19\u201323 2020, pp 3433\u20133436. https:\/\/doi.org\/10.1145\/3340531.3417440","DOI":"10.1145\/3340531.3417440"},{"issue":"4","key":"430_CR19","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/S41019-018-0078-0","volume":"3","author":"L Cui","year":"2018","unstructured":"Cui L, Yue L, Wen D, Qin L (2018) K-connected cores computation in large dual networks. Data Sci Eng 3(4):293\u2013306. https:\/\/doi.org\/10.1007\/S41019-018-0078-0","journal-title":"Data Sci Eng"},{"issue":"6","key":"430_CR20","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. https:\/\/doi.org\/10.14778\/3055330.3055337","journal-title":"Proc VLDB Endow"},{"key":"430_CR21","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: International conference on management of data, SIGMOD 2014, Snowbird, UT, USA, June 22\u201327 2014, pp 1311\u20131322. https:\/\/doi.org\/10.1145\/2588555.2610495","DOI":"10.1145\/2588555.2610495"},{"issue":"1","key":"430_CR22","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1007\/S41019-017-0034-4","volume":"2","author":"M Onizuka","year":"2017","unstructured":"Onizuka M, Fujimori T, Shiokawa H (2017) Graph partitioning for distributed graph processing. Data Sci Eng 2(1):94\u2013105. https:\/\/doi.org\/10.1007\/S41019-017-0034-4","journal-title":"Data Sci Eng"},{"key":"430_CR23","doi-asserted-by":"publisher","unstructured":"Zhao H, Xu X, Song Y, Lee DL, Chen Z, Gao H (2018) Ranking users in social networks with higher-order structures. In: Proceedings of the 32nd AAAI conference on artificial intelligence, (AAAI-18), the 30th innovative applications of artificial intelligence (IAAI-18), and the 8th AAAI symposium on educational advances in artificial intelligence (EAAI-18), New Orleans, Louisiana, USA, February 2\u20137 2018, pp 232\u2013240. https:\/\/doi.org\/10.1609\/AAAI.V32I1.11287","DOI":"10.1609\/AAAI.V32I1.11287"},{"issue":"3","key":"430_CR24","doi-asserted-by":"publisher","first-page":"1724","DOI":"10.1109\/TNSE.2019.2951806","volume":"7","author":"S Liu","year":"2019","unstructured":"Liu S, Xiao J, Xu X (2019) Link prediction in signed social networks: from status theory to motif families. IEEE Trans Netw Sci Eng 7(3):1724\u20131735","journal-title":"IEEE Trans Netw Sci Eng"},{"issue":"4","key":"430_CR25","doi-asserted-by":"publisher","first-page":"466","DOI":"10.1016\/J.SOCNET.2005.11.005","volume":"28","author":"SP Borgatti","year":"2006","unstructured":"Borgatti SP, Everett MG (2006) A graph-theoretic perspective on centrality. Soc Netw 28(4):466\u2013484. https:\/\/doi.org\/10.1016\/J.SOCNET.2005.11.005","journal-title":"Soc Netw"},{"issue":"1","key":"430_CR26","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1080\/00223980.1954.9712925","volume":"38","author":"ME Shaw","year":"1954","unstructured":"Shaw ME (1954) Group structure and the behavior of individuals in small groups. J Psychol 38(1):139\u2013149","journal-title":"J Psychol"},{"key":"430_CR27","doi-asserted-by":"publisher","first-page":"35","DOI":"10.2307\/3033543","volume":"40","author":"LC Freeman","year":"1977","unstructured":"Freeman LC (1977) A set of measures of centrality based on betweenness. Sociometry 40:35\u201341","journal-title":"Sociometry"},{"issue":"2","key":"430_CR28","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1002\/bs.3830100205","volume":"10","author":"MA Beauchamp","year":"1965","unstructured":"Beauchamp MA (1965) An improved index of centrality. Behav Sci 10(2):161\u2013163","journal-title":"Behav Sci"},{"issue":"2","key":"430_CR29","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1108\/00220410310463491","volume":"59","author":"M Thelwall","year":"2003","unstructured":"Thelwall M (2003) Can Google\u2019s Pagerank be used to find the most important academic web pages? J Doc 59(2):205\u2013217","journal-title":"J Doc"},{"issue":"3","key":"430_CR30","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/S41019-022-00188-2","volume":"7","author":"H Wu","year":"2022","unstructured":"Wu H, Song C, Ge Y, Ge T (2022) Link prediction on complex networks: an experimental survey. Data Sci Eng 7(3):253\u2013278. https:\/\/doi.org\/10.1007\/S41019-022-00188-2","journal-title":"Data Sci Eng"},{"issue":"4","key":"430_CR31","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1016\/S0378-8733(01)00043-0","volume":"23","author":"S Yang","year":"2001","unstructured":"Yang S, Knoke D (2001) Optimal connections: strength and distance in valued graphs. Soc Netw 23(4):285\u2013295. https:\/\/doi.org\/10.1016\/S0378-8733(01)00043-0","journal-title":"Soc Netw"},{"issue":"2","key":"430_CR32","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.88.028701","volume":"88","author":"J Ito","year":"2001","unstructured":"Ito J, Kaneko K (2001) Spontaneous structure formation in a network of chaotic units with variable connection strengths. Phys Rev Lett 88(2):028701","journal-title":"Phys Rev Lett"},{"issue":"3","key":"430_CR33","doi-asserted-by":"publisher","DOI":"10.1088\/1741-2552\/ac69bd","volume":"19","author":"Y Yuan","year":"2022","unstructured":"Yuan Y, Liu J, Zhao P, Wang W, Gu X, Rong Y, Lai T, Chen Y, Xin K, Niu X et al (2022) A graph network model for neural connection prediction and connection strength estimation. J Neural Eng 19(3):036001","journal-title":"J Neural Eng"},{"issue":"1","key":"430_CR34","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/J.SOCNET.2004.11.007","volume":"27","author":"MG Everett","year":"2005","unstructured":"Everett MG, Borgatti SP (2005) Ego network betweenness. Soc Netw 27(1):31\u201338. https:\/\/doi.org\/10.1016\/J.SOCNET.2004.11.007","journal-title":"Soc Netw"},{"key":"430_CR35","unstructured":"Pandas (2008) https:\/\/pandas.pydata.org\/docs\/"},{"key":"430_CR36","unstructured":"Spark (2014) https:\/\/spark.apache.org\/sql\/"},{"key":"430_CR37","unstructured":"Open Graph Benchmark (2020) https:\/\/ogb.stanford.edu\/docs\/nodeprop\/#pyg"},{"key":"430_CR38","unstructured":"ML dataset (2024) https:\/\/paperswithcode.com\/datasets?task=node-classification&mod=graphs &page=1"},{"issue":"4","key":"430_CR39","first-page":"1","volume":"1","author":"T Chen","year":"2015","unstructured":"Chen T, He T, Benesty M, Khotilovich V, Tang Y, Cho H, Chen K, Mitchell R, Cano I, Zhou T (2015) Xgboost: extreme gradient boosting. R Packag Vers 0.4-2 1(4):1\u20134","journal-title":"R Packag Vers 0.4-2"}],"container-title":["Memetic Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12293-024-00430-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12293-024-00430-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12293-024-00430-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,8]],"date-time":"2024-11-08T06:12:21Z","timestamp":1731046341000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12293-024-00430-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,10,12]]},"references-count":39,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2024,12]]}},"alternative-id":["430"],"URL":"https:\/\/doi.org\/10.1007\/s12293-024-00430-6","relation":{},"ISSN":["1865-9284","1865-9292"],"issn-type":[{"type":"print","value":"1865-9284"},{"type":"electronic","value":"1865-9292"}],"subject":[],"published":{"date-parts":[[2024,10,12]]},"assertion":[{"value":"27 April 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 July 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 October 2024","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 declare no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}