生物医学网络是与疾病网络的蛋白质相互作用的普遍描述符，从蛋白质相互作用，一直到医疗保健系统和科学知识。随着代表学习提供强大的预测和洞察的显着成功，我们目睹了表现形式学习技术的快速扩展，进入了这些网络的建模，分析和学习。在这篇综述中，我们提出了一个观察到生物学和医学中的网络长期原则 - 而在机器学习研究中经常出口 - 可以为代表学习提供概念基础，解释其当前的成功和限制，并告知未来进步。我们综合了一系列算法方法，即在其核心利用图形拓扑到将网络嵌入到紧凑的向量空间中，并捕获表示陈述学习证明有用的方式的广度。深远的影响包括鉴定复杂性状的变异性，单细胞的异心行为及其对健康的影响，协助患者的诊断和治疗以及制定安全有效的药物。

以图形为中心的人工智能（Graph AI）在建模自然界中普遍存在的相互作用系统（从生物学的动态系统到粒子物理学）方面取得了显着成功。数据的异质性的增加，需要对可以结合多种电感偏见的图形神经体系结构。但是，将来自各种来源的数据组合起来是具有挑战性的，因为适当的归纳偏差可能会因数据模式而异。多模式学习方法融合了多个数据模式，同时利用跨模式依赖性来应对这一挑战。在这里，我们调查了以图形为中心的AI的140项研究，并意识到，使用图越来越多地将各种数据类型汇集在一起​​，并将其馈入复杂的多模型模型。这些模型分为图像，语言和知识接地的多模式学习。我们提出了基于此分类的多模式图学习的算法蓝图。该蓝图是通过选择适当的四个不同组件来处理多模式数据的最先进架构的方法。这项工作可以为标准化精致的多模式体系结构的设计铺平道路，以解决高度复杂的现实世界问题。

Machine learning on graphs is an important and ubiquitous task with applications ranging from drug design to friendship recommendation in social networks. The primary challenge in this domain is finding a way to represent, or encode, graph structure so that it can be easily exploited by machine learning models. Traditionally, machine learning approaches relied on user-defined heuristics to extract features encoding structural information about a graph (e.g., degree statistics or kernel functions). However, recent years have seen a surge in approaches that automatically learn to encode graph structure into low-dimensional embeddings, using techniques based on deep learning and nonlinear dimensionality reduction. Here we provide a conceptual review of key advancements in this area of representation learning on graphs, including matrix factorization-based methods, random-walk based algorithms, and graph neural networks. We review methods to embed individual nodes as well as approaches to embed entire (sub)graphs. In doing so, we develop a unified framework to describe these recent approaches, and we highlight a number of important applications and directions for future work.

在本文中，我们提供了针对深度学习（DL）模型的结构化文献分析，该模型用于支持癌症生物学的推论，并特别强调了多词分析。这项工作着重于现有模型如何通过先验知识，生物学合理性和解释性，生物医学领域的基本特性来解决更好的对话。我们讨论了DL模型的最新进化拱门沿整合先前的生物关系和网络知识的方向，以支持更好的概括（例如途径或蛋白质 - 蛋白质相互作用网络）和解释性。这代表了向模型的基本功能转变，该模型可以整合机械和统计推断方面。我们讨论了在此类模型中整合域先验知识的代表性方法。该论文还为解释性和解释性的当代方法提供了关键的看法。该分析指向编码先验知识和改善解释性之间的融合方向。

Pre-publication draft of a book to be published byMorgan & Claypool publishers. Unedited version released with permission. All relevant copyrights held by the author and publisher extend to this pre-publication draft.

Deep learning has revolutionized many machine learning tasks in recent years, ranging from image classification and video processing to speech recognition and natural language understanding. The data in these tasks are typically represented in the Euclidean space. However, there is an increasing number of applications where data are generated from non-Euclidean domains and are represented as graphs with complex relationships and interdependency between objects. The complexity of graph data has imposed significant challenges on existing machine learning algorithms. Recently, many studies on extending deep learning approaches for graph data have emerged. In this survey, we provide a comprehensive overview of graph neural networks (GNNs) in data mining and machine learning fields. We propose a new taxonomy to divide the state-of-the-art graph neural networks into four categories, namely recurrent graph neural networks, convolutional graph neural networks, graph autoencoders, and spatial-temporal graph neural networks. We further discuss the applications of graph neural networks across various domains and summarize the open source codes, benchmark data sets, and model evaluation of graph neural networks. Finally, we propose potential research directions in this rapidly growing field.

