使用福利值的添加特征说明已经成为为每个特征的相对重要性提供给机器学习模型的个人预测的透明度。虽然福利值在合作博弈论中提供了独特的添加剂特征归因，但即使是单机学习模型也可以生成的福利值远非独特，具有影响所产生的血统的理论和实施决策。在这里，我们考虑福利值的应用解释决策树集合，并提出了一种可以应用于随机林和提升决策树的基于福芙值的特征归属的新方法。这种新方法提供了准确地反映各个实例的模型预测算法的细节的属性，同时使用最广泛使用的当前方法之一进行计算竞争。我们解释了标准和新颖方法之间的理论差异，并使用合成和实数据进行比较它们的绩效。

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.

The number of international benchmarking competitions is steadily increasing in various fields of machine learning (ML) research and practice. So far, however, little is known about the common practice as well as bottlenecks faced by the community in tackling the research questions posed. To shed light on the status quo of algorithm development in the specific field of biomedical imaging analysis, we designed an international survey that was issued to all participants of challenges conducted in conjunction with the IEEE ISBI 2021 and MICCAI 2021 conferences (80 competitions in total). The survey covered participants' expertise and working environments, their chosen strategies, as well as algorithm characteristics. A median of 72% challenge participants took part in the survey. According to our results, knowledge exchange was the primary incentive (70%) for participation, while the reception of prize money played only a minor role (16%). While a median of 80 working hours was spent on method development, a large portion of participants stated that they did not have enough time for method development (32%). 25% perceived the infrastructure to be a bottleneck. Overall, 94% of all solutions were deep learning-based. Of these, 84% were based on standard architectures. 43% of the respondents reported that the data samples (e.g., images) were too large to be processed at once. This was most commonly addressed by patch-based training (69%), downsampling (37%), and solving 3D analysis tasks as a series of 2D tasks. K-fold cross-validation on the training set was performed by only 37% of the participants and only 50% of the participants performed ensembling based on multiple identical models (61%) or heterogeneous models (39%). 48% of the respondents applied postprocessing steps.

Wireless Sensor Network (WSN) applications reshape the trend of warehouse monitoring systems allowing them to track and locate massive numbers of logistic entities in real-time. To support the tasks, classic Radio Frequency (RF)-based localization approaches (e.g. triangulation and trilateration) confront challenges due to multi-path fading and signal loss in noisy warehouse environment. In this paper, we investigate machine learning methods using a new grid-based WSN platform called Sensor Floor that can overcome the issues. Sensor Floor consists of 345 nodes installed across the floor of our logistic research hall with dual-band RF and Inertial Measurement Unit (IMU) sensors. Our goal is to localize all logistic entities, for this study we use a mobile robot. We record distributed sensing measurements of Received Signal Strength Indicator (RSSI) and IMU values as the dataset and position tracking from Vicon system as the ground truth. The asynchronous collected data is pre-processed and trained using Random Forest and Convolutional Neural Network (CNN). The CNN model with regularization outperforms the Random Forest in terms of localization accuracy with aproximate 15 cm. Moreover, the CNN architecture can be configured flexibly depending on the scenario in the warehouse. The hardware, software and the CNN architecture of the Sensor Floor are open-source under https://github.com/FLW-TUDO/sensorfloor.

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.

背景：基于学习的深度颈部淋巴结水平（HN_LNL）自动纤维与放射疗法研究和临床治疗计划具有很高的相关性，但在学术文献中仍被研究过。方法：使用35个规划CTS的专家划分的队列用于培训NNU-NEN 3D FULLES/2D-ENEBLEN模型，用于自动分片20不同的HN_LNL。验证是在独立的测试集（n = 20）中进行的。在一项完全盲目的评估中，3位临床专家在与专家创建的轮廓的正面比较中对深度学习自动分类的质量进行了评价。对于10个病例的亚组，将观察者内的变异性与深度学习自动分量性能进行了比较。研究了Autocontour与CT片平面方向的一致性对几何精度和专家评级的影响。结果：与专家创建的轮廓相比，对CT SLICE平面调整的深度学习分割的平均盲目专家评级明显好得多（81.0 vs. 79.6，p <0.001），但没有切片平面的深度学习段的评分明显差。专家创建的轮廓（77.2 vs. 79.6，p <0.001）。深度学习分割的几何准确性与观察者内变异性（平均骰子，0.78 vs. 0.77，p = 0.064）的几何准确性无关，并且在提高水平之间的准确性方面差异（p <0.001）。与CT切片平面方向一致性的临床意义未由几何精度指标（骰子，0.78 vs. 0.78 vs. 0.78，p = 0.572）结论：我们表明可以将NNU-NENE-NET 3D-FULLRES/2D-ENEMELBEND用于HN_LNL高度准确的自动限制仅使用有限的培训数据集，该数据集非常适合在研究环境中在HN_LNL的大规模标准化自动限制。几何准确度指标只是盲人专家评级的不完善的替代品。

