{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,7]],"date-time":"2026-04-07T12:46:40Z","timestamp":1775566000525,"version":"3.50.1"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2026,4,7]],"date-time":"2026-04-07T00:00:00Z","timestamp":1775520000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,4,7]],"date-time":"2026-04-07T00:00:00Z","timestamp":1775520000000},"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":["Int J Data Sci Anal"],"published-print":{"date-parts":[[2026,12]]},"DOI":"10.1007\/s41060-026-01091-z","type":"journal-article","created":{"date-parts":[[2026,4,7]],"date-time":"2026-04-07T11:50:05Z","timestamp":1775562605000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Grace: a scalable framework for graph embedding with autoencoder-based feature compression and random walks"],"prefix":"10.1007","volume":"22","author":[{"given":"Mohammad Mehdi","family":"Keikha","sequence":"first","affiliation":[]},{"given":"Saman","family":"Barahoie","sequence":"additional","affiliation":[]},{"given":"Abolfazl","family":"Nadi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,4,7]]},"reference":[{"key":"1091_CR1","doi-asserted-by":"publisher","first-page":"1019","DOI":"10.1002\/asi.20591","volume":"58","author":"D Liben-Nowell","year":"2007","unstructured":"Liben-Nowell, D., Kleinberg, J.: The link prediction problem for social networks. J. Am. Soc. Inform. Sci. Technol. 58, 1019\u20131031 (2007)","journal-title":"J. Am. Soc. Inform. Sci. Technol."},{"key":"1091_CR2","doi-asserted-by":"publisher","first-page":"P10008","DOI":"10.1088\/1742-5468\/2008\/10\/P10008","volume":"2008","author":"VD Blondel","year":"2008","unstructured":"Blondel, V.D., Guillaume, J.-L., Lambiotte, R., Lefebvre, E.: Fast unfolding of communities in large networks. J. Stat. Mech: Theory Exp. 2008, P10008 (2008)","journal-title":"J. Stat. Mech: Theory Exp."},{"key":"1091_CR3","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/j.knosys.2018.02.028","volume":"148","author":"MM Keikha","year":"2018","unstructured":"Keikha, M.M., Rahgozar, M., Asadpour, M.: Community aware random walk for network embedding. Knowl.-Based Syst. 148, 47\u201354 (2018)","journal-title":"Knowl.-Based Syst."},{"key":"1091_CR4","volume":"10","author":"J Xiong","year":"2024","unstructured":"Xiong, J., Yu, L., Pang, Y., Zhang, L.: An empirical study of graph neural networks on networked data. PeerJ Comput. Sci. 10, e26965 (2024)","journal-title":"PeerJ Comput. Sci."},{"key":"1091_CR5","doi-asserted-by":"publisher","first-page":"1373","DOI":"10.1162\/089976603321780317","volume":"15","author":"M Belkin","year":"2003","unstructured":"Belkin, M., Niyogi, P.: Laplacian eigenmaps for dimensionality reduction and data representation. Neural Comput. 15, 1373\u20131396 (2003)","journal-title":"Neural Comput."},{"key":"1091_CR6","doi-asserted-by":"crossref","unstructured":"Tang, J., et\u00a0al.: Line: Large-scale information network embedding. Proceedings of the 24th International Conference on World Wide Web pp. 1067\u20131077 (2015)","DOI":"10.1145\/2736277.2741093"},{"key":"1091_CR7","doi-asserted-by":"crossref","unstructured":"Li, D., et\u00a0al.: Revisiting dynamic graph clustering via matrix factorization pp. 1342\u20131352 (2025)","DOI":"10.1145\/3696410.3714646"},{"key":"1091_CR8","unstructured":"Kipf, T.N., Welling, M.: Semi-supervised classification with graph convolutional networks. International Conference on Learning Representations (2017). ArXiv:1609.02907"},{"key":"1091_CR9","unstructured":"Veli\u010dkovi\u0107, P., et\u00a0al.: Graph attention networks. International Conference on Learning Representations (2018). ArXiv:1710.10903"},{"key":"1091_CR10","first-page":"7793","volume":"33","author":"J Zhu","year":"2020","unstructured":"Zhu, J., et al.: Beyond homophily in graph neural networks: current limitations and effective designs. Adv. Neural. Inf. Process. Syst. 33, 7793\u20137804 (2020)","journal-title":"Adv. Neural. Inf. Process. Syst."},{"key":"1091_CR11","unstructured":"Li, J., Zhang, W., Chen, H., Wang, T.: Advgnn: Adversarial training for robust graph neural networks. International Conference on Learning Representations (2024)"},{"key":"1091_CR12","doi-asserted-by":"crossref","unstructured":"Perozzi, B., Al-Rfou, R., Skiena, S.: Deepwalk: Online learning of social representations. Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining pp. 701\u2013710 (2014)","DOI":"10.1145\/2623330.2623732"},{"key":"1091_CR13","doi-asserted-by":"crossref","unstructured":"Grover, A., Leskovec, J.: node2vec: Scalable feature learning for networks. Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining pp. 855\u2013864 (2016)","DOI":"10.1145\/2939672.2939754"},{"key":"1091_CR14","first-page":"345","volume":"170","author":"L Zhang","year":"2024","unstructured":"Zhang, L., Wang, X., Chen, H.: Walknet: integrating feature-aware random walks with graph attention. Neural Netw. 170, 345\u2013356 (2024)","journal-title":"Neural Netw."},{"key":"1091_CR15","first-page":"123","volume":"165","author":"X Guo","year":"2023","unstructured":"Guo, X., Wang, H., Zhang, W.: Efficient graph neural networks for large-scale data. Neural Netw. 165, 123\u2013135 (2023)","journal-title":"Neural Netw."},{"key":"1091_CR16","first-page":"1","volume":"10","author":"MM Keikha","year":"2020","unstructured":"Keikha, M.M., Rahgozar, M., Asadpour, M.: Influence maximization across heterogeneous networks. Soc. Netw. Anal. Min. 10, 1\u201317 (2020)","journal-title":"Soc. Netw. Anal. Min."},{"key":"1091_CR17","unstructured":"Zhou, J., Zhang, W., Chen, H., Li, J.: Clarify structural ambiguity in graph neural networks. IEEE Transactions on Neural Networks and Learning Systems (2025)"},{"key":"1091_CR18","doi-asserted-by":"publisher","first-page":"642","DOI":"10.1177\/0165551519891345","volume":"47","author":"MM Keikha","year":"2021","unstructured":"Keikha, M.M., Rahgozar, M., Asadpour, M.: Deeplink: a novel link prediction framework based on deep learning. J. Inf. Sci. 47, 642\u2013657 (2021)","journal-title":"J. Inf. Sci."},{"key":"1091_CR19","unstructured":"Chen, H., Yin, H., Wang, W., Wang, T., Chen, W.: Fast and scalable random walk-based embedding. Proceedings of the 2019 World Wide Web Conference pp. 294\u2013304 (2019)"},{"key":"1091_CR20","doi-asserted-by":"crossref","unstructured":"Qiu, J., et\u00a0al.: Network embedding as matrix factorization: Unifying deepwalk, line, pte, and node2vec. Proceedings of the Eleventh ACM International Conference on Web Search and Data Mining pp. 459\u2013467 (2018)","DOI":"10.1145\/3159652.3159706"},{"key":"1091_CR21","unstructured":"Yang, C., Liu, Z., Zhao, D., Sun, M., Chang, E.: Bane: Binary embedding for networks. Proceedings of the 2019 World Wide Web Conference pp. 344\u2013354 (2019)"},{"key":"1091_CR22","doi-asserted-by":"crossref","unstructured":"Donnat, C., Zitnik, M., Hallac, D., Leskovec, J.: Learning structural node embeddings via diffusion wavelets. Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining pp. 1320\u20131329 (2018)","DOI":"10.1145\/3219819.3220025"},{"key":"1091_CR23","unstructured":"Wang, X., Zhang, M., Li, J., Chen, H.: Graphmf: adaptive graph factorization for dynamic networks. IEEE Trans. Knowl. Data Eng. 36, 3456\u20133468 (2024)"},{"key":"1091_CR24","first-page":"6789","volume":"34","author":"J Xu","year":"2023","unstructured":"Xu, J., Zhang, W., Chen, H., Li, J.: Merit: multi-level random walk for graph embedding. IEEE Trans. Neural Networks Learn. Syst. 34, 6789\u20136801 (2023)","journal-title":"IEEE Trans. Neural Networks Learn. Syst."},{"key":"1091_CR25","unstructured":"Li, J., Zhang, W., Chen, H., Wang, T.: Diffwalk: Diffusion-based random walk for dynamic graph embedding. Proceedings of the 2020 World Wide Web Conference pp. 456\u2013466 (2020)"},{"key":"1091_CR26","first-page":"1024","volume":"30","author":"WL Hamilton","year":"2017","unstructured":"Hamilton, W.L., Ying, R., Leskovec, J.: Inductive representation learning on large graphs. Adv. Neural. Inf. Process. Syst. 30, 1024\u20131034 (2017)","journal-title":"Adv. Neural. Inf. Process. Syst."},{"key":"1091_CR27","unstructured":"Zeng, H., Zhou, H., Srivastava, A., Kannan, R., Prasanna, V.: Graphsaint: Graph sampling based inductive learning method. International Conference on Learning Representations (2020). ArXiv:1907.04931"},{"key":"1091_CR28","unstructured":"Li, J., Zhang, W., Chen, H., Wang, T.: Finding global homophily in graph neural networks when local homophily is absent. International Conference on Learning Representations (2022)"},{"key":"1091_CR29","first-page":"7890","volume":"34","author":"H Chen","year":"2023","unstructured":"Chen, H., Zhang, W., Wang, T., Li, J.: Exploiting structural roles in graph neural networks. IEEE Trans. Neural Networks Learn. Syst. 34, 7890\u20137902 (2023)","journal-title":"IEEE Trans. Neural Networks Learn. Syst."},{"key":"1091_CR30","unstructured":"Li, D., et\u00a0al.: Dyg-mamba: Continuous state space modeling on dynamic graphs. arXiv preprint arXiv:2408.06966 (2025)"}],"container-title":["International Journal of Data Science and Analytics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41060-026-01091-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s41060-026-01091-z","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41060-026-01091-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,7]],"date-time":"2026-04-07T11:50:10Z","timestamp":1775562610000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s41060-026-01091-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,4,7]]},"references-count":30,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,12]]}},"alternative-id":["1091"],"URL":"https:\/\/doi.org\/10.1007\/s41060-026-01091-z","relation":{},"ISSN":["2364-415X","2364-4168"],"issn-type":[{"value":"2364-415X","type":"print"},{"value":"2364-4168","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,4,7]]},"assertion":[{"value":"5 September 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 March 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 April 2026","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"}},{"value":"This study involves no experiments on humans or animals.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval and consent to participate"}}],"article-number":"128"}}