对于网络入侵检测系统（NIDS）使用机器学习（ML）的大多数研究都使用良好的数据集，例如KDD-CUP99，NSL-KDD，UNSW-NB15和Cicids-2017。在这种情况下，探讨了机器学习技术的可能性，旨在与已发表的基线（以模型为中心的方法）相比的度量改进。但是，这些数据集将一些限制呈现为老化，使得将基于ML的解决方案转换为现实世界的应用程序，这使得它不可行。本文提出了一种系统以系统为中心的方法来解决NIDS研究的当前限制，特别是数据集。此方法生成由最近的网络流量和攻击组成的NID数据集，其中包含设计的标签过程。

This work presents a thorough review concerning recent studies and text generation advancements using Generative Adversarial Networks. The usage of adversarial learning for text generation is promising as it provides alternatives to generate the so-called "natural" language. Nevertheless, adversarial text generation is not a simple task as its foremost architecture, the Generative Adversarial Networks, were designed to cope with continuous information (image) instead of discrete data (text). Thus, most works are based on three possible options, i.e., Gumbel-Softmax differentiation, Reinforcement Learning, and modified training objectives. All alternatives are reviewed in this survey as they present the most recent approaches for generating text using adversarial-based techniques. The selected works were taken from renowned databases, such as Science Direct, IEEEXplore, Springer, Association for Computing Machinery, and arXiv, whereas each selected work has been critically analyzed and assessed to present its objective, methodology, and experimental results.

Machine Learning algorithms have been extensively researched throughout the last decade, leading to unprecedented advances in a broad range of applications, such as image classification and reconstruction, object recognition, and text categorization. Nonetheless, most Machine Learning algorithms are trained via derivative-based optimizers, such as the Stochastic Gradient Descent, leading to possible local optimum entrapments and inhibiting them from achieving proper performances. A bio-inspired alternative to traditional optimization techniques, denoted as meta-heuristic, has received significant attention due to its simplicity and ability to avoid local optimums imprisonment. In this work, we propose to use meta-heuristic techniques to fine-tune pre-trained weights, exploring additional regions of the search space, and improving their effectiveness. The experimental evaluation comprises two classification tasks (image and text) and is assessed under four literature datasets. Experimental results show nature-inspired algorithms' capacity in exploring the neighborhood of pre-trained weights, achieving superior results than their counterpart pre-trained architectures. Additionally, a thorough analysis of distinct architectures, such as Multi-Layer Perceptron and Recurrent Neural Networks, attempts to visualize and provide more precise insights into the most critical weights to be fine-tuned in the learning process.

