{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,5]],"date-time":"2026-03-05T15:46:04Z","timestamp":1772725564939,"version":"3.50.1"},"reference-count":54,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2023,6,26]],"date-time":"2023-06-26T00:00:00Z","timestamp":1687737600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,6,26]],"date-time":"2023-06-26T00:00:00Z","timestamp":1687737600000},"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":["Nat Comput Sci"],"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>Graph representation learning methods opened new avenues for addressing complex, real-world problems represented by graphs. However, many graphs used in these applications comprise millions of nodes and billions of edges and are beyond the capabilities of current methods and software implementations. We present GRAPE (Graph Representation Learning, Prediction and Evaluation), a software resource for graph processing and embedding that is able to scale with big graphs by using specialized and smart data structures, algorithms, and a fast parallel implementation of random-walk-based methods. Compared with state-of-the-art software resources, GRAPE shows an improvement of orders of magnitude in empirical space and time complexity, as well as competitive edge- and node-label prediction performance. GRAPE comprises approximately 1.7 million well-documented lines of Python and Rust code and provides 69 node-embedding methods, 25 inference models, a collection of efficient graph-processing utilities, and over 80,000 graphs from the literature and other sources. Standardized interfaces allow a seamless integration of third-party libraries, while ready-to-use and modular pipelines permit an easy-to-use evaluation of graph-representation-learning methods, therefore also positioning GRAPE as a software resource that performs a fair comparison between methods and libraries for graph processing and embedding.<\/jats:p>","DOI":"10.1038\/s43588-023-00465-8","type":"journal-article","created":{"date-parts":[[2023,6,26]],"date-time":"2023-06-26T12:02:10Z","timestamp":1687780930000},"page":"552-568","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":29,"title":["GRAPE for fast and scalable graph processing and random-walk-based embedding"],"prefix":"10.1038","volume":"3","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1269-2038","authenticated-orcid":false,"given":"Luca","family":"Cappelletti","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9806-3493","authenticated-orcid":false,"given":"Tommaso","family":"Fontana","sequence":"additional","affiliation":[]},{"given":"Elena","family":"Casiraghi","sequence":"additional","affiliation":[]},{"given":"Vida","family":"Ravanmehr","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8169-9049","authenticated-orcid":false,"given":"Tiffany J.","family":"Callahan","sequence":"additional","affiliation":[]},{"given":"Carlos","family":"Cano","sequence":"additional","affiliation":[]},{"given":"Marcin P.","family":"Joachimiak","sequence":"additional","affiliation":[]},{"given":"Christopher J.","family":"Mungall","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0736-9199","authenticated-orcid":false,"given":"Peter N.","family":"Robinson","sequence":"additional","affiliation":[]},{"given":"Justin","family":"Reese","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5694-3919","authenticated-orcid":false,"given":"Giorgio","family":"Valentini","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,6,26]]},"reference":[{"key":"465_CR1","first-page":"1","volume":"14","author":"WL Hamilton","year":"2020","unstructured":"Hamilton, W. L. Graph representation learning. Synth. Lect. Artif. Intell. Mach. Learn. 14, 1\u2013159 (2020).","journal-title":"Synth. Lect. Artif. Intell. Mach. Learn."},{"key":"465_CR2","first-page":"2539","volume":"12","author":"N Shervashidze","year":"2011","unstructured":"Shervashidze, N., Schweitzer, P., Van Leeuwen, E., Mehlhorn, K. & Borgwardt, K. M. Weisfeiler-Lehman graph kernels. J. Mach. Learn. Res. 12, 2539\u20132561 (2011).","journal-title":"J. Mach. Learn. Res."},{"key":"465_CR3","doi-asserted-by":"crossref","unstructured":"Wu, Z., et al. A comprehensive survey on graph neural networks. IEEE transactions on neural networks and learning systems. 32, 4\u201324 (2020).","DOI":"10.1109\/TNNLS.2020.2978386"},{"key":"465_CR4","unstructured":"Csardi, G. & Nepusz, T. The Igraph software package for complex network research. Inter. J. Complex Sys. 1695, 1\u20139 (2006)"},{"key":"465_CR5","unstructured":"Low, Y., Gonzalez, J., Kyrola, A., Bickson, D., Guestrin, C. and Hellerstein, J.M., Graphlab: a new framework for parallel machine learning. In Proc. 26th Conference on Uncertainty in Artificial Intelligence, UAI\u201910 340\u2013349 (AUAI Press, 2010)."},{"key":"465_CR6","doi-asserted-by":"crossref","unstructured":"Hagberg, A., Schult, D. & Swart, P. Exploring network structure, dynamics, and function using networkx. Proc. 7th Python Sci. Conf., 11\u201315. (2008)","DOI":"10.25080\/TCWV9851"},{"key":"465_CR7","unstructured":"Gonzalez, J.E., et al. Graphx: Graph processing in a distributed dataflow framework. In 11th {USENIX} Symposium on Operating Systems Design and Implementation 14, 599\u2013613 (2014)."},{"key":"465_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2898361","volume":"8","author":"J Leskovec","year":"2016","unstructured":"Leskovec, J. & Sosi\u010d, R. Snap: a general-purpose network analysis and graph-mining library. ACM Trans. Intell. Syst. Technol. 8, 1 (2016).","journal-title":"ACM Trans. Intell. Syst. Technol."},{"key":"465_CR9","doi-asserted-by":"publisher","first-page":"3377","DOI":"10.1093\/bioinformatics\/btab202","volume":"37","author":"R Liu","year":"2021","unstructured":"Liu, R. & Krishnan, A. Pecanpy: a fast, efficient and parallelized python implementation of node2vec. Bioinformatics 37, 3377\u20133379 (2021).","journal-title":"Bioinformatics"},{"key":"465_CR10","unstructured":"Ali, M. et al. PyKEEN 1.0: a Python library for training and evaluating knowledge graph embeddings. J. Mach. Learn. Res. 22, 1\u20136 (2021)."},{"key":"465_CR11","doi-asserted-by":"publisher","unstructured":"Wang, M. et al. Deep Graph Library: Towards Efficient and Scalable Deep Learning on Graphs. CoRR abs\/1909.01315 (2019) https:\/\/doi.org\/10.48550\/arXiv.1909.01315","DOI":"10.48550\/arXiv.1909.01315"},{"key":"465_CR12","doi-asserted-by":"publisher","unstructured":"Fey, M. & Lenssen, J. E. Fast graph representation learning with PyTorch Geometric. arXiv:1903.02428 [cs.LG] https:\/\/doi.org\/10.48550\/arXiv.1903.02428","DOI":"10.48550\/arXiv.1903.02428"},{"key":"465_CR13","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1109\/MCI.2020.3039072","volume":"16","author":"D Grattarola","year":"2021","unstructured":"Grattarola, D. & Alippi, C. Graph neural networks in TensorFlow and Keras with Spektral. IEEE Comput. Intell. Mag. 16, 99\u2013106 (2021).","journal-title":"IEEE Comput. Intell. Mag."},{"key":"465_CR14","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1109\/TBDATA.2018.2850013","volume":"1","author":"D Zhang","year":"2020","unstructured":"Zhang, D., Yin, J., Zhu, X. & Zhang, C. Network representation learning: a survey. IEEE Trans. Big Data 1, 3\u201328 (2020).","journal-title":"IEEE Trans. Big Data"},{"key":"465_CR15","unstructured":"Zeng, H. et al. Decoupling the depth and scope of graph neural networks. In: Advances in Neural Information Processing Systems. Editors: A. Beygelzimer and Y. Dauphin and P. Liang and J. Wortman Vaughan, 2021. https:\/\/openreview.net\/forum?id=_IY3_4psXuf"},{"key":"465_CR16","doi-asserted-by":"publisher","unstructured":"Hu, W., Fey, M., Ren, H., Nakata, M., Dong, Y. and Leskovec, J. LSC: a large-scale challenge for machine learning on graphs. arXiv:2103.09430 https:\/\/doi.org\/10.48550\/arXiv.2103.09430 (2021).","DOI":"10.48550\/arXiv.2103.09430"},{"key":"465_CR17","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1038\/d41586-020-03382-2","volume":"588","author":"JM Perkel","year":"2020","unstructured":"Perkel, J. M. Why scientists are turning to Rust. Nature 588, 185\u2013186 (2020).","journal-title":"Nature"},{"key":"465_CR18","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1109\/TIT.1975.1055349","volume":"21","author":"P Elias","year":"1975","unstructured":"Elias, P. Universal codeword sets and representations of the integers. IEEE Trans. Inf. Theory 21, 194\u2013203 (1975).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"465_CR19","unstructured":"Pibiri, G. E. & Venturini, R. Dynamic Elias-Fano representation. In 28th Annu. Symp. Combinatorial Pattern Matching (CPM 2017) (Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, 2017)."},{"key":"465_CR20","doi-asserted-by":"crossref","unstructured":"Zheng, D., Wang, M., Gan, Q., Zhang, Z. & Karypis, G. Scalable graph neural networks with deep graph library. In Proc. 26th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD \u201920 3521\u20133522 (Association for Computing Machinery, 2020).","DOI":"10.1145\/3394486.3406712"},{"key":"465_CR21","doi-asserted-by":"crossref","unstructured":"Happ, M., et al. Exploring the Limitations of Current Graph Neural Networks for Network Modeling. In: NOMS 2022-2022 IEEE\/IFIP Network Operations and Management Symposium (IEEE, 2022).","DOI":"10.1109\/NOMS54207.2022.9789708"},{"key":"465_CR22","doi-asserted-by":"crossref","unstructured":"Bader, D. A. & Madduri, K. Parallel algorithms for evaluating centrality indices in real-world networks. In 2006 Int. Conf. Parallel Processing (ICPP\u201906) 539\u2013550 (IEEE, 2006).","DOI":"10.1109\/ICPP.2006.57"},{"key":"465_CR23","doi-asserted-by":"crossref","unstructured":"Ou, M., Cui, P., Pei, J., Zhang, Z. & Zhu, W. Asymmetric transitivity preserving graph embedding. In Proc. 22nd ACM SIGKDD Int. Conf. Knowledge Discovery and Data Mining 1105\u20131114 (2016).","DOI":"10.1145\/2939672.2939751"},{"key":"465_CR24","doi-asserted-by":"crossref","unstructured":"Qiu, J., Dong, Y., Ma, H., Li, J., Wang, K. and Tang, J., Network embedding as matrix factorization: Unifying deepwalk, line, pte, and node2vec. In: Proc. 11th ACM Int. Conf. on web search and data mining (2018).","DOI":"10.1145\/3159652.3159706"},{"key":"465_CR25","doi-asserted-by":"publisher","first-page":"cnaa007","DOI":"10.1093\/comnet\/cnaa007","volume":"8","author":"L Torres","year":"2020","unstructured":"Torres, L., Chan, K. S. & Eliassi-Rad, T. GLEE: geometric Laplacian eigenmap embedding. J. Complex Netw. 8, cnaa007 (2020).","journal-title":"J. Complex Netw."},{"key":"465_CR26","doi-asserted-by":"crossref","unstructured":"Tang, L. & Liu, H. Relational learning via latent social dimensions. In Proc. 15th ACM SIGKDD Int. Conf. Knowledge Discovery and Data Mining 817\u2013826 (2009).","DOI":"10.1145\/1557019.1557109"},{"key":"465_CR27","unstructured":"Mikolov, T., Chen, K., Corrado, G. & Dean, J. Efficient estimation of word representations in vector space. In 1st Int. Conf. Learning Representations, ICLR 2013 (eds. Bengio Y. & LeCun, Y.) (2013)."},{"key":"465_CR28","doi-asserted-by":"crossref","unstructured":"Pennington, J., Socher, R. & Manning, C. D. GloVe: global vectors for word representation. In Proc. 2014 Conf. Empirical Methods in Natural Language Processing (EMNLP) 1532\u20131543 (2014).","DOI":"10.3115\/v1\/D14-1162"},{"key":"465_CR29","doi-asserted-by":"crossref","unstructured":"Grover, A. & Leskovec, J. node2vec: scalable feature learning for networks. In Proc. 22nd ACM SIGKDD Int. Conf. Knowledge Discovery and Data Mining 855\u2013864 (2016).","DOI":"10.1145\/2939672.2939754"},{"key":"465_CR30","doi-asserted-by":"crossref","unstructured":"Perozzi, B., Kulkarni, V., Chen, H. & Skiena, S. Don\u2019t walk, skip! Online learning of multi-scale network embeddings. In Proc. 2017 IEEE\/ACM Int. Conf. Advances in Social Networks Analysis and Mining 2017 258\u2013265 (2017).","DOI":"10.1145\/3110025.3110086"},{"key":"465_CR31","doi-asserted-by":"crossref","unstructured":"Tang, J., Qu, M., Wang, M., Zhang, M., Yan, J. and Mei, Q Line: Large-scale information network embedding. In Proc. 24th Int. Conf. on World Wide Web. 1067\u20131077 (2015).","DOI":"10.1145\/2736277.2741093"},{"key":"465_CR32","doi-asserted-by":"crossref","unstructured":"Zhang, D., Li, M., Jia, Y., Wang, Y. & Cheng, X. Efficient parallel translating embedding for knowledge graphs. In Proc. Int. Conf. Web Intelligence, 460\u2013468, (2017).","DOI":"10.1145\/3106426.3106447"},{"key":"465_CR33","doi-asserted-by":"crossref","unstructured":"Rozemberczki, B., Kiss, O. & Sarkar, R. Karate Club: an API oriented open-source Python framework for unsupervised learning on graphs. In Proc. 29th ACM Int. Conf. Information and Knowledge Management (CIKM \u201920) 3125\u20133132 (ACM, 2020).","DOI":"10.1145\/3340531.3412757"},{"key":"465_CR34","doi-asserted-by":"crossref","unstructured":"Davis, A.P., Grondin, C.J., Johnson, R.J., Sciaky, D., McMorran, R., Wiegers, J., Wiegers, T.C. and Mattingly, C.J. The comparative toxicogenomics database: update 2019. Nucleic Acids Research, 47, D948\u2013D954 (2019).","DOI":"10.1093\/nar\/gky868"},{"key":"465_CR35","doi-asserted-by":"publisher","unstructured":"Callahan, T. J., Tripodi, I. J., Hunter, L. E. & Baumgartner, W. A. A framework for automated construction of heterogeneous large-scale biomedical knowledge graphs. Preprint at bioRxiv https:\/\/doi.org\/10.1101\/2020.04.30.071407 (2020).","DOI":"10.1101\/2020.04.30.071407"},{"key":"465_CR36","doi-asserted-by":"crossref","unstructured":"Hagberg, A., Swart, P. & Chult, D. S. Exploring Network Structure, Dynamics, and Function Using NetworkX (Los Alamos National Lab, 2008).","DOI":"10.25080\/TCWV9851"},{"key":"465_CR37","doi-asserted-by":"crossref","unstructured":"Lam, S. K., Pitrou, A. & Seibert, S. Numba: a LLVM-based python JIT compiler. In Proc. Second Workshop on the LLVM Compiler Infrastructure in HPC 1\u20136 (2015).","DOI":"10.1145\/2833157.2833162"},{"key":"465_CR38","doi-asserted-by":"crossref","unstructured":"Szklarczyk, D., Gable, A.L., Lyon, D., Junge, A., Wyder, S., Huerta-Cepas, J., Simonovic, M., Doncheva, N.T., Morris, J.H., Bork, P. and Jensen, L.J. STRING v11: protein\u2013protein association networks with increased coverage, supporting functional discovery in genome-wide experimental datasets. Nucleic acids research, 47, D607\u2013D613 (2019).","DOI":"10.1093\/nar\/gky1131"},{"key":"465_CR39","doi-asserted-by":"crossref","unstructured":"Sun, D. L. & Fevotte, C. Alternating direction method of multipliers for non-negative matrix factorization with the beta-divergence. In 2014 IEEE Int. Conf. Acoustics, Speech and Signal Processing (ICASSP) 6201\u20136205 (IEEE, 2014).","DOI":"10.1109\/ICASSP.2014.6854796"},{"key":"465_CR40","doi-asserted-by":"crossref","unstructured":"Zhang, Z., Cui, P., Li, H., Wang, X. & Zhu, W. Billion-scale network embedding with iterative random projection. In 2018 IEEE Int. Conf. Data Mining (ICDM) 787\u2013796 (IEEE, 2018).","DOI":"10.1109\/ICDM.2018.00094"},{"key":"465_CR41","doi-asserted-by":"crossref","unstructured":"Cao, S., Lu, W. & Xu, Q. GraRep: learning graph representations with global structural information. In Proc. 24th ACM Int. Conf. Information and Knowledge Management, 891\u2013900 (2015).","DOI":"10.1145\/2806416.2806512"},{"key":"465_CR42","unstructured":"Ahmed, N.K., Rossi, R.A., Lee, J.B., Willke, T.L., Zhou, R., Kong, X. and Eldardiry, H. role2vec: Role-based network embeddings. Proc. DLG KDD, 1\u20137 (2019)"},{"key":"465_CR43","doi-asserted-by":"crossref","unstructured":"Kadlec, R., Bajgar, O. & Kleindienst, J. Knowledge base completion: baselines strike back. In Proc. 2nd Workshop on Representation Learning for NLP 69\u201374 (Association for Computational Linguistics, 2017).","DOI":"10.18653\/v1\/W17-2609"},{"key":"465_CR44","unstructured":"Errica, F., Podda, M., Bacciu, D. & Micheli, A. A fair comparison of graph neural networks for graph classification. In Proc. 8th Int. Conf. Learning Representations (ICLR) (2020)."},{"key":"465_CR45","unstructured":"Gamma, E., Helm, R., Johnson, R. & Vlissides, J. Design Patterns: Elements of Reusable Object-Oriented Software (Addison-Wesley, 1995)."},{"key":"465_CR46","unstructured":"Pedregosa, F., et al. Scikit-learn: Machine learning in Python. J. Mach. Learn. Res. 12, 2825\u20132830 (2011)."},{"key":"465_CR47","doi-asserted-by":"crossref","unstructured":"Saad, Y. Parallel iterative methods for sparse linear systems. In Studies in Computational Mathematics Vol. 8, 423\u2013440 (Elsevier, 2001).","DOI":"10.1016\/S1570-579X(01)80025-2"},{"key":"465_CR48","unstructured":"Anderson, E. et al. (eds) LAPACK Users\u2019 Guide. (Society for Industrial and Applied Mathematics, 1999)."},{"key":"465_CR49","unstructured":"Van der Maaten, L. & Hinton, G. Visualizing data using t-SNE. J. Mach. Learn. Res. 9, 2579\u20132605 (2008)."},{"key":"465_CR50","unstructured":"Welling, M. & Kipf, T. N. Semi-supervised classification with graph convolutional networks. In Int. Conf. Learning Representations (ICLR 2017) (2016)."},{"key":"465_CR51","unstructured":"Hu, W., Fey, M., Zitnik, M., Dong, Y., Ren, H., Liu, B., Catasta, M. and Leskovec, J., Open graph benchmark: Datasets for machine learning on graphs. Adv. in Neural Inform. Processing Sys. 33, 22118\u201322133 (2020)."},{"key":"465_CR52","doi-asserted-by":"publisher","unstructured":"Cappelletti, L. et al. GRAPE v.0.1.30 Zenodo https:\/\/doi.org\/10.5281\/zenodo.7926104 (accessed 14 June 2023)","DOI":"10.5281\/zenodo.7926104"},{"key":"465_CR53","doi-asserted-by":"crossref","unstructured":"Reese, J.T., et al. KGCOVID-19: A framework to produce customized knowledge graphs for COVID-19 response. Patterns, 2, 100155\u2013100166 (2021).","DOI":"10.1016\/j.patter.2020.100155"},{"key":"465_CR54","doi-asserted-by":"crossref","unstructured":"Boldi, P., Rosa, M., Santini, M. & Vigna, S. Layered label propagation: a multiresolution coordinate-free ordering for compressing social networks. In Proc. 20th Int. Conf. World Wide Web (eds. Srinivasan, S. et al.) 587\u2013596 (ACM Press, 2011).","DOI":"10.1145\/1963405.1963488"}],"container-title":["Nature Computational Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.nature.com\/articles\/s43588-023-00465-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.nature.com\/articles\/s43588-023-00465-8","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.nature.com\/articles\/s43588-023-00465-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T22:54:49Z","timestamp":1729637689000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.nature.com\/articles\/s43588-023-00465-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,26]]},"references-count":54,"journal-issue":{"issue":"6","published-online":{"date-parts":[[2023,6]]}},"alternative-id":["465"],"URL":"https:\/\/doi.org\/10.1038\/s43588-023-00465-8","relation":{"has-preprint":[{"id-type":"doi","id":"10.21203\/rs.3.rs-967145\/v1","asserted-by":"object"}]},"ISSN":["2662-8457"],"issn-type":[{"value":"2662-8457","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,6,26]]},"assertion":[{"value":"13 October 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 May 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 June 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The authors declare no competing interests.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}]}}