常规进行了视频支气管镜检查，以涉嫌癌症，监测COPD患者的肺组织活检以及在重症监护病房中澄清急性呼吸问题。复杂的支气管树中的导航尤其具有挑战性和身体要求，需要医生的长期经验。本文介绍了支气管镜视频中支气管孔的自动分割。由于缺乏易于获取的地面真相分段数据，目前，基于学习的深度方法被阻碍。因此，我们提出了一个由K均值组成的数据驱动管道，然后是基于紧凑的标记的流域算法，该算法能够从给定的深度图像中生成气道实例分割图。通过这种方式，这些传统算法是仅基于Phantom数据集的RGB图像上直接在RGB图像上训练浅CNN的弱监督。我们在两个体内数据集上评估了该模型的概括能力，这些数据集涵盖21个不同的支气管镜上的250帧。我们证明其性能与那些在体内数据中直接训练的模型相当，通过128x128的图像分辨率，对于检测到的气道分割中心的平均误差为11 vs 5像素。我们的定量和定性结果表明，在视频支气管镜检查，幻影数据和弱监督的背景下，使用基于非学习的方法可以获得对气道结构的语义理解。

为了能够在不怀疑的情况下使用人工智能（AI）在医学中，并认识到和评估其日益增长的潜力，在当前和未来的医务人员中，对该主题的基本理解是必要的。在“通过理解的信任”的前提下，我们在德国Ki校园（AI校园）项目框架内开发了创新的在线课程，这是一个自我指导的课程，它教授AI的基础知识进行分析医疗图像数据。主要目标是提供一个学习环境，以充分了解医学图像分析中的AI，以便通过积极的应用经验来克服对该主题的进一步兴趣，并可以克服对其使用的抑制。重点是医疗应用和机器学习的基础。在线课程分为连续的课程，其中包括以解释性视频的形式，以简化和实践练习和/或测验的形式进行的实践练习，以检查学习进度。在课程的第一次跑步中，参与医学生的一项调查用于定量分析我们的研究假设。

人工神经网络（ANNS）尽管具有通用的功能近似能力和实践成功，但仍会遭受灾难性的遗忘。灾难性忘记是指学习新任务时的突然学习。这是一种妨碍持续学习的新兴现象。 ANN的现有通用函数近似定理保证功能近似能力，但不能预测灾难性遗忘。本文介绍了仅使用单变量函数和指数函数的多变量函数的新型通用近似定理。此外，我们介绍了Atlas：基于新定理的新颖Ann建筑。结果表明，地图集是能够保留某些内存和持续学习的通用函数近似器。地图集的记忆是不完善的，在持续学习过程中具有一些脱离靶向的效果，但行为良好且可预测。提供了有效的地图集。进行实验以评估Atlas的功能近似和记忆保留能力。

事实证明，加固学习（RL）的自适应课程有效地制定了稳健的火车和测试环境之间的差异。最近，无监督的环境设计（UED）框架通用RL课程以生成整个环境的序列，从而带来了具有强大的Minimax遗憾属性的新方法。在问题上，在部分观察或随机设置中，最佳策略可能取决于预期部署设置中环境的基本真相分布，而课程学习一定会改变培训分布。我们将这种现象形式化为课程诱导的协变量转移（CICS），并描述了其在核心参数中的发生如何导致次优政策。直接从基本真相分布中采样这些参数可以避免问题，但阻碍了课程学习。我们提出了Samplr，这是一种Minimax遗憾的方法，即使由于CICS偏向基础培训数据，它也优化了基础真相函数。我们证明并验证了具有挑战性的领域，我们的方法在基础上的分布下保留了最佳性，同时促进了整个环境环境的鲁棒性。