人工智能（AI）在过去十年中一直在改变药物发现的实践。各种AI技术已在广泛的应用中使用，例如虚拟筛选和药物设计。在本调查中，我们首先概述了药物发现，并讨论了相关的应用，可以减少到两个主要任务，即分子性质预测和分子产生。然后，我们讨论常见的数据资源，分子表示和基准平台。此外，为了总结AI在药物发现中的进展情况，我们介绍了在调查的论文中包括模型架构和学习范式的相关AI技术。我们预计本调查将作为有兴趣在人工智能和药物发现界面工作的研究人员的指南。我们还提供了GitHub存储库（HTTPS:///github.com/dengjianyuan/survey_survey_au_drug_discovery），其中包含文件和代码，如适用，作为定期更新的学习资源。

Graphs are ubiquitous in nature and can therefore serve as models for many practical but also theoretical problems. For this purpose, they can be defined as many different types which suitably reflect the individual contexts of the represented problem. To address cutting-edge problems based on graph data, the research field of Graph Neural Networks (GNNs) has emerged. Despite the field's youth and the speed at which new models are developed, many recent surveys have been published to keep track of them. Nevertheless, it has not yet been gathered which GNN can process what kind of graph types. In this survey, we give a detailed overview of already existing GNNs and, unlike previous surveys, categorize them according to their ability to handle different graph types and properties. We consider GNNs operating on static and dynamic graphs of different structural constitutions, with or without node or edge attributes. Moreover, we distinguish between GNN models for discrete-time or continuous-time dynamic graphs and group the models according to their architecture. We find that there are still graph types that are not or only rarely covered by existing GNN models. We point out where models are missing and give potential reasons for their absence.

药物发现和发展是一个复杂和昂贵的过程。正在研究机器学习方法，以帮助提高药物发现管道多个阶段的有效性和速度。其中，使用知识图表（kg）的那些在许多任务中具有承诺，包括药物修复，药物毒性预测和靶基因疾病优先级。在药物发现kg中，包括基因，疾病和药物在内的关键因素被认为是实体，而它们之间的关系表示相互作用。但是，为了构建高质量的KG，需要合适的数据。在这篇综述中，我们详细介绍了适用于构建聚焦KGS的药物发现的公开使用来源。我们的目标是帮助引导机器学习和kg从业者对吸毒者发现领域应用新技术，但是谁可能不熟悉相关的数据来源。通过严格的标准选择数据集，根据包含内部包含的主要信息类型，并基于可以提取的信息来进行分类以构建kg。然后，我们对现有的公共药物发现KGS进行了比较分析，并评估了文献中所选择的激励案例研究。此外，我们还提出了众多和与域及其数据集相关的众多挑战和问题，同时突出了关键的未来研究方向。我们希望本综述将激励KGS在药物发现领域的关键和新兴问题中使用。

Graph mining tasks arise from many different application domains, ranging from social networks, transportation to E-commerce, etc., which have been receiving great attention from the theoretical and algorithmic design communities in recent years, and there has been some pioneering work employing the research-rich Reinforcement Learning (RL) techniques to address graph data mining tasks. However, these graph mining methods and RL models are dispersed in different research areas, which makes it hard to compare them. In this survey, we provide a comprehensive overview of RL and graph mining methods and generalize these methods to Graph Reinforcement Learning (GRL) as a unified formulation. We further discuss the applications of GRL methods across various domains and summarize the method descriptions, open-source codes, and benchmark datasets of GRL methods. Furthermore, we propose important directions and challenges to be solved in the future. As far as we know, this is the latest work on a comprehensive survey of GRL, this work provides a global view and a learning resource for scholars. In addition, we create an online open-source for both interested scholars who want to enter this rapidly developing domain and experts who would like to compare GRL methods.

多药物（定义为使用多种药物）是一种标准治疗方法，尤其是对于严重和慢性疾病。但是，将多种药物一起使用可能会导致药物之间的相互作用。药物 - 药物相互作用（DDI）是一种与另一种药物结合时的影响发生变化时发生的活性。 DDI可能会阻塞，增加或减少药物的预期作用，或者在最坏情况下，会产生不利的副作用。虽然准时检测DDI至关重要，但由于持续时间短，并且在临床试验中识别它们是时间的，而且昂贵，并且要考虑许多可能的药物对进行测试。结果，需要计算方法来预测DDI。在本文中，我们提出了一种新型的异质图注意模型Han-DDI，以预测药物 - 药物相互作用。我们建立了具有不同生物实体的药物网络。然后，我们开发了一个异质的图形注意网络，以使用药物与其他实体的关系学习DDI。它由一个基于注意力的异质图节点编码器组成，用于获得药物节点表示和用于预测药物相互作用的解码器。此外，我们利用全面的实验来评估我们的模型并将其与最先进的模型进行比较。实验结果表明，我们提出的方法Han-DDI的表现可以显着，准确地预测DDI，即使对于新药也是如此。

