Jeffrey Heidemann

Prof. Dr. Jeffrey Heidemann


Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
31 March 2025 in Financial Markets, Institutions and Risks
Verified
Journal Article
Open access
PDF file
MGMarcel Guhl
Marcel Guhl
JHJeffrey Heidemann
Jeffrey Heidemann
Remarkable examples like the flood in July 2021 in Germany showed that regional banks (savings and cooperative banks) and their strong local network were central pillars for the local population. Regional banks have provided financial aid, resources, and pragmatic solutions in response to the disaster. At the same time, it became visible that the measures implemented were reactive rather than preventive. This aspect has received minimal consideration in scientific discourse. The study addresses two research questions by conducting a comprehensive literature review and employing an exploratory qualitative approach: the role of regional banks in disaster risk reduction in Germany and bank-specific services, which should be organised in a more preventative manner to increase the population’s resilience to disasters. Semi-structured interviews, followed by qualitative content analysis are used to gather expert opinions. Eleven representative experts from regional banks, banking associations, and the disaster risk management sector were interviewed between July 2023 and March 2024. The results confirm that regional banks have been primarily reactive to disasters. At the same time, the study indicates that regional banks should be more involved in disaster risk prevention because of their local networks, material and immaterial resources, and their central role as local financiers. The study contributed substantially to the academic debate and generated practical insights for regional banks and disaster prevention in Germany.

6 February 2026 in Applied Sciences
Verified
Journal Article
Open access
PDF file
MHMario Heidrich
Mario Heidrich
JHJeffrey Heidemann
Jeffrey Heidemann
Rudiger BuchkremerRudiger Buchkremer
Rudiger Buchkremer
GWGonzalo Wandosell
Gonzalo Wandosell
Node embedding refers to techniques that generate low-dimensional vector representations of nodes in a graph while preserving specific node properties and is widely used in applied domains such as fraud detection and social network analysis. A key challenge is the development of scalable methods that can capture structural characteristics relevant to diverse downstream application tasks. While most existing approaches focus on preserving node proximity, methods that aim to preserve structural properties often lack the flexibility required to represent different types of structural patterns. In this work, we introduce ffstruc2vec, a scalable deep learning framework for learning node embeddings that preserve structural identities, designed for real-world network analysis tasks. The proposed approach employs a flat and efficient architecture that enables flexible modeling of a wide range of structural patterns and facilitates adaptation to different downstream tasks. The experimental results across unsupervised and supervised settings demonstrate that ffstruc2vec achieves competitive and often superior performance compared to existing structure-preserving node embedding methods. In addition, the framework enhances interpretability by quantifying the influence of individual structural patterns on task outcomes, supporting the interpretation of the learned representations. These results indicate that ffstruc2vec offers a flexible and scalable solution for structure-preserving node embedding with practical applicability.


9 March 2026 in Applied Sciences
Verified
Journal Article
Open access
PDF file
MHMario Heidrich
Mario Heidrich
JHJeffrey Heidemann
Jeffrey Heidemann
Rudiger BuchkremerRudiger Buchkremer
Rudiger Buchkremer
GWGonzalo Wandosell
Gonzalo Wandosell
While graph-derived signals are widely used in tabular learning, existing studies typically rely on limited experimental setups and average performance comparisons, leaving the statistical reliability and robustness of observed gains largely unexplored. Consequently, it remains unclear which signals provide consistent and robust improvements. This paper presents a taxonomy-driven empirical analysis of graph-derived signals for tabular machine learning. We propose a unified and reproducible evaluation method to systematically assess which categories of graph-derived signals yield statistically significant and robust performance improvements. The method provides an extensible setup for the controlled integration of diverse graph-derived signals into tabular learning pipelines. To ensure a fair and rigorous comparison, it incorporates automated hyperparameter optimization, multi-seed statistical evaluation, formal significance testing, and robustness analysis under graph perturbations. We demonstrate the applicability of the method through an extensive case study on a large-scale, imbalanced cryptocurrency fraud detection dataset. The analysis identifies signal categories providing consistently reliable performance gains and offers interpretable insights into which graph-derived signals indicate fraud-discriminative structural patterns. Furthermore, robustness analyses reveal pronounced differences in how various signals handle missing or corrupted relational data. These findings demonstrate the proposed taxonomy-driven evaluation method’s practical utility for fraud detection and illustrate how it can be applied in other application domains.