Computer Science · MapleScholar Plus

Thinking in Webs: How a 2005 Paper Taught AI to Design Medicines and Map the World

Early neural networks were blind to complex real-world relationships because they could only process flat grids of pixels and linear lines of text; Graph Neural Networks allow AI to navigate interconnected networks of molecules, social circles, and traffic maps. Ignored for over a decade during the computer vision boom, this 2005 architecture is now the computational engine behind AI drug discovery and AlphaFold.

Author
Marco Gori et al.
Published
2006
Journal
Proceedings. 2005 IEEE International Joint Conference on Neural Networks, 2005.
Last updated
September 2026
Thinking in Webs: How a 2005 Paper Taught AI to Design Medicines and Map the World

In early deep learning, computers were brilliant at analyzing flat photo grids and sentences of text, but completely helpless when trying to understand the real world. Complex systems like human social networks, electrical power grids, and chemical molecules do not fit onto flat grids.

Italian researchers invented a way to teach AI to think in webs and networks: Graph Neural Networks. By allowing connected nodes in a web to pass information back and forth like neighbors whispering over a garden fence, the AI learns how individual parts influence the whole system.

Dormant until computational chemistry boomed, GNNs revolutionized modern science. By discovering new life-saving antibiotic drugs, by predicting how complex proteins fold in 3D biology, and by routing global shipping logistics, graph neural networks model the interconnected universe.

Reference

Gori, M., Monfardini, G., & Scarselli, F. A new model for learning in graph domains. Proceedings. 2005 IEEE International Joint Conference on Neural Networks, 2005., 2, 729–734.

Title

A new model for learning in graph domains

Abstract

In several applications the information is naturally represented by graphs. Traditional approaches cope with graphical data structures using a preprocessing phase which transforms the graphs into a set of flat vectors. However, in this way, important topological information may be lost and the achieved results may heavily depend on the preprocessing stage. This paper presents a new neural model, called graph neural network (GNN), capable of directly processing graphs. GNNs extends recursive neural networks and can be applied on most of the practically useful kinds of graphs, including directed, undirected, labelled and cyclic graphs. A learning algorithm for GNNs is proposed and some experiments are discussed which assess the properties of the model.

Cited 1,926 times · View on doi.org

Continue

Continue Exploring

Ask this paper your own questions, or keep browsing the verified research catalogue.