This paper develops a clustering method that takes advantage of the sturdiness of model-based clustering, while attempting to mitigate some of its pitfalls. First, we note that standard model-based clustering likely leads to the same number of clusters per margin, which seems a rather artificial assumption for a variety of datasets. We tackle this issue by specifying a finite mixture model per margin that allows each margin to have a different number of clusters, and then cluster the multivariate data using a strategy game-inspired algorithm to which we call Reign-and-Conquer. Second, since the proposed clustering approach only specifies a model for the margins -- but leaves the joint unspecified -- it has the advantage of being partially parallelizable; hence, the proposed approach is computationally appealing as well as more tractable for moderate to high dimensions than a `full' (joint) model-based clustering approach. A battery of numerical experiments on artificial data indicate an overall good performance of the proposed methods in a variety of scenarios, and real datasets are used to showcase their application in practice.

In the last decade, exponential data growth supplied machine learning-based algorithms' capacity and enabled their usage in daily-life activities. Additionally, such an improvement is partially explained due to the advent of deep learning techniques, i.e., stacks of simple architectures that end up in more complex models. Although both factors produce outstanding results, they also pose drawbacks regarding the learning process as training complex models over large datasets are expensive and time-consuming. Such a problem is even more evident when dealing with video analysis. Some works have considered transfer learning or domain adaptation, i.e., approaches that map the knowledge from one domain to another, to ease the training burden, yet most of them operate over individual or small blocks of frames. This paper proposes a novel approach to map the knowledge from action recognition to event recognition using an energy-based model, denoted as Spectral Deep Belief Network. Such a model can process all frames simultaneously, carrying spatial and temporal information through the learning process. The experimental results conducted over two public video dataset, the HMDB-51 and the UCF-101, depict the effectiveness of the proposed model and its reduced computational burden when compared to traditional energy-based models, such as Restricted Boltzmann Machines and Deep Belief Networks.

本文提出了一种以非零速度的效果友好型捕捉对象的混合优化和学习方法。通过受约束的二次编程问题，该方法生成最佳轨迹，直至机器人和对象之间的接触点，以最小化其相对速度并减少初始影响力。接下来，生成的轨迹是由基于人类的捕捉演示的旋风动作原始词更新的，以确保围绕接口点的平稳过渡。此外，学习的人类可变刚度（HVS）被发送到机器人的笛卡尔阻抗控制器，以吸收后影响力并稳定捕获位置。进行了三个实验，以将我们的方法与固定位置阻抗控制器（FP-IC）进行比较。结果表明，所提出的方法的表现优于FP-IC，同时添加HVS可以更好地吸收影响后力。

两个随机过程的局部特征的比较可以阐明该过程差异最大的时间或空间。本文提出了一种了解具有一定体积的区域的方法，其中两个过程的边际属性不那么相似。所提出的方法是针对感兴趣的数据本身就是随机过程的设置而完全普遍设计的，因此，在功能数据的背景下，所提出的方法可用于指出与一定体积的最大差异区域的指出。系列和点过程。两个感兴趣的随机过程基础的参数函数是通过基础表示建模的，贝叶斯推断是通过集成的嵌套拉普拉斯近似进行的。数值研究验证了所提出的方法，我们通过犯罪学，金融和医学的案例研究展示了它们的应用。

关于使用ML模型的一个基本问题涉及其对提高决策透明度的预测的解释。尽管已经出现了几种可解释性方法，但已经确定了有关其解释可靠性的一些差距。例如，大多数方法都是不稳定的（这意味着它们在数据中提供了截然不同的解释），并且不能很好地应对无关的功能（即与标签无关的功能）。本文介绍了两种新的可解释性方法，即Varimp和Supclus，它们通过使用局部回归拟合的加权距离来克服这些问题，以考虑可变重要性。 Varimp生成了每个实例的解释，可以应用于具有更复杂关系的数据集，而Supclus解释了具有类似说明的实例集群，并且可以应用于可以找到群集的较简单数据集。我们将我们的方法与最先进的方法进行了比较，并表明它可以根据几个指标产生更好的解释，尤其是在具有无关特征的高维问题中，以及特征与目标之间的关系是非线性的。

灾难性的遗忘是阻碍在持续学习环境中部署深度学习算法的一个重大问题。已经提出了许多方法来解决灾难性的遗忘问题，在学习新任务时，代理商在旧任务中失去了其旧任务的概括能力。我们提出了一项替代策略，可以通过知识合并（CFA）处理灾难性遗忘，该策略从多个专门从事以前任务的多个异构教师模型中学习了学生网络，并可以应用于当前的离线方法。知识融合过程以单头方式进行，只有选定数量的记忆样本，没有注释。教师和学生不需要共享相同的网络结构，可以使异质任务适应紧凑或稀疏的数据表示。我们将我们的方法与不同策略的竞争基线进行比较，证明了我们的方法的优势。

图神经网络（GNN）已成为与图形和类似拓扑数据结构有关的无数任务的骨干。尽管已经在与节点和图形分类/回归任务有关的域中建立了许多作品，但它们主要处理单个任务。在图形上的持续学习在很大程度上没有探索，现有的图形持续学习方法仅限于任务的学习方案。本文提出了一个持续学习策略，该策略结合了基于架构和基于内存的方法。结构学习策略是由强化学习驱动的，在该学习中，对控制器网络进行了这种方式，以确定观察到新任务时从基本网络中添加/修剪的最佳节点，从而确保足够的网络能力。参数学习策略的基础是黑暗体验重播方法的概念，以应对灾难性的遗忘问题。我们的方法在任务收入学习和课堂学习设置中都通过几个图的连续学习基准问题进行了数值验证。与最近发表的作品相比，我们的方法在这两种设置中都表明了性能的提高。可以在\ url {https://github.com/codexhammer/gcl}上找到实现代码。