{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T19:07:03Z","timestamp":1776884823801,"version":"3.51.2"},"reference-count":88,"publisher":"Springer Science and Business Media LLC","issue":"11","license":[{"start":{"date-parts":[[2023,10,16]],"date-time":"2023-10-16T00:00:00Z","timestamp":1697414400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,10,16]],"date-time":"2023-10-16T00:00:00Z","timestamp":1697414400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100011730","name":"Templeton World Charity Foundation","doi-asserted-by":"publisher","award":["TWCF0333"],"award-info":[{"award-number":["TWCF0333"]}],"id":[{"id":"10.13039\/501100011730","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100011730","name":"Templeton World Charity Foundation","doi-asserted-by":"publisher","award":["TWCF0333"],"award-info":[{"award-number":["TWCF0333"]}],"id":[{"id":"10.13039\/501100011730","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100011730","name":"Templeton World Charity Foundation","doi-asserted-by":"publisher","award":["TWCF0333"],"award-info":[{"award-number":["TWCF0333"]}],"id":[{"id":"10.13039\/501100011730","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["DMS-1952339"],"award-info":[{"award-number":["DMS-1952339"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["2113468"],"award-info":[{"award-number":["2113468"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["IFML 2019844"],"award-info":[{"award-number":["IFML 2019844"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["DMS- 2113468"],"award-info":[{"award-number":["DMS- 2113468"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["NSF IFML 2019844"],"award-info":[{"award-number":["NSF IFML 2019844"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100005856","name":"NOVA | Faculdade de Ci\u00eancias e Tecnologia, Universidade Nova de Lisboa","doi-asserted-by":"publisher","award":["SFRH\/BD\/144151\/2019"],"award-info":[{"award-number":["SFRH\/BD\/144151\/2019"]}],"id":[{"id":"10.13039\/501100005856","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Nat Mach Intell"],"abstract":"<jats:title>Abstract<\/jats:title><jats:p>A tool that could suggest new personalized research directions and ideas by taking insights from the scientific literature could profoundly accelerate the progress of science. A field that might benefit from such an approach is artificial intelligence (AI) research, where the number of scientific publications has been growing exponentially over recent years, making it challenging for human researchers to keep track of the progress. Here we use AI techniques to predict the future research directions of AI itself. We introduce a graph-based benchmark based on real-world data\u2014the Science4Cast benchmark, which aims to predict the future state of an evolving semantic network of AI. For that, we use more than 143,000 research papers and build up a knowledge network with more than 64,000 concept nodes. We then present ten diverse methods to tackle this task, ranging from pure statistical to pure learning methods. Surprisingly, the most powerful methods use a carefully curated set of network features, rather than an end-to-end AI approach. These results indicate a great potential that can be unleashed for purely ML approaches without human knowledge. Ultimately, better predictions of new future research directions will be a crucial component of more advanced research suggestion tools.<\/jats:p>","DOI":"10.1038\/s42256-023-00735-0","type":"journal-article","created":{"date-parts":[[2023,10,16]],"date-time":"2023-10-16T16:02:39Z","timestamp":1697472159000},"page":"1326-1335","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":67,"title":["Forecasting the future of artificial intelligence with machine learning-based link prediction in an exponentially growing knowledge network"],"prefix":"10.1038","volume":"5","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1620-9207","authenticated-orcid":false,"given":"Mario","family":"Krenn","sequence":"first","affiliation":[]},{"given":"Lorenzo","family":"Buffoni","sequence":"additional","affiliation":[]},{"given":"Bruno","family":"Coutinho","sequence":"additional","affiliation":[]},{"given":"Sagi","family":"Eppel","sequence":"additional","affiliation":[]},{"given":"Jacob Gates","family":"Foster","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8138-8796","authenticated-orcid":false,"given":"Andrew","family":"Gritsevskiy","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6128-9942","authenticated-orcid":false,"given":"Harlin","family":"Lee","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0001-2005-1724","authenticated-orcid":false,"given":"Yichao","family":"Lu","sequence":"additional","affiliation":[]},{"given":"Jo\u00e3o P.","family":"Moutinho","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0000-6342-5231","authenticated-orcid":false,"given":"Nima","family":"Sanjabi","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0928-392X","authenticated-orcid":false,"given":"Rishi","family":"Sonthalia","sequence":"additional","affiliation":[]},{"given":"Ngoc Mai","family":"Tran","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6964-9391","authenticated-orcid":false,"given":"Francisco","family":"Valente","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1532-6746","authenticated-orcid":false,"given":"Yangxinyu","family":"Xie","sequence":"additional","affiliation":[]},{"given":"Rose","family":"Yu","sequence":"additional","affiliation":[]},{"given":"Michael","family":"Kopp","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,10,16]]},"reference":[{"key":"735_CR1","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1126\/science.aal4217","volume":"355","author":"A Clauset","year":"2017","unstructured":"Clauset, A., Larremore, D. B. & Sinatra, R. Data-driven predictions in the science of science. Science 355, 477\u2013480 (2017).","journal-title":"Science"},{"key":"735_CR2","doi-asserted-by":"publisher","first-page":"721","DOI":"10.1126\/science.1201765","volume":"331","author":"JA Evans","year":"2011","unstructured":"Evans, J. A. & Foster, J. G. Metaknowledge. Science 331, 721\u2013725 (2011).","journal-title":"Science"},{"key":"735_CR3","doi-asserted-by":"publisher","first-page":"eaao0185","DOI":"10.1126\/science.aao0185","volume":"359","author":"S Fortunato","year":"2018","unstructured":"Fortunato, S. et al. Science of science. Science 359, eaao0185 (2018).","journal-title":"Science"},{"key":"735_CR4","doi-asserted-by":"crossref","unstructured":"Wang, D. & Barab\u00e1si, A.-L.The Science of Science (Cambridge Univ. Press, 2021).","DOI":"10.1017\/9781108610834"},{"key":"735_CR5","unstructured":"Krenn, M. et al. FutureOfAIviaAI. GitHub https:\/\/github.com\/artificial-scientist-lab\/FutureOfAIviaAI (2023)."},{"key":"735_CR6","first-page":"1877","volume":"33","author":"T Brown","year":"2020","unstructured":"Brown, T. et al. Language models are few-shot learners. Adv. Neural Inf. Process. Syst. 33, 1877\u20131901 (2020).","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"735_CR7","unstructured":"Rae, J. W. et al. Scaling language models: methods, analysis & insights from training gopher. Preprint at https:\/\/arxiv.org\/abs\/2112.11446 (2021)."},{"key":"735_CR8","unstructured":"Smith, S. et al. Using DeepSpeed and Megatron to train Megatron-Turing NLG 530B, a large-scale generative language model. Preprint at https:\/\/arxiv.org\/abs\/2201.11990 (2022)."},{"key":"735_CR9","unstructured":"Chowdhery, A. et al. Palm: scaling language modeling with pathways. Preprint at https:\/\/arxiv.org\/abs\/2204.02311 (2022)."},{"key":"735_CR10","unstructured":"Kojima, T., Gu, S. S., Reid, M., Matsuo, Y. & Iwasawa, Y. Large language models are zero-shot reasoners. Preprint at https:\/\/arxiv.org\/abs\/2205.11916 (2022)."},{"key":"735_CR11","doi-asserted-by":"crossref","unstructured":"Zhang, H., Li, L. H., Meng, T., Chang, K.-W. & Broeck, G. V. d. On the paradox of learning to reason from data. Preprint at https:\/\/arxiv.org\/abs\/2205.11502 (2022).","DOI":"10.24963\/ijcai.2023\/375"},{"key":"735_CR12","doi-asserted-by":"publisher","first-page":"14569","DOI":"10.1073\/pnas.1509757112","volume":"112","author":"A Rzhetsky","year":"2015","unstructured":"Rzhetsky, A., Foster, J. G., Foster, I. T. & Evans, J. A. Choosing experiments to accelerate collective discovery. Proc. Natl Acad. Sci. USA 112, 14569\u201314574 (2015).","journal-title":"Proc. Natl Acad. Sci. USA"},{"key":"735_CR13","doi-asserted-by":"publisher","first-page":"875","DOI":"10.1177\/0003122415601618","volume":"80","author":"JG Foster","year":"2015","unstructured":"Foster, J. G., Rzhetsky, A. & Evans, J. A. Tradition and innovation in scientists\u2019 research strategies. Am. Sociol. Rev. 80, 875\u2013908 (2015).","journal-title":"Am. Sociol. Rev."},{"key":"735_CR14","unstructured":"Van Eck, N. J. & Waltman, L. Text mining and visualization using vosviewer. Preprint at https:\/\/arxiv.org\/abs\/1109.2058 (2011)."},{"key":"735_CR15","doi-asserted-by":"crossref","unstructured":"Van Eck, N. J. & Waltman, L. in Measuring Scholarly Impact: Methods and Practice (eds Ding, Y. et al.) 285\u2013320 (Springer, 2014).","DOI":"10.1007\/978-3-319-10377-8_13"},{"key":"735_CR16","doi-asserted-by":"crossref","unstructured":"Wang, Q. et al. Paperrobot: Incremental draft generation of scientific ideas. Preprint at https:\/\/arxiv.org\/abs\/1905.07870 (2019).","DOI":"10.18653\/v1\/P19-1191"},{"key":"735_CR17","doi-asserted-by":"publisher","first-page":"1910","DOI":"10.1073\/pnas.1914370116","volume":"117","author":"M Krenn","year":"2020","unstructured":"Krenn, M. & Zeilinger, A. Predicting research trends with semantic and neural networks with an application in quantum physics. Proc. Natl Acad. Sci. USA 117, 1910\u20131916 (2020).","journal-title":"Proc. Natl Acad. Sci. USA"},{"key":"735_CR18","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. Inf. Sci. Technol. 58, 1019\u20131031 (2007).","journal-title":"J. Am. Soc. Inf. Sci. Technol."},{"key":"735_CR19","doi-asserted-by":"publisher","first-page":"3346","DOI":"10.1093\/bioinformatics\/bth402","volume":"20","author":"I Albert","year":"2004","unstructured":"Albert, I. & Albert, R. Conserved network motifs allow protein\u2013protein interaction prediction. Bioinformatics 20, 3346\u20133352 (2004).","journal-title":"Bioinformatics"},{"key":"735_CR20","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1140\/epjb\/e2009-00335-8","volume":"71","author":"T Zhou","year":"2009","unstructured":"Zhou, T., L\u00fc, L. & Zhang, Y.-C. Predicting missing links via local information. Eur. Phys. J. B 71, 623\u2013630 (2009).","journal-title":"Eur. Phys. J. B"},{"key":"735_CR21","doi-asserted-by":"publisher","first-page":"1240","DOI":"10.1038\/s41467-019-09177-y","volume":"10","author":"IA Kov\u00e1cs","year":"2019","unstructured":"Kov\u00e1cs, I. A. et al. Network-based prediction of protein interactions. Nat. Commun. 10, 1240 (2019).","journal-title":"Nat. Commun."},{"key":"735_CR22","doi-asserted-by":"publisher","unstructured":"Muscoloni, A., Abdelhamid, I. & Cannistraci, C. V. Local-community network automata modelling based on length-three-paths for prediction of complex network structures in protein interactomes, food webs and more. Preprint at bioRxiv https:\/\/doi.org\/10.1101\/346916 (2018).","DOI":"10.1101\/346916"},{"key":"735_CR23","doi-asserted-by":"publisher","first-page":"121319","DOI":"10.1016\/j.physa.2019.121319","volume":"528","author":"R Pech","year":"2019","unstructured":"Pech, R., Hao, D., Lee, Y.-L., Yuan, Y. & Zhou, T. Link prediction via linear optimization. Physica A 528, 121319 (2019).","journal-title":"Physica A"},{"key":"735_CR24","doi-asserted-by":"publisher","first-page":"2325","DOI":"10.1073\/pnas.1424644112","volume":"112","author":"L L\u00fc","year":"2015","unstructured":"L\u00fc, L., Pan, L., Zhou, T., Zhang, Y.-C. & Stanley, H. E. Toward link predictability of complex networks. Proc. Natl Acad. Sci. USA 112, 2325\u20132330 (2015).","journal-title":"Proc. Natl Acad. Sci. USA"},{"key":"735_CR25","doi-asserted-by":"publisher","first-page":"22073","DOI":"10.1073\/pnas.0908366106","volume":"106","author":"R Guimer\u00e0","year":"2009","unstructured":"Guimer\u00e0, R. & Sales-Pardo, M. Missing and spurious interactions and the reconstruction of complex networks. Proc. Natl Acad. Sci. USA 106, 22073\u201322078 (2009).","journal-title":"Proc. Natl Acad. Sci. USA"},{"key":"735_CR26","doi-asserted-by":"publisher","first-page":"23393","DOI":"10.1073\/pnas.1914950117","volume":"117","author":"A Ghasemian","year":"2020","unstructured":"Ghasemian, A., Hosseinmardi, H., Galstyan, A., Airoldi, E. M. & Clauset, A. Stacking models for nearly optimal link prediction in complex networks. Proc. Natl Acad. Sci. USA 117, 23393\u201323400 (2020).","journal-title":"Proc. Natl Acad. Sci. USA"},{"key":"735_CR27","doi-asserted-by":"publisher","first-page":"103217","DOI":"10.1016\/j.isci.2021.103217","volume":"24","author":"T Zhou","year":"2021","unstructured":"Zhou, T. Progresses and challenges in link prediction. iScience 24, 103217 (2021).","journal-title":"iScience"},{"key":"735_CR28","doi-asserted-by":"publisher","first-page":"761","DOI":"10.1038\/s42254-022-00518-3","volume":"4","author":"M Krenn","year":"2022","unstructured":"Krenn, M. et al. On scientific understanding with artificial intelligence. Nat. Rev. Phys. 4, 761\u2013769 (2022).","journal-title":"Nat. Rev. Phys."},{"key":"735_CR29","doi-asserted-by":"crossref","unstructured":"Rose, S., Engel, D., Cramer, N. & Cowley, W. in Text Mining: Applications and Theory (eds Berry, M. W. & Kogan, J.) Ch. 1 (Wiley, 2010).","DOI":"10.1002\/9780470689646.ch1"},{"key":"735_CR30","doi-asserted-by":"crossref","unstructured":"Salatino, A. A., Thanapalasingam, T., Mannocci, A., Osborne, F. & Motta, E. The computer science ontology: a large-scale taxonomy of research areas. In Proc. Semantic Web\u2013ISWC 2018: 17th International Semantic Web Conference Part II Vol. 17, 187\u2013205 (Springer, 2018).","DOI":"10.1007\/978-3-030-00668-6_12"},{"key":"735_CR31","doi-asserted-by":"crossref","unstructured":"Salatino, A. A., Osborne, F., Thanapalasingam, T. & Motta, E. The CSO classifier: ontology-driven detection of research topics in scholarly articles. In Proc. Digital Libraries for Open Knowledge: 23rd International Conference on Theory and Practice of Digital Libraries Vol. 23, 296\u2013311 (Springer, 2019).","DOI":"10.1007\/978-3-030-30760-8_26"},{"key":"735_CR32","doi-asserted-by":"publisher","first-page":"e85777","DOI":"10.1371\/journal.pone.0085777","volume":"9","author":"J Alstott","year":"2014","unstructured":"Alstott, J., Bullmore, E. & Plenz, D. powerlaw: a Python package for analysis of heavy-tailed distributions. PLoS ONE 9, e85777 (2014).","journal-title":"PLoS ONE"},{"key":"735_CR33","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1016\/j.socnet.2005.12.003","volume":"29","author":"T Fenner","year":"2007","unstructured":"Fenner, T., Levene, M. & Loizou, G. A model for collaboration networks giving rise to a power-law distribution with an exponential cutoff. Soc. Netw. 29, 70\u201380 (2007).","journal-title":"Soc. Netw."},{"key":"735_CR34","doi-asserted-by":"publisher","first-page":"1017","DOI":"10.1038\/s41467-019-08746-5","volume":"10","author":"AD Broido","year":"2019","unstructured":"Broido, A. D. & Clauset, A. Scale-free networks are rare. Nat. Commun. 10, 1017 (2019).","journal-title":"Nat. Commun."},{"key":"735_CR35","first-page":"1","volume":"31","author":"T Fawcett","year":"2004","unstructured":"Fawcett, T. ROC graphs: notes and practical considerations for researchers. Pattern Recognit. Lett. 31, 1\u201338 (2004).","journal-title":"Pattern Recognit. Lett."},{"key":"735_CR36","doi-asserted-by":"publisher","first-page":"687","DOI":"10.1142\/S0218001409007326","volume":"23","author":"Y Sun","year":"2009","unstructured":"Sun, Y., Wong, A. K. & Kamel, M. S. Classification of imbalanced data: a review. Int. J. Pattern Recognit. Artif. Intell. 23, 687\u2013719 (2009).","journal-title":"Int. J. Pattern Recognit. Artif. Intell."},{"key":"735_CR37","doi-asserted-by":"crossref","unstructured":"Lu, Y. Predicting research trends in artificial intelligence with gradient boosting decision trees and time-aware graph neural networks. In 2021 IEEE International Conference on Big Data (Big Data) 5809\u20135814 (IEEE, 2021).","DOI":"10.1109\/BigData52589.2021.9671505"},{"key":"735_CR38","unstructured":"Ke, G. et al. LightGBM: a highly efficient gradient boosting decision tree. In Proc. 31st International Conference on Neural Information Processing Systems 3149\u20133157 (Curran Associates Inc., 2017)."},{"key":"735_CR39","doi-asserted-by":"crossref","unstructured":"Tran, N. M. & Xie, Y. Improving random walk rankings with feature selection and imputation Science4Cast competition, team Hash Brown. In 2021 IEEE International Conference on Big Data (Big Data) 5824\u20135827 (IEEE, 2021).","DOI":"10.1109\/BigData52589.2021.9671785"},{"key":"735_CR40","doi-asserted-by":"crossref","unstructured":"Sanjabi, N. Efficiently predicting scientific trends using node centrality measures of a science semantic network. In 2021 IEEE International Conference on Big Data (Big Data) 5820\u20135823 (IEEE, 2021).","DOI":"10.1109\/BigData52589.2021.9671671"},{"key":"735_CR41","doi-asserted-by":"publisher","first-page":"20120375","DOI":"10.1098\/rsta.2012.0375","volume":"371","author":"A-L Barab\u00e1si","year":"2013","unstructured":"Barab\u00e1si, A.-L. Network science. Phil. Trans. R. Soci. A 371, 20120375 (2013).","journal-title":"Phil. Trans. R. Soci. A"},{"key":"735_CR42","doi-asserted-by":"crossref","unstructured":"Moutinho, J. P., Coutinho, B. & Buffoni, L. Network-based link prediction of scientific concepts\u2014a Science4Cast competition entry. In 2021 IEEE International Conference on Big Data (Big Data) 5815\u20135819 (IEEE, 2021).","DOI":"10.1109\/BigData52589.2021.9671582"},{"key":"735_CR43","doi-asserted-by":"publisher","first-page":"20150202","DOI":"10.1098\/rsta.2015.0202","volume":"374","author":"IT Jolliffe","year":"2016","unstructured":"Jolliffe, I. T. & Cadima, J. Principal component analysis: a review and recent developments. Phil. Trans. R. Soc. A 374, 20150202 (2016).","journal-title":"Phil. Trans. R. Soc. A"},{"key":"735_CR44","doi-asserted-by":"crossref","unstructured":"Valente, F. Link prediction of artificial intelligence concepts using low computational power. In 2021 IEEE International Conference on Big Data (Big Data) 5828\u20135832 (2021).","DOI":"10.1109\/BigData52589.2021.9671719"},{"key":"735_CR45","doi-asserted-by":"crossref","unstructured":"Grover, A. & Leskovec, J. node2vec: scalable feature learning for networks. In Proc. 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining 855\u2013864 (ACM, 2016).","DOI":"10.1145\/2939672.2939754"},{"key":"735_CR46","doi-asserted-by":"crossref","unstructured":"Zhang, J., Dong, Y., Wang, Y., Tang, J. & Ding, M. ProNE: fast and scalable network representation learning. In Proc. Twenty-Eighth International Joint Conference on Artificial Intelligence 4278\u20134284 (International Joint Conferences on Artificial Intelligence Organization, 2019).","DOI":"10.24963\/ijcai.2019\/594"},{"key":"735_CR47","doi-asserted-by":"crossref","unstructured":"Lee, H., Sonthalia, R. & Foster, J. G. Dynamic embedding-based methods for link prediction in machine learning semantic network. In 2021 IEEE International Conference on Big Data (Big Data) 5801\u20135808 (IEEE, 2021).","DOI":"10.1109\/BigData52589.2021.9672040"},{"key":"735_CR48","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":"735_CR49","unstructured":"Vaswani, A. et al. Attention is all you need. In Proc. 31st International Conference on Neural Information Processing Systems 6000\u20136010 (Curran Associates Inc., 2017)."},{"key":"735_CR50","first-page":"1083","volume":"3","author":"D Zelenko","year":"2003","unstructured":"Zelenko, D., Aone, C. & Richardella, A. Kernel methods for relation extraction. J. Mach. Learn. Res. 3, 1083\u20131106 (2003).","journal-title":"J. Mach. Learn. Res."},{"key":"735_CR51","first-page":"1","volume":"2","author":"N Bach","year":"2007","unstructured":"Bach, N. & Badaskar, S. A review of relation extraction. Literature Review for Language and Statistics II 2, 1\u201315 (2007).","journal-title":"Literature Review for Language and Statistics II"},{"key":"735_CR52","doi-asserted-by":"publisher","first-page":"e119","DOI":"10.7717\/peerj-cs.119","volume":"3","author":"AA Salatino","year":"2017","unstructured":"Salatino, A. A., Osborne, F. & Motta, E. How are topics born? Understanding the research dynamics preceding the emergence of new areas. PeerJ Comput. Sc. 3, e119 (2017).","journal-title":"PeerJ Comput. Sc."},{"key":"735_CR53","doi-asserted-by":"crossref","unstructured":"Salatino, A. A., Osborne, F. & Motta, E. AUGUR: forecasting the emergence of new research topics. In Proc. 18th ACM\/IEEE on Joint Conference on Digital Libraries 303\u2013312 (IEEE, 2018).","DOI":"10.1145\/3197026.3197052"},{"key":"735_CR54","doi-asserted-by":"publisher","first-page":"1093","DOI":"10.1038\/s41567-021-01371-4","volume":"17","author":"F Battiston","year":"2021","unstructured":"Battiston, F. et al. The physics of higher-order interactions in complex systems. Nat. Phys. 17, 1093\u20131098 (2021).","journal-title":"Nat. Phys."},{"key":"735_CR55","doi-asserted-by":"publisher","first-page":"248301","DOI":"10.1103\/PhysRevLett.124.248301","volume":"124","author":"BC Coutinho","year":"2020","unstructured":"Coutinho, B. C., Wu, A.-K., Zhou, H.-J. & Liu, Y.-Y. Covering problems and core percolations on hypergraphs. Phys. Rev. Lett. 124, 248301 (2020).","journal-title":"Phys. Rev. Lett."},{"key":"735_CR56","doi-asserted-by":"publisher","first-page":"041317","DOI":"10.1063\/5.0021106","volume":"7","author":"EA Olivetti","year":"2020","unstructured":"Olivetti, E. A. et al. Data-driven materials research enabled by natural language processing and information extraction. Appl. Phys. Rev. 7, 041317 (2020).","journal-title":"Appl. Phys. Rev."},{"key":"735_CR57","doi-asserted-by":"publisher","DOI":"10.1038\/s41597-023-02198-9","volume":"10","author":"Z Lin","year":"2023","unstructured":"Lin, Z., Yin, Y., Liu, L. & Wang, D. SciSciNet: a large-scale open data lake for the science of science research. Sci. Data 10, 315 (2023).","journal-title":"Sci. Data"},{"key":"735_CR58","doi-asserted-by":"publisher","first-page":"1194","DOI":"10.1126\/science.aav2484","volume":"361","author":"P Azoulay","year":"2018","unstructured":"Azoulay, P. et al. Toward a more scientific science. Science 361, 1194\u20131197 (2018).","journal-title":"Science"},{"key":"735_CR59","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s13638-019-1561-7","volume":"2019","author":"H Liu","year":"2019","unstructured":"Liu, H., Kou, H., Yan, C. & Qi, L. Link prediction in paper citation network to construct paper correlation graph. EURASIP J. Wirel. Commun. Netw. 2019, 1\u201312 (2019).","journal-title":"EURASIP J. Wirel. Commun. Netw."},{"key":"735_CR60","doi-asserted-by":"publisher","first-page":"053041","DOI":"10.1088\/1367-2630\/ac6ca1","volume":"24","author":"N Reisz","year":"2022","unstructured":"Reisz, N. et al. Loss of sustainability in scientific work. New J. Phys. 24, 053041 (2022).","journal-title":"New J. Phys."},{"key":"735_CR61","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1038\/s42256-019-0024-5","volume":"1","author":"MR Frank","year":"2019","unstructured":"Frank, M. R., Wang, D., Cebrian, M. & Rahwan, I. The evolution of citation graphs in artificial intelligence research. Nat. Mach. Intell. 1, 79\u201385 (2019).","journal-title":"Nat. Mach. Intell."},{"key":"735_CR62","doi-asserted-by":"crossref","unstructured":"Newman, M. Networks (Oxford Univ. Press, 2018).","DOI":"10.1093\/oso\/9780198805090.001.0001"},{"key":"735_CR63","doi-asserted-by":"publisher","first-page":"949","DOI":"10.1007\/s10586-017-1117-8","volume":"22","author":"D Kwon","year":"2019","unstructured":"Kwon, D. et al. A survey of deep learning-based network anomaly detection. Cluster Comput. 22, 949\u2013961 (2019).","journal-title":"Cluster Comput."},{"key":"735_CR64","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3439950","volume":"54","author":"G Pang","year":"2021","unstructured":"Pang, G., Shen, C., Cao, L. & Hengel, A. V. D. Deep learning for anomaly detection: a review. ACM Comput. Surv. 54, 1\u201338 (2021).","journal-title":"ACM Comput. Surv."},{"key":"735_CR65","first-page":"2493","volume":"12","author":"R Collobert","year":"2011","unstructured":"Collobert, R. et al. Natural language processing (almost) from scratch. J. Mach. Learn. Res. 12, 2493\u20132537 (2011).","journal-title":"J. Mach. Learn. Res."},{"key":"735_CR66","doi-asserted-by":"publisher","first-page":"436","DOI":"10.1038\/nature14539","volume":"521","author":"Y LeCun","year":"2015","unstructured":"LeCun, Y., Bengio, Y. & Hinton, G. Deep learning. Nature 521, 436\u2013444 (2015).","journal-title":"Nature"},{"key":"735_CR67","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1145\/3065386","volume":"60","author":"A Krizhevsky","year":"2017","unstructured":"Krizhevsky, A., Sutskever, I. & Hinton, G. E. ImageNet classification with deep convolutional neural networks. Commun. ACM 60, 84\u201390 (2017).","journal-title":"Commun. ACM"},{"key":"735_CR68","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1038\/nature14236","volume":"518","author":"V Mnih","year":"2015","unstructured":"Mnih, V. et al. Human-level control through deep reinforcement learning. Nature 518, 529\u2013533 (2015).","journal-title":"Nature"},{"key":"735_CR69","doi-asserted-by":"publisher","first-page":"484","DOI":"10.1038\/nature16961","volume":"529","author":"D Silver","year":"2016","unstructured":"Silver, D. et al. Mastering the game of Go with deep neural networks and tree search. Nature 529, 484\u2013489 (2016).","journal-title":"Nature"},{"key":"735_CR70","unstructured":"Wu, N., Vincent, A., Strukov, D. & Xie, Y. Memristor hardware-friendly reinforcement learning. Preprint at https:\/\/arxiv.org\/abs\/2001.06930 (2020)."},{"key":"735_CR71","unstructured":"Zhou, C. et al. Automated deep learning analysis of angiography video sequences for coronary artery disease. Preprint at https:\/\/arxiv.org\/abs\/2101.12505 (2021)."},{"key":"735_CR72","doi-asserted-by":"crossref","unstructured":"Huckle, N., Garcia, N. & Nakashima, Y. Demographic influences on contemporary art with unsupervised style embeddings. In Proc. Computer Vision\u2013ECCV 2020 Workshops Part II Vol. 16, 126\u2013142 (Springer, 2020).","DOI":"10.1007\/978-3-030-66096-3_10"},{"key":"735_CR73","unstructured":"Ranti, D. et al. The utility of general domain transfer learning for medical language tasks. Preprint at https:\/\/arxiv.org\/abs\/2002.06670 (2020)."},{"key":"735_CR74","unstructured":"Kamath, P., Singh, A. & Dutta, D. Fast neural architecture construction using envelopenets. Preprint at https:\/\/arxiv.org\/abs\/1803.06744 (2018)."},{"key":"735_CR75","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1109\/JRPROC.1961.287775","volume":"49","author":"M Minsky","year":"1961","unstructured":"Minsky, M. Steps toward artificial intelligence. Proc. IRE 49, 8\u201330 (1961).","journal-title":"Proc. IRE"},{"key":"735_CR76","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1057\/s41599-021-00903-w","volume":"8","author":"L Bornmann","year":"2021","unstructured":"Bornmann, L., Haunschild, R. & Mutz, R. Growth rates of modern science: a latent piecewise growth curve approach to model publication numbers from established and new literature databases. Humanit. Soc. Sci. Commun. 8, 224 (2021).","journal-title":"Humanit. Soc. Sci. Commun."},{"key":"735_CR77","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/S0169-7552(98)00110-X","volume":"30","author":"S Brin","year":"1998","unstructured":"Brin, S. & Page, L. The anatomy of a large-scale hypertextual web search engine. Comput. Netw. ISDN Syst. 30, 107\u2013117 (1998).","journal-title":"Comput. Netw. ISDN Syst."},{"key":"735_CR78","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1177\/104649647100200201","volume":"2","author":"PW Holland","year":"1971","unstructured":"Holland, P. W. & Leinhardt, S. Transitivity in structural models of small groups. Comp. Group Studies 2, 107\u2013124 (1971).","journal-title":"Comp. Group Studies"},{"key":"735_CR79","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1038\/30918","volume":"393","author":"DJ Watts","year":"1998","unstructured":"Watts, D. J. & Strogatz, S. H. Collective dynamics of \u2018small-world\u2019 networks. Nature 393, 440\u2013442 (1998).","journal-title":"Nature"},{"key":"735_CR80","doi-asserted-by":"crossref","unstructured":"Yang, J.-H., Chen, C.-M., Wang, C.-J. & Tsai, M.-F. HOP-rec: high-order proximity for implicit recommendation. In Proc. 12th ACM Conference on Recommender Systems 140\u2013144 (2018).","DOI":"10.1145\/3240323.3240381"},{"key":"735_CR81","unstructured":"Lin, B.-Y. OGB_collab_project. GitHub https:\/\/github.com\/brucenccu\/OGB_collab_project (2021)."},{"key":"735_CR82","first-page":"1","volume":"5","author":"TA Sorensen","year":"1948","unstructured":"Sorensen, T. A. A method of establishing groups of equal amplitude in plant sociology based on similarity of species content and its application to analyses of the vegetation on danish commons. Biol. Skar. 5, 1\u201334 (1948).","journal-title":"Biol. Skar."},{"key":"735_CR83","doi-asserted-by":"publisher","first-page":"954","DOI":"10.1093\/biomet\/87.4.954","volume":"87","author":"I-K Yeo","year":"2000","unstructured":"Yeo, I.-K. & Johnson, R. A. A new family of power transformations to improve normality or symmetry. Biometrika 87, 954\u2013959 (2000).","journal-title":"Biometrika"},{"key":"735_CR84","unstructured":"Ranger, M. nodevectors. GitHub https:\/\/github.com\/VHRanger\/nodevectors (2021)."},{"key":"735_CR85","doi-asserted-by":"publisher","first-page":"1611","DOI":"10.1137\/120875338","volume":"34","author":"AS Bandeira","year":"2013","unstructured":"Bandeira, A. S., Singer, A. & Spielman, D. A. A Cheeger inequality for the graph connection Laplacian. SIAM J. Matrix Anal. Appl. 34, 1611\u20131630 (2013).","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"735_CR86","doi-asserted-by":"publisher","unstructured":"Krenn, M. et al. Predicting the future of AI with AI. Zenodo https:\/\/doi.org\/10.5281\/zenodo.7882892 (2023).","DOI":"10.5281\/zenodo.7882892"},{"key":"735_CR87","unstructured":"Krenn, M. et al. FutureOfAIviaAI code. Zenodo https:\/\/zenodo.org\/record\/8329701 (2023)."},{"key":"735_CR88","doi-asserted-by":"publisher","first-page":"0078","DOI":"10.1038\/s41562-017-0078","volume":"1","author":"T Jia","year":"2017","unstructured":"Jia, T., Wang, D. & Szymanski, B. K. Quantifying patterns of research-interest evolution. Nat. Hum. Behav. 1, 0078 (2017).","journal-title":"Nat. Hum. Behav."}],"container-title":["Nature Machine Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.nature.com\/articles\/s42256-023-00735-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.nature.com\/articles\/s42256-023-00735-0","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.nature.com\/articles\/s42256-023-00735-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,19]],"date-time":"2023-11-19T22:17:52Z","timestamp":1700432272000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.nature.com\/articles\/s42256-023-00735-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,10,16]]},"references-count":88,"journal-issue":{"issue":"11","published-online":{"date-parts":[[2023,11]]}},"alternative-id":["735"],"URL":"https:\/\/doi.org\/10.1038\/s42256-023-00735-0","relation":{},"ISSN":["2522-5839"],"issn-type":[{"value":"2522-5839","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,10,16]]},"assertion":[{"value":"21 January 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 September 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 October 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"}}]}}