最近，图形神经网络已成为机器学习界的热门话题。本文提出了基于SCOPUS，自2004年以来，GNN论文首次发布的基于GNNS研究的概述。该研究旨在评估总量和定性的GNN研究趋势。我们提供了研究，积极和有影响力的作者和机构，出版物来源，最具引用文件和热门话题的趋势。我们的调查表明，该领域中最常见的主题类别是计算机科学，工程，电信，语言学，运营研究和管理科学，信息科学和图书馆学，商业和经济学，自动化和控制系统，机器人和社会科学。此外，GNN出版物最具活跃的来源是计算机科学的讲义。最多产或有影响力的机构在美国，中国和加拿大发现。我们还提供必须阅读论文和未来方向。最后，图表卷积网络和注意机制的应用现在是GNN研究的热门话题。

图表是一个宇宙数据结构，广泛用于组织现实世界中的数据。像交通网络，社交和学术网络这样的各种实际网络网络可以由图表代表。近年来，目睹了在网络中代表顶点的快速发展，进入低维矢量空间，称为网络表示学习。表示学习可以促进图形数据上的新算法的设计。在本调查中，我们对网络代表学习的当前文献进行了全面审查。现有算法可以分为三组：浅埋模型，异构网络嵌入模型，图形神经网络的模型。我们为每个类别审查最先进的算法，并讨论这些算法之间的基本差异。调查的一个优点是，我们系统地研究了不同类别的算法底层的理论基础，这提供了深入的见解，以更好地了解网络表示学习领域的发展。

协同的药物组合为增强治疗功效和减少不良反应提供了巨大的潜力。然而，由于未知的因果疾病信号通路，有效和协同的药物组合预测仍然是一个悬而未决的问题。尽管已经提出了各种深度学习（AI）模型来定量预测药物组合的协同作用。现有深度学习方法的主要局限性是它们本质上是不可解释的，这使得AI模型的结论是对人类专家的非透明度的结论，因此限制了模型结论的鲁棒性和这些模型在现实世界中的实施能力人类医疗保健。在本文中，我们开发了一个可解释的图神经网络（GNN），该神经网络（GNN）揭示了通过挖掘非常重要的亚分子网络来揭示协同（MOS）的基本基本治疗靶标和机制。可解释的GNN预测模型的关键点是一个新颖的图池层，基于自我注意的节点和边缘池（此后为SANEPOOL），可以根据节点特征和图表计算节点和边缘的注意力评分（重要性）拓扑。因此，提出的GNN模型提供了一种系统的方法来预测和解释基于检测到的关键亚分子网络的药物组合协同作用。我们评估了来自NCI Almanac药物组合筛查数据的46个核心癌症信号通路和药物组合的基因制造的分子网络。实验结果表明，1）Sanepool可以在其他流行的图神经网络中实现当前的最新性能； 2）由SANEPOOOL检测到的亚分子网络是可自我解释的，并且可以鉴定协同的药物组合。

无创医学神经影像学已经对大脑连通性产生了许多发现。开发了几种实质技术绘制形态，结构和功能性脑连接性，以创建人脑中神经元活动的全面路线图。依靠其非欧国人数据类型，图形神经网络（GNN）提供了一种学习深图结构的巧妙方法，并且它正在迅速成为最先进的方法，从而导致各种网络神经科学任务的性能增强。在这里，我们回顾了当前基于GNN的方法，突出了它们在与脑图有关的几种应用中使用的方式，例如缺失的脑图合成和疾病分类。最后，我们通过绘制了通往网络神经科学领域中更好地应用GNN模型在神经系统障碍诊断和人群图整合中的路径。我们工作中引用的论文列表可在https://github.com/basiralab/gnns-inns-intwork-neuroscience上找到。

