对业务流程的预测监控是流程挖掘的子领域，旨在预测下一个事件的特征或下一个事件的序列。虽然已经提出了基于深度学习的多种方法，主要是经常发生的神经网络和卷积神经网络，但它们都不是真正利用过程模型中可用的结构信息。本文提出了一种基于图形卷积网络和经常性神经网络的方法，所述内部网络从过程模型中使用信息。真实事件日志的实验评估表明，我们的方法更加一致，更优于当前的最先进的方法。

Predictive monitoring is a subfield of process mining that aims to predict how a running case will unfold in the future. One of its main challenges is forecasting the sequence of activities that will occur from a given point in time -- suffix prediction -- . Most approaches to the suffix prediction problem learn to predict the suffix by learning how to predict the next activity only, not learning from the whole suffix during the training phase. This paper proposes a novel architecture based on an encoder-decoder model with an attention mechanism that decouples the representation learning of the prefixes from the inference phase, predicting only the activities of the suffix. During the inference phase, this architecture is extended with a heuristic search algorithm that improves the selection of the activity for each index of the suffix. Our approach has been tested using 12 public event logs against 6 different state-of-the-art proposals, showing that it significantly outperforms these proposals.

Various methods using machine and deep learning have been proposed to tackle different tasks in predictive process monitoring, forecasting for an ongoing case e.g. the most likely next event or suffix, its remaining time, or an outcome-related variable. Recurrent neural networks (RNNs), and more specifically long short-term memory nets (LSTMs), stand out in terms of popularity. In this work, we investigate the capabilities of such an LSTM to actually learn the underlying process model structure of an event log. We introduce an evaluation framework that combines variant-based resampling and custom metrics for fitness, precision and generalization. We evaluate 4 hypotheses concerning the learning capabilities of LSTMs, the effect of overfitting countermeasures, the level of incompleteness in the training set and the level of parallelism in the underlying process model. We confirm that LSTMs can struggle to learn process model structure, even with simplistic process data and in a very lenient setup. Taking the correct anti-overfitting measures can alleviate the problem. However, these measures did not present themselves to be optimal when selecting hyperparameters purely on predicting accuracy. We also found that decreasing the amount of information seen by the LSTM during training, causes a sharp drop in generalization and precision scores. In our experiments, we could not identify a relationship between the extent of parallelism in the model and the generalization capability, but they do indicate that the process' complexity might have impact.

业务流程的自动化和数字化导致信息系统中捕获的大量数据，这可以帮助企业更好地理解其流程，改善工作流或提供运营支持。通过对正在进行的过程进行预测，可以识别瓶颈并重新分配资源，以及在过程实例的状态（案例）中获得的见解。传统上，数据是以带有单个识别案例概念的事件日志的形式从系统中提取的，例如用于现金订单（O2C）流程的订单ID。但是，实际过程通常具有多种对象类型，例如订单，项目和软件包，因此强制使用单个案例概念的格式不会反映数据中的基本关系。引入了以对象为中心的事件日志（OCEL）格式，以正确捕获此信息。最先进的预测方法仅根据传统事件日志量身定制。该论点表明，可以使用OCEL中包含的丰富数据来增强一种利用生成对抗网络（GAN），长期记忆（LSTM）体系结构（SEQ2SEQ）的预测方法。 OCEL中的对象可以具有可用于预测下一个事件和时间戳的属性，例如对于对象类型包的优先类属性，指示速度较慢或更快地处理。在预测剩余事件的序列相似性和时间戳的平均绝对误差（MAE）的指标中，本文中的方法匹配或超过了先前的研究，具体取决于所选对象属性是否是模型的有用特征。此外，本文提供了一个Web界面，以预测用户输入中的下一个活动序列。

近年来，图形神经网络（GNN）与复发性神经网络（RNN）的变体相结合，在时空预测任务中达到了最先进的性能。对于流量预测，GNN模型使用道路网络的图形结构来解释链接和节点之间的空间相关性。最近的解决方案要么基于复杂的图形操作或避免预定义的图。本文提出了一种新的序列结构，以使用具有稀疏体系结构的GNN-RNN细胞在多个抽象的抽象上提取时空相关性，以减少训练时间与更复杂的设计相比。通过多个编码器编码相同的输入序列，并随着编码层的增量增加，使网络能够通过多级抽象来学习一般和详细的信息。我们进一步介绍了来自加拿大蒙特利尔的街道细分市场流量数据的新基准数据集。与高速公路不同，城市路段是循环的，其特征是复杂的空间依赖性。与基线方法相比，一小时预测的实验结果和我们的MSLTD街道级段数据集对我们的模型提高了7％以上，同时将计算资源要求提高了一半以上竞争方法。

