Graph embedding and geometric deep learning relevance to network biology and structural chemistry

Graphs are used as a model of complex relationships among data in biological science since the advent of systems biology in the early 2000. In particular, graph data analysis and graph data mining play an important role in biology interaction networks, where recent techniques of artificial intellige...

Full description

Saved in:
Bibliographic Details
Published inFrontiers in artificial intelligence Vol. 6; p. 1256352
Main Authors Lecca, Paola, Lecca, Michela
Format Journal Article
LanguageEnglish
Published Frontiers Media S.A 16.11.2023
Subjects
Online AccessGet full text
ISSN2624-8212
2624-8212
DOI10.3389/frai.2023.1256352

Cover

More Information
Summary:Graphs are used as a model of complex relationships among data in biological science since the advent of systems biology in the early 2000. In particular, graph data analysis and graph data mining play an important role in biology interaction networks, where recent techniques of artificial intelligence, usually employed in other type of networks (e.g., social, citations, and trademark networks) aim to implement various data mining tasks including classification, clustering, recommendation, anomaly detection, and link prediction. The commitment and efforts of artificial intelligence research in network biology are motivated by the fact that machine learning techniques are often prohibitively computational demanding, low parallelizable, and ultimately inapplicable, since biological network of realistic size is a large system, which is characterised by a high density of interactions and often with a non-linear dynamics and a non-Euclidean latent geometry. Currently, graph embedding emerges as the new learning paradigm that shifts the tasks of building complex models for classification, clustering, and link prediction to learning an informative representation of the graph data in a vector space so that many graph mining and learning tasks can be more easily performed by employing efficient non-iterative traditional models (e.g., a linear support vector machine for the classification task). The great potential of graph embedding is the main reason of the flourishing of studies in this area and, in particular, the artificial intelligence learning techniques. In this mini review, we give a comprehensive summary of the main graph embedding algorithms in light of the recent burgeoning interest in geometric deep learning.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
ObjectType-Review-3
content type line 23
Reviewed by: Shailesh Tripathi, University of Applied Sciences Upper Austria Steyr, Austria
Edited by: Georgios Leontidis, University of Aberdeen, United Kingdom
ISSN:2624-8212
2624-8212
DOI:10.3389/frai.2023.1256352