COVID-19的大流行提出了对多个领域决策者的流行预测的重要性，从公共卫生到整个经济。虽然预测流行进展经常被概念化为类似于天气预测，但是它具有一些关键的差异，并且仍然是一项非平凡的任务。疾病的传播受到人类行为，病原体动态，天气和环境条件的多种混杂因素的影响。由于政府公共卫生和资助机构的倡议，捕获以前无法观察到的方面的丰富数据来源的可用性增加了研究的兴趣。这尤其是在“以数据为中心”的解决方案上进行的一系列工作，这些解决方案通过利用非传统数据源以及AI和机器学习的最新创新来增强我们的预测能力的潜力。这项调查研究了各种数据驱动的方法论和实践进步，并介绍了一个概念框架来导航它们。首先，我们列举了与流行病预测相关的大量流行病学数据集和新的数据流，捕获了各种因素，例如有症状的在线调查，零售和商业，流动性，基因组学数据等。接下来，我们将讨论关注最近基于数据驱动的统计和深度学习方法的方法和建模范式，以及将机械模型知识域知识与统计方法的有效性和灵活性相结合的新型混合模型类别。我们还讨论了这些预测系统的现实部署中出现的经验和挑战，包括预测信息。最后，我们重点介绍了整个预测管道中发现的一些挑战和开放问题。

The prediction of protein structures from sequences is an important task for function prediction, drug design, and related biological processes understanding. Recent advances have proved the power of language models (LMs) in processing the protein sequence databases, which inherit the advantages of attention networks and capture useful information in learning representations for proteins. The past two years have witnessed remarkable success in tertiary protein structure prediction (PSP), including evolution-based and single-sequence-based PSP. It seems that instead of using energy-based models and sampling procedures, protein language model (pLM)-based pipelines have emerged as mainstream paradigms in PSP. Despite the fruitful progress, the PSP community needs a systematic and up-to-date survey to help bridge the gap between LMs in the natural language processing (NLP) and PSP domains and introduce their methodologies, advancements and practical applications. To this end, in this paper, we first introduce the similarities between protein and human languages that allow LMs extended to pLMs, and applied to protein databases. Then, we systematically review recent advances in LMs and pLMs from the perspectives of network architectures, pre-training strategies, applications, and commonly-used protein databases. Next, different types of methods for PSP are discussed, particularly how the pLM-based architectures function in the process of protein folding. Finally, we identify challenges faced by the PSP community and foresee promising research directions along with the advances of pLMs. This survey aims to be a hands-on guide for researchers to understand PSP methods, develop pLMs and tackle challenging problems in this field for practical purposes.

Deep learning has been shown to be successful in a number of domains, ranging from acoustics, images, to natural language processing. However, applying deep learning to the ubiquitous graph data is non-trivial because of the unique characteristics of graphs. Recently, substantial research efforts have been devoted to applying deep learning methods to graphs, resulting in beneficial advances in graph analysis techniques. In this survey, we comprehensively review the different types of deep learning methods on graphs. We divide the existing methods into five categories based on their model architectures and training strategies: graph recurrent neural networks, graph convolutional networks, graph autoencoders, graph reinforcement learning, and graph adversarial methods. We then provide a comprehensive overview of these methods in a systematic manner mainly by following their development history. We also analyze the differences and compositions of different methods. Finally, we briefly outline the applications in which they have been used and discuss potential future research directions.

Graph classification is an important area in both modern research and industry. Multiple applications, especially in chemistry and novel drug discovery, encourage rapid development of machine learning models in this area. To keep up with the pace of new research, proper experimental design, fair evaluation, and independent benchmarks are essential. Design of strong baselines is an indispensable element of such works. In this thesis, we explore multiple approaches to graph classification. We focus on Graph Neural Networks (GNNs), which emerged as a de facto standard deep learning technique for graph representation learning. Classical approaches, such as graph descriptors and molecular fingerprints, are also addressed. We design fair evaluation experimental protocol and choose proper datasets collection. This allows us to perform numerous experiments and rigorously analyze modern approaches. We arrive to many conclusions, which shed new light on performance and quality of novel algorithms. We investigate application of Jumping Knowledge GNN architecture to graph classification, which proves to be an efficient tool for improving base graph neural network architectures. Multiple improvements to baseline models are also proposed and experimentally verified, which constitutes an important contribution to the field of fair model comparison.

近年来，基于Weisfeiler-Leman算法的算法和神经架构，是一个众所周知的Graph同构问题的启发式问题，它成为具有图形和关系数据的机器学习的强大工具。在这里，我们全面概述了机器学习设置中的算法的使用，专注于监督的制度。我们讨论了理论背景，展示了如何将其用于监督的图形和节点表示学习，讨论最近的扩展，并概述算法的连接（置换 - ）方面的神经结构。此外，我们概述了当前的应用和未来方向，以刺激进一步的研究。