人口级社会事件，如民事骚乱和犯罪，往往对我们的日常生活产生重大影响。预测此类事件对于决策和资源分配非常重要。由于缺乏关于事件发生的真实原因和潜在机制的知识，事件预测传统上具有挑战性。近年来，由于两个主要原因，研究事件预测研究取得了重大进展：（1）机器学习和深度学习算法的开发和（2）社交媒体，新闻来源，博客，经济等公共数据的可访问性指标和其他元数据源。软件/硬件技术中的数据的爆炸性增长导致了社会事件研究中的深度学习技巧的应用。本文致力于提供社会事件预测的深层学习技术的系统和全面概述。我们专注于两个社会事件的域名：\ Texit {Civil unrest}和\ texit {犯罪}。我们首先介绍事件预测问题如何作为机器学习预测任务制定。然后，我们总结了这些问题的数据资源，传统方法和最近的深度学习模型的发展。最后，我们讨论了社会事件预测中的挑战，并提出了一些有希望的未来研究方向。

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.

保持个人特征和复杂的关系，广泛利用和研究了图表数据。通过更新和聚合节点的表示，能够捕获结构信息，图形神经网络（GNN）模型正在获得普及。在财务背景下，该图是基于实际数据构建的，这导致复杂的图形结构，因此需要复杂的方法。在这项工作中，我们在最近的财务环境中对GNN模型进行了全面的审查。我们首先将普通使用的财务图分类并总结每个节点的功能处理步骤。然后，我们总结了每个地图类型的GNN方法，每个区域的应用，并提出一些潜在的研究领域。

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.

图表神经网络（GNNS）最近在人工智能（AI）领域的普及，这是由于它们作为输入数据相对非结构化数据类型的独特能力。尽管GNN架构的一些元素在概念上类似于传统神经网络（以及神经网络变体）的操作中，但是其他元件代表了传统深度学习技术的偏离。本教程通过整理和呈现有关GNN最常见和性能变种的动机，概念，数学和应用的细节，将GNN的权力和新颖性暴露给AI从业者。重要的是，我们简明扼要地向实际示例提出了本教程，从而为GNN的主题提供了实用和可访问的教程。

我们提出了一种新的方法来建立强大的预测过程模型。我们的方法（表示Prock（过程和知识））不仅依赖于事件日志的形式取决于顺序输入数据，而且可以学会使用知识图来合并有关事件的属性值及其相互关系的信息。通过将事件属性映射到知识图的节点并以端到端方式训练序列模型并训练序列模型，可以实现这个想法。这种混合方法大大提高了预测过程监视的灵活性和适用性，因为驻留在组织数据库中的静态和动态信息都可以直接作为输入数据。我们通过将其应用于许多预测过程监视任务，包括具有知识图的任务以及现有的过程监视基准，在没有给出此类图的情况下，我们证明了Prock的潜力。实验提供了证据，表明我们的方法可以达到最新的性能，并在知识图可用时提高预测能力。

进程感知的推荐系统可以提供关键的决策支持功能，以帮助通过推荐接下来采取的操作来执行业务流程执行。基于深度学习领域的最近进步，我们介绍了一种基于新的内存增强神经网络（MANN）构建过程感知推荐系统。我们提出了一种新颖的网络架构，即写保护的双控制器存储器增强神经网络（DCW-MANN），用于构建规范模型。为了评估我们方法的可行性和有用性，我们考虑了三个现实世界数据集，并表明我们的方法在后缀推荐和下一个任务预测任务的几个基线上导致更好的性能。

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.

准确的交通状况预测为车辆环境协调和交通管制任务提供了坚实的基础。由于道路网络数据在空间分布中的复杂性以及深度学习方法的多样性，有效定义流量数据并充分捕获数据中复杂的空间非线性特征变得具有挑战性。本文将两种分层图池方法应用于流量预测任务，以减少图形信息冗余。首先，本文验证了流量预测任务中层次图池方法的有效性。分层图合并方法与其他基线在预测性能上形成鲜明对比。其次，应用了两种主流分层图池方法，节点群集池和节点下降池，用于分析流量预测中的优势和弱点。最后，对于上述图神经网络，本文比较了不同图网络输入对流量预测准确性的预测效应。分析和汇总定义图网络的有效方法。

