{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,4]],"date-time":"2025-04-04T07:28:07Z","timestamp":1743751687708,"version":"3.37.3"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2023,8,31]],"date-time":"2023-08-31T00:00:00Z","timestamp":1693440000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,8,31]],"date-time":"2023-08-31T00:00:00Z","timestamp":1693440000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62272405"],"award-info":[{"award-number":["62272405"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"School and Locality Integration Development Project of Yantai City","award":["JS22JY02"],"award-info":[{"award-number":["JS22JY02"]}]},{"name":"Youth Innovation Science and Technology Support Program of Shandong Provincial","award":["2021KJ080"],"award-info":[{"award-number":["2021KJ080"]}]},{"DOI":"10.13039\/501100007129","name":"Natural Science Foundation of Shandong Province","doi-asserted-by":"publisher","award":["ZR2022MF238"],"award-info":[{"award-number":["ZR2022MF238"]}],"id":[{"id":"10.13039\/501100007129","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Yantai Science and Technology Innovation Development Plan Project","award":["2021YT06000645"],"award-info":[{"award-number":["2021YT06000645"]}]},{"name":"Open Foundation of State key Laboratory of Networking and Switching Technology","award":["SKLNST-2022-1-12"],"award-info":[{"award-number":["SKLNST-2022-1-12"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Complex Intell. Syst."],"published-print":{"date-parts":[[2024,2]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>The development of the Internet and big data has led to the emergence of graphs as an important data representation structure in various real-world scenarios. However, as data size increases, computational complexity and memory requirements pose significant challenges for graph embedding. To address this challenge, this paper proposes a multilevel embedding refinement framework (MERIT) based on large-scale graphs, using spectral distance-constrained graph coarsening algorithms and an improved graph convolutional neural network model that addresses the over-smoothing problem by incorporating initial values and identity mapping. Experimental results on large-scale datasets demonstrate the effectiveness of MERIT, with an average AUROC score 8% higher than other baseline methods. Moreover, in a node classification task on a large-scale graph with 126,825 nodes and 22,412,658 edges, the framework improves embedding quality while enhancing the runtime by 25 times. The experimental findings highlight the superior efficiency and accuracy of the proposed approach compared to other graph embedding methods.<\/jats:p>","DOI":"10.1007\/s40747-023-01211-3","type":"journal-article","created":{"date-parts":[[2023,8,31]],"date-time":"2023-08-31T07:03:01Z","timestamp":1693465381000},"page":"1303-1318","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Merit: multi-level graph embedding refinement framework for large-scale graph"],"prefix":"10.1007","volume":"10","author":[{"given":"Weishuai","family":"Che","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3262-8962","authenticated-orcid":false,"given":"Zhaowei","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Yingjie","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Jinglei","family":"Liu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,8,31]]},"reference":[{"key":"1211_CR1","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/j.aiopen.2021.01.001","volume":"1","author":"J Zhou","year":"2020","unstructured":"Zhou J, Cui G, Hu S, Zhang Z, Yang C, Liu Z (2020) Graph neural networks: A review of methods and applications. AI Open 1:57\u201381. https:\/\/doi.org\/10.1016\/j.aiopen.2021.01.001","journal-title":"AI Open"},{"key":"1211_CR2","doi-asserted-by":"publisher","unstructured":"HongYun\u00a0Cai K.C.-C.C. Vincent W.\u00a0Zheng (2018) A comprehensive survey of graph embedding: Problems, techniques, and applications. IEEE Transactions on Knowledge and Data Engineering 30(9), 1616\u20131637. https:\/\/doi.org\/10.1109\/TKDE.2018.2807452","DOI":"10.1109\/TKDE.2018.2807452"},{"key":"1211_CR3","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1016\/j.knosys.2018.03.022","volume":"151","author":"EF Palash Goyal","year":"2018","unstructured":"Palash Goyal EF (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":"1211_CR4","doi-asserted-by":"publisher","unstructured":"Qiu J, Tang J, Ma H, Dong Y, Wang K, Tang J (2018) Deepinf: Social influence prediction with deep learning. In: Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. KDD \u201918, pp. 2110\u20132119. Association for Computing Machinery, New York, NY, USA . https:\/\/doi.org\/10.1145\/3219819.3220077","DOI":"10.1145\/3219819.3220077"},{"key":"1211_CR5","doi-asserted-by":"publisher","first-page":"2259","DOI":"10.1007\/s11280-020-00793-z","volume":"23","author":"Y Pan","year":"2020","unstructured":"Pan Y, He F, Yu H (2020) Learning social representations with deep autoencoder for recommender system. World Wide Web 23:2259\u20132279","journal-title":"World Wide Web"},{"key":"1211_CR6","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2021.115573","volume":"185","author":"Y Wu","year":"2021","unstructured":"Wu Y, Xu Y, Li J (2021) Fraudulent traffic detection in online advertising with bipartite graph propagation algorithm. Expert Syst Appl 185:115573. https:\/\/doi.org\/10.1016\/j.eswa.2021.115573","journal-title":"Expert Syst Appl"},{"key":"1211_CR7","doi-asserted-by":"publisher","unstructured":"Perozzi B, Al-Rfou R, Skiena S (2014) Deepwalk: Online learning of social representations. In: Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. KDD \u201914, pp. 701\u2013710. Association for Computing Machinery, New York, NY, USA . https:\/\/doi.org\/10.1145\/2623330.2623732","DOI":"10.1145\/2623330.2623732"},{"key":"1211_CR8","doi-asserted-by":"publisher","unstructured":"Grover A, Leskovec J (2016) Node2vec: Scalable feature learning for networks. In: Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. KDD \u201916, pp. 855\u2013864. Association for Computing Machinery, New York, NY, USA. https:\/\/doi.org\/10.1145\/2939672.2939754","DOI":"10.1145\/2939672.2939754"},{"key":"1211_CR9","doi-asserted-by":"crossref","unstructured":"Liang J, Gurukar S, Parthasarathy S (2021) Mile: A multi-level framework for scalable graph embedding. In: Proceedings of the International AAAI Conference on Web and Social Media, vol. 15, pp. 361\u2013372","DOI":"10.1609\/icwsm.v15i1.18067"},{"key":"1211_CR10","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2020.105578","volume":"194","author":"Y Xie","year":"2020","unstructured":"Xie Y, Yao C, Gong M, Chen C, Qin AK (2020) Graph convolutional networks with multi-level coarsening for graph classification. Knowl-Based Syst 194:105578. https:\/\/doi.org\/10.1016\/j.knosys.2020.105578","journal-title":"Knowl-Based Syst"},{"key":"1211_CR11","unstructured":"Welling M, Kipf T.N (2016) Semi-supervised classification with graph convolutional networks. In: J. International Conference on Learning Representations (ICLR 2017)"},{"key":"1211_CR12","doi-asserted-by":"publisher","unstructured":"Akbas E, Aktas M.E (2019) Network embedding: on compression and learning. In: 2019 IEEE International Conference on Big Data (Big Data), pp. 4763\u20134772. https:\/\/doi.org\/10.1109\/BigData47090.2019.9006142","DOI":"10.1109\/BigData47090.2019.9006142"},{"key":"1211_CR13","unstructured":"Deng C, Zhao Z, Wang Y, Zhang Z, Feng Z (2019) Graphzoom: A multi-level spectral approach for accurate and scalable graph embedding. arXiv preprint arXiv:1910.02370"},{"issue":"15","key":"1211_CR14","doi-asserted-by":"publisher","first-page":"2819","DOI":"10.1080\/03081087.2020.1814194","volume":"70","author":"S Pirzada","year":"2022","unstructured":"Pirzada S, Ganie H, Alhevaz A, Baghipur M (2022) On spectral spread of generalized distance matrix of a graph. Linear and Multilinear Algebra 70(15):2819\u20132835","journal-title":"Linear and Multilinear Algebra"},{"key":"1211_CR15","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 \u201915, pp. 1067\u20131077. International World Wide Web Conferences Steering Committee, Republic and Canton of Geneva, CHE . https:\/\/doi.org\/10.1145\/2736277.2741093","DOI":"10.1145\/2736277.2741093"},{"key":"1211_CR16","doi-asserted-by":"publisher","unstructured":"Wang D, Cui P, Zhu W (2019) Structural deep network embedding. In: Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. KDD \u201916, pp. 1225\u20131234. Association for Computing Machinery, New York, NY, USA . https:\/\/doi.org\/10.1145\/2939672.2939753","DOI":"10.1145\/2939672.2939753"},{"key":"1211_CR17","doi-asserted-by":"publisher","unstructured":"Qiu J, Dong Y, Ma H, Li J, Wang K, Tang J (2018) Network embedding as matrix factorization: Unifying deepwalk, line, pte, and node2vec. In: Proceedings of the Eleventh ACM International Conference on Web Search and Data Mining. WSDM \u201918, pp. 459\u2013467. Association for Computing Machinery, New York, NY, USA. https:\/\/doi.org\/10.1145\/3159652.3159706","DOI":"10.1145\/3159652.3159706"},{"key":"1211_CR18","doi-asserted-by":"publisher","DOI":"10.1016\/j.image.2021.116253","volume":"95","author":"Y Zhang","year":"2021","unstructured":"Zhang Y, Li X, Jia M (2021) Adaptive graph-based discriminative nonnegative matrix factorization for image clustering. Signal Processing: Image Communication 95:116253. https:\/\/doi.org\/10.1016\/j.image.2021.116253","journal-title":"Signal Processing: Image Communication"},{"issue":"2","key":"1211_CR19","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1109\/TKDE.2018.2833443","volume":"31","author":"C Shi","year":"2019","unstructured":"Shi C, Hu B, Zhao WX, Yu PS (2019) Heterogeneous information network embedding for recommendation. IEEE Trans Knowl Data Eng 31(2):357\u2013370. https:\/\/doi.org\/10.1109\/TKDE.2018.2833443","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"1211_CR20","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2020.113235","volume":"151","author":"E Palumbo","year":"2020","unstructured":"Palumbo E, Monti D, Rizzo G, Troncy R, Baralis E (2020) entity2rec: Property-specific knowledge graph embeddings for item recommendation. Expert Syst Appl 151:113235. https:\/\/doi.org\/10.1016\/j.eswa.2020.113235","journal-title":"Expert Syst Appl"},{"key":"1211_CR21","doi-asserted-by":"crossref","unstructured":"Li R, Liu Z, Ma Y, Yang D, Sun S (2022) Internet financial fraud detection based on graph learning. IEEE Transactions on Computational Social Systems","DOI":"10.1109\/TCSS.2022.3189368"},{"key":"1211_CR22","doi-asserted-by":"crossref","unstructured":"Wang Y, Liu Z, Xu J, Yan W (2022) Heterogeneous network representation learning approach for ethereum identity identification. IEEE Transactions on Computational Social Systems","DOI":"10.1109\/TCSS.2022.3164719"},{"key":"1211_CR23","doi-asserted-by":"crossref","unstructured":"Yin Y, Wei Z (2019) Scalable graph embeddings via sparse transpose proximities. In: Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, pp. 1429\u20131437","DOI":"10.1145\/3292500.3330860"},{"key":"1211_CR24","doi-asserted-by":"publisher","unstructured":"Fu G, Hou C, Yao X (2019) Learning topological representation for networks via hierarchical sampling. In: 2019 International Joint Conference on Neural Networks (IJCNN), pp. 1\u20138. https:\/\/doi.org\/10.1109\/IJCNN.2019.8851893","DOI":"10.1109\/IJCNN.2019.8851893"},{"key":"1211_CR25","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2020.113715","volume":"161","author":"T Ma","year":"2020","unstructured":"Ma T, Pan Q, Wang H, Shao W, Tian Y, Al-Nabhan N (2020) Graph classification algorithm based on graph structure embedding. Expert Syst Appl 161:113715. https:\/\/doi.org\/10.1016\/j.eswa.2020.113715","journal-title":"Expert Syst Appl"},{"key":"1211_CR26","doi-asserted-by":"publisher","DOI":"10.1016\/j.dcan.2022.11.018","author":"Z Liu","year":"2022","unstructured":"Liu Z, Yang D, Wang S, Su H (2022) Adaptive multi-channel bayesian graph attention network for iot transaction security. Digital Communications and Networks. https:\/\/doi.org\/10.1016\/j.dcan.2022.11.018","journal-title":"Digital Communications and Networks"},{"key":"1211_CR27","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1016\/j.ins.2020.02.063","volume":"522","author":"R Wang","year":"2020","unstructured":"Wang R, Wang C, Liu G (2020) A novel graph clustering method with a greedy heuristic search algorithm for mining protein complexes from dynamic and static ppi networks. Inf Sci 522:275\u2013298. https:\/\/doi.org\/10.1016\/j.ins.2020.02.063","journal-title":"Inf Sci"},{"key":"1211_CR28","unstructured":"Xu K, Li C, Tian Y, Sonobe T, Kawarabayashi K.-i, Jegelka S (2018) Representation learning on graphs with jumping knowledge networks. In: Dy, J., Krause, A. (eds.) Proceedings of the 35th International Conference on Machine Learning. Proceedings of Machine Learning Research, vol. 80, pp. 5453\u20135462. https:\/\/proceedings.mlr.press\/v80\/xu18c.html"},{"key":"1211_CR29","unstructured":"Rong Y, Huang W, Xu T, Huang J (2019) Dropedge: Towards deep graph convolutional networks on node classification. arXiv preprint arXiv:1907.10903"},{"key":"1211_CR30","doi-asserted-by":"publisher","unstructured":"Tsitsulin A, Mottin D, Karras P, Bronstein A, M\u00fcller E (2018) Netlsd: Hearing the shape of a graph. In: Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. KDD \u201918, pp. 2347\u20132356. Association for Computing Machinery, New York, NY, USA. https:\/\/doi.org\/10.1145\/3219819.3219991","DOI":"10.1145\/3219819.3219991"},{"key":"1211_CR31","doi-asserted-by":"publisher","unstructured":"Dong K, Benson A.R, Bindel D (2019) Network density of states. In: Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. KDD \u201919, pp. 1152\u20131161. Association for Computing Machinery, New York, NY, USA . https:\/\/doi.org\/10.1145\/3292500.3330891","DOI":"10.1145\/3292500.3330891"},{"key":"1211_CR32","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1016\/j.neunet.2021.05.026","volume":"142","author":"X Zhang","year":"2021","unstructured":"Zhang X, Liu H, Wu X-M, Zhang X, Liu X (2021) Spectral embedding network for attributed graph clustering. Neural Netw 142:388\u2013396. https:\/\/doi.org\/10.1016\/j.neunet.2021.05.026","journal-title":"Neural Netw"},{"issue":"5","key":"1211_CR33","doi-asserted-by":"publisher","first-page":"377","DOI":"10.14778\/2732269.2732274","volume":"7","author":"N Korula","year":"2014","unstructured":"Korula N, Lattanzi S (2014) An efficient reconciliation algorithm for social networks. Proc. VLDB Endow 7(5):377\u2013388. https:\/\/doi.org\/10.14778\/2732269.2732274","journal-title":"Proc. VLDB Endow"},{"key":"1211_CR34","unstructured":"Chen M, Wei Z, Huang Z, Ding B, Li Y (2020) Simple and deep graph convolutional networks. In: III, H.D., Singh, A. (eds.) Proceedings of the 37th International Conference on Machine Learning. Proceedings of Machine Learning Research, vol. 119, pp. 1725\u20131735. https:\/\/proceedings.mlr.press\/v119\/chen20v.html"},{"key":"1211_CR35","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1016\/j.eswa.2019.07.006","volume":"137","author":"B Li","year":"2019","unstructured":"Li B, Pi D (2019) Learning deep neural networks for node classification. Expert Syst Appl 137:324\u2013334. https:\/\/doi.org\/10.1016\/j.eswa.2019.07.006","journal-title":"Expert Syst Appl"},{"key":"1211_CR36","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/j.comcom.2021.03.012","volume":"173","author":"X You","year":"2021","unstructured":"You X, Ma Y, Liu Z, Liu J, Zhang M (2021) Representation method of cooperative social network features based on node2vec model. Comput Commun 173:21\u201326. https:\/\/doi.org\/10.1016\/j.comcom.2021.03.012","journal-title":"Comput Commun"},{"key":"1211_CR37","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2020.113290","volume":"148","author":"G Chen","year":"2020","unstructured":"Chen G, Xu C, Wang J, Feng J, Feng J (2020) Nonnegative matrix factorization for link prediction in directed complex networks using pagerank and asymmetric link clustering information. Expert Syst Appl 148:113290. https:\/\/doi.org\/10.1016\/j.eswa.2020.113290","journal-title":"Expert Syst Appl"},{"key":"1211_CR38","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/j.comcom.2021.10.009","volume":"181","author":"F Gou","year":"2022","unstructured":"Gou F, Wu J (2022) Triad link prediction method based on the evolutionary analysis with iot in opportunistic social networks. Comput Commun 181:143\u2013155","journal-title":"Comput Commun"},{"key":"1211_CR39","doi-asserted-by":"crossref","unstructured":"Chen H, Perozzi B, Hu Y, Skiena S (2018) Ha0rp: Hierarchical representation learning for networks. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 32","DOI":"10.1609\/aaai.v32i1.11849"}],"container-title":["Complex &amp; Intelligent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-023-01211-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40747-023-01211-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-023-01211-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,10]],"date-time":"2024-02-10T22:33:41Z","timestamp":1707604421000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40747-023-01211-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,8,31]]},"references-count":39,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2024,2]]}},"alternative-id":["1211"],"URL":"https:\/\/doi.org\/10.1007\/s40747-023-01211-3","relation":{},"ISSN":["2199-4536","2198-6053"],"issn-type":[{"type":"print","value":"2199-4536"},{"type":"electronic","value":"2198-6053"}],"subject":[],"published":{"date-parts":[[2023,8,31]]},"assertion":[{"value":"26 October 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 August 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 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 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"}},{"value":"The authors declare the following financial interests\/personal relationships which may be considered as potential","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Financial interests"}}]}}