Christian Böhm

Background: Surgeries represent a mainstay of medical care globally. Patterns of complications are frequently recognized late and place a considerable burden on health care systems. The aim was to develop and test the first deep learning-adjusted CUSUM program (DL-CUSUM) to predict and monitor in-hospital mortality in real time after liver transplantation. Methods: Data from 1066 individuals with 66,092 preoperatively available data point variables from 2004 to 2019 were included. DL-CUSUM is an application to predict in-hospital mortality. The area under the curve for risk adjustment with Model of End-stage Liver Disease (D-MELD), Balance of Risk (BAR) score, and deep learning (DL), as well as the ARL (average run length) and control limit (CL) for an in-control process over 5 years, were calculated. Results: D-MELD AUC was 0.618, BAR AUC was 0.648 and DL model AUC was 0.857. CL with BAR adjustment was 2.3 with an ARL of 326.31. D-MELD reached an ARL of 303.29 with a CL of 2.4. DL prediction resulted in a CL of 1.8 to reach an ARL of 332.67. Conclusions: This work introduces the first use of an automated DL-CUSUM system to monitor postoperative in-hospital mortality after liver transplantation. It allows for the real-time risk-adjusted monitoring of process quality.

Detecting arbitrarily shaped clusters in high-dimensional noisy data is challenging for current clustering methods. We introduce SHADE (Structure-preserving High-dimensional Analysis with Density-based Exploration), the first deep clustering algorithm that incorporates density-connectivity into its loss function. Similar to existing deep clustering algorithms, SHADE supports high-dimensional and large data sets with the expressive power of a deep autoencoder. In contrast to most existing deep clustering methods that rely on a centroid-based clustering objective, SHADE incorporates a novel loss function that captures density-connectivity. SHADE thereby learns a representation that enhances the separation of density-connected clusters. SHADE detects a stable clustering and noise points fully automatically without any user input. It outperforms existing methods in clustering quality, especially on data that contain non-Gaussian clusters, such as video data. Moreover, the embedded space of SHADE is suitable for visualization and interpretation of the clustering results as the individual shapes of the clusters are preserved.

Anomaly detection in imbalanced datasets is a frequent and crucial problem, especially in the medical domain where retrieving and labeling irregularities is often expensive. By combining the generative stability of a β-variational autoencoder (VAE) with the discriminative strengths of generative adversarial networks (GANs), we propose a novel model, β-VAEGAN. We investigate methods for composing anomaly scores based on the discriminative and reconstructive capabilities of our model. Existing work focuses on linear combinations of these components to determine if data is anomalous. We advance existing work by training a kernelized support vector machine (SVM) on the respective error components to also consider nonlinear relationships. This improves anomaly detection performance, while allowing faster optimization. Lastly, we use the deviations from the Gaussian prior of β-VAEGAN to form a novel anomaly score component. In comparison to state-of-the-art work, we improve the F 1 score during anomaly detection from 0.85 to 0.92 on the widely used MITBIH Arrhythmia Database. ¹

Deep clustering algorithms have gained popularity for clustering complex, large-scale data sets, but getting started is difficult because of numerous decisions regarding architecture, optimizer, and other hyperparameters. Theoretical foundations must be known to obtain meaningful results. At the same time, ease of use is necessary to get used by a broader audience. Therefore, we require a unified framework that allows for easy execution in diverse settings. While this applies to established clustering methods like k-Means and DBSCAN, deep clustering algorithms lack a standard structure, resulting in significant programming overhead. This complicates empirical evaluations, which are essential in both scientific and practical applications. We present a solution to this problem by providing a theoretical background on deep clustering as well as practical implementation techniques and a unified structure with predefined neural networks. For the latter, we use the Python package ClustPy. The aim is to share best practices and facilitate community participation in deep clustering research.