在过程挖掘中，发现技术使从事件日志自动构建业务流程模型成为可能。但是，结果通常无法达到模型复杂性及其拟合精度之间的平衡，因此需要进行手动模型调整。该论文提出了一种方法开采的方法，该方法基于模型复杂性和适应性的组合评估为模型优化提供半自动支持。为了在两种成分之间取得平衡，提出了一种模型简化方法，该方法基本上在所需的粒度下抽象了原始模型。此外，我们介绍了一个元态的概念，该元素的周期崩溃了，该循环可以潜在地简化模型并解释模型。我们旨在使用来自医疗保健领域不同应用程序的三个数据集证明技术解决方案的功能。它们是针对COVID-19大流行期间动脉高血压和医疗保健工作人员工作流动的患者的远程监测过程。案例研究还调查了各种复杂性度量和解决方案应用方式的使用，从而提供了有关改善过程模型中改善可解释性和复杂性/适应性平衡的更好实践的见解。

在执行现实生活过程中，计划或意外的变化是常见的。检测这些更改是优化运行此类过程的组织的性能的必要条件。最先进的大多数算法都集中在突然变化的检测上，抛开其他类型的变化。在本文中，我们将专注于自动检测渐进漂移，这是一种特殊的变化类型，其中两个模型的情况在一段时间内重叠。所提出的算法依赖于一致性检查指标来自动检测变化，还将这些变化的全自动分类为突然或逐渐分类。该方法已通过一个由120个日志组成的合成数据集进行了验证，该数据集具有不同的变化分布，在检测和分类准确性，延迟和变化区域在比较主要的最新算法方面取得更好的结果。

由于流量大数据的增加，交通预测逐渐引起了研究人员的注意力。因此，如何在交通数据中挖掘复杂的时空相关性以预测交通状况更准确地成为难题。以前的作品组合图形卷积网络（GCNS）和具有深度序列模型的自我关注机制（例如，复发性神经网络），分别捕获时空相关性，忽略时间和空间的关系。此外，GCNS受到过平滑问题的限制，自我关注受到二次问题的限制，导致GCN缺乏全局代表能力，自我注意力效率低下捕获全球空间依赖性。在本文中，我们提出了一种新颖的交通预测深入学习模型，命名为多语境意识的时空关节线性关注（STJLA），其对时空关节图应用线性关注以捕获所有时空之间的全球依赖性节点有效。更具体地，STJLA利用静态结构上下文和动态语义上下文来提高模型性能。基于Node2VEC和单热编码的静态结构上下文丰富了时空位置信息。此外，基于多头扩散卷积网络的动态空间上下文增强了局部空间感知能力，并且基于GRU的动态时间上下文分别稳定了线性关注的序列位置信息。在两个现实世界交通数据集，英格兰和PEMSD7上的实验表明，我们的Stjla可以获得高达9.83％和3.08％，在最先进的基线上的衡量标准的准确性提高。

Time series anomaly detection has applications in a wide range of research fields and applications, including manufacturing and healthcare. The presence of anomalies can indicate novel or unexpected events, such as production faults, system defects, or heart fluttering, and is therefore of particular interest. The large size and complex patterns of time series have led researchers to develop specialised deep learning models for detecting anomalous patterns. This survey focuses on providing structured and comprehensive state-of-the-art time series anomaly detection models through the use of deep learning. It providing a taxonomy based on the factors that divide anomaly detection models into different categories. Aside from describing the basic anomaly detection technique for each category, the advantages and limitations are also discussed. Furthermore, this study includes examples of deep anomaly detection in time series across various application domains in recent years. It finally summarises open issues in research and challenges faced while adopting deep anomaly detection models.

被证明是深度学习是一种用于建模顺序数据的有效工具，如自然语言，计算机视觉和信号处理的成功所示。过程挖掘涉及通过支持信息系统记录的执行数据来发现对业务流程的见解。记录数据（事件日志）由对应于过程的执行的事件序列（迹线）形成。许多深度学习技术已成功适用于预测过程挖掘，其旨在预测过程结果，剩余时间，下一个事件，甚至运行迹线的后缀。过程挖掘中的迹线是多模式序列，而不是自然语言句子或图像的结构非常不同。这可能需要不同的处理方法。到目前为止，几乎没有焦点这些差异，呈现挑战。看起来后缀预测作为这些任务的最具挑战性，只有在平均措施和少量现实生活事件日志中评估了深度学习模型的性能。由于不同的预处理和评估策略，比较纸张之间的结果是困难的。可能是相关的挑战是微量痕量分布的歪曲和现实事件日志中的活动分布的歪曲。我们提供了端到端的框架，可以在公共设置中比较七种最先进的顺序体系结构的性能。结果表明，序列建模仍然有大量改善大多数更复杂的数据集的空间。需要进一步的研究和见解，以获得一致的性能，不仅仅是平均措施，而且还在所有的前缀上。

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.