Synchronization is a ubiquitous phenomenon in nature that enables the orderly presentation of information. In the human brain, for instance, functional modules such as the visual, motor, and language cortices form through neuronal synchronization. Inspired by biological brains and previous neuroscience studies, we propose an interpretable neural network incorporating a synchronization mechanism. The basic idea is to constrain each neuron, such as a convolution filter, to capture a single semantic pattern while synchronizing similar neurons to facilitate the formation of interpretable functional modules. Specifically, we regularize the activation map of a neuron to surround its focus position of the activated pattern in a sample. Moreover, neurons locally interact with each other, and similar ones are synchronized together during the training phase adaptively. Such local aggregation preserves the globally distributed representation nature of the neural network model, enabling a reasonably interpretable representation. To analyze the neuron interpretability comprehensively, we introduce a series of novel evaluation metrics from multiple aspects. Qualitative and quantitative experiments demonstrate that the proposed method outperforms many state-of-the-art algorithms in terms of interpretability. The resulting synchronized functional modules show module consistency across data and semantic specificity within modules.

Although deep neural networks have shown well-performance in various tasks, the poor interpretability of the models is always criticized. In the paper, we propose a new interpretable neural network method, by embedding neurons into the semantic space to extract their intrinsic global semantics. In contrast to previous methods that probe latent knowledge inside the model, the proposed semantic vector externalizes the latent knowledge to static knowledge, which is easy to exploit. Specifically, we assume that neurons with similar activation are of similar semantic information. Afterwards, semantic vectors are optimized by continuously aligning activation similarity and semantic vector similarity during the training of the neural network. The visualization of semantic vectors allows for a qualitative explanation of the neural network. Moreover, we assess the static knowledge quantitatively by knowledge distillation tasks. Empirical experiments of visualization show that semantic vectors describe neuron activation semantics well. Without the sample-by-sample guidance from the teacher model, static knowledge distillation exhibit comparable or even superior performance with existing relation-based knowledge distillation methods.

Background: The “digital era” in the field of medicine is the new “here and now”. Artificial intelligence has entered many fields of medicine and is recently emerging in the field of organ transplantation. Solid organs remain a scarce resource. Being able to predict the outcome after liver transplantation promises to solve one of the long-standing problems within organ transplantation. What is the perfect donor recipient match? Within this work we developed and validated a novel deep-learning-based donor–recipient allocation system for liver transplantation. Method: In this study we used data collected from all liver transplant patients between 2004 and 2019 at the university transplantation centre in Munich. We aimed to design a transparent and interpretable deep learning framework to predict the outcome after liver transplantation. An individually designed neural network was developed to meet the unique requirements of transplantation data. The metrics used to determine the model quality and its level of performance are accuracy, cross-entropy loss, and F1 score as well as AUC score. Results: A total of 529 transplantations with a total of 1058 matching donor and recipient observations were added into the database. The combined prediction of all outcome parameters was 95.8% accurate (cross-entropy loss of 0.042). The prediction of death within the hospital was 94.3% accurate (cross-entropy loss of 0.057). The overall F1 score was 0.899 on average, whereas the overall AUC score was 0.940. Conclusion: With the achieved results, the network serves as a reliable tool to predict survival. It adds new insight into the potential of deep learning to assist medical decisions. Especially in the field of transplantation, an AUC Score of 94% is very valuable. This neuronal network is unique as it utilizes transparent and easily interpretable data to predict the outcome after liver transplantation. Further validation must be performed prior to utilization in a clinical context.

To fully exploit the performance potential of modern multi-core processors, machine learning and data mining algorithms for big data must be parallelized in multiple ways. Today's CPUs consist of multiple cores, each following an independent thread of control, and each equipped with multiple arithmetic units which can perform the same operation on a vector of multiple data objects. Graph embedding, i.e. converting the vertices of a graph into numerical vectors is a data mining task of high importance and is useful for graph drawing (low-dimensional vectors) and graph representation learning (high-dimensional vectors). In this paper, we propose MulticoreGEMPE (Graph Embedding by Minimizing the Predictive Entropy), an information-theoretic method which can generate low and high-dimensional vectors. MulticoreGEMPE applies MIMD (Multiple Instructions Multiple Data, using OpenMP) and SIMD (Single Instructions Multiple Data, using AVX-512) parallelism. We propose general ideas applicable in other graph-based algorithms like \emph{vectorized hashing} and \emph{vectorized reduction}. Our experimental evaluation demonstrates the superiority of our approach.