Jens Dörpinghaus

Dr. Jens Dörpinghaus

orcid

Research Focus & Metrics

Academic Career Length

9Years (2018-Present)

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

Representative Publications

View All Publications
8 July 2020 in Chemical Research in Toxicology
Verified
Journal Article
Open access
RLRoman Li
Roman Li
AZAnze Zupanic
Anze Zupanic
MTMarja Talikka
Marja Talikka
VBVincenzo Belcastro
Vincenzo Belcastro
SMSumit Madan
Sumit Madan
JHJulia Hoeng
Julia Hoeng
Transcriptomic approaches can give insight into molecular mechanisms underlying chemical toxicity and are increasingly being used as part of toxicological assessments. To aid the interpretation of transcriptomic data, we have developed a systems toxicology method that relies on a computable biological network model. We created the first network model describing cardiotoxicity in zebrafish larvae—a valuable emerging model species in testing cardiotoxicity associated with drugs and chemicals. The network is based on scientific literature and represents hierarchical molecular pathways that lead from receptor activation to cardiac pathologies. To test the ability of our approach to detect cardiotoxic outcomes from transcriptomic data, we have selected three publicly available data sets that reported chemically induced heart pathologies in zebrafish larvae for five different chemicals. Network-based analysis detected cardiac perturbations for four out of five chemicals tested, for two of them using transcriptomic data collected up to 3 days before the onset of a visible phenotype. Additionally, we identified distinct molecular pathways that were activated by the different chemicals. The results demonstrate that the proposed integrational method can be used for evaluating the effects of chemicals on the zebrafish cardiac function and, together with observed cardiac apical end points, can provide a comprehensive method for connecting molecular events to organ toxicity. The computable network model is freely available and may be used to generate mechanistic hypotheses and quantifiable perturbation values from any zebrafish transcriptomic data.

14 October 2022 in Social Sciences & Humanities Open
Verified
Journal Article
Open access
JDJens Dörpinghaus
Jens Dörpinghaus
SKSonja Klante
Sonja Klante
MCMartin Christian
Martin Christian
CMChristof Meigen
Christof Meigen
CDCarsten Düing
Carsten Düing

19 February 2024 in Knowledge
Verified
Journal Article
Open access
PDF file
AFAndreas Fischer
Andreas Fischer
JDJens Dörpinghaus
Jens Dörpinghaus
The labor market is highly dependent on vocational and academic education, training, retraining, and further education in order to master challenges such as advancing digitalization and sustainability. Further training is a key factor in ensuring a qualified workforce, the employability of all employees, and, thus, national competitiveness and innovation. In the contribution at hand, we explore an innovative way to derive knowledge about learning pathways by connecting the dots from different data sources of the German labor market. In particular, we focus on the web mining of online resources for German labor market research and education, such as online advertisements, information portals, and official government websites. A key question for working with different data sources is how to find the ground truth and common data structures that can be used to make the data interoperable. We discuss how to classify and summarize web data from different platforms and which methods can be used for extracting data, entities and relationships from online resources on the German labor market to build a network of educational pathways. Our proposed solution is based on the classification of occupations (KldB) and related document codes (DKZ), and combines natural language processing and knowledge graph technologies. Our research provides the foundation for further investigation into educational pathways and linked data for labor market research. While our work focuses on German data, it is also useful for other German-speaking countries and could easily be extended to other languages such as English.

29 March 2022 in Knowledge and Information Systems
Verified
Journal Article
Open access
PDF file
JDJens Dörpinghaus
Jens Dörpinghaus
ASAndreas Stefan
Andreas Stefan
BSBruce Schultz
Bruce Schultz
MJMarc Jacobs
Marc Jacobs
Contextual information is widely considered for NLP and knowledge discovery in life sciences since it highly influences the exact meaning of natural language. The scientific challenge is not only to extract such context data, but also to store this data for further query and discovery approaches. Classical approaches use RDF triple stores, which have serious limitations. Here, we propose a multiple step knowledge graph approach using labeled property graphs based on polyglot persistence systems to utilize context data for context mining, graph queries, knowledge discovery and extraction. We introduce the graph-theoretic foundation for a general context concept within semantic networks and show a proof of concept based on biomedical literature and text mining. Our test system contains a knowledge graph derived from the entirety of PubMed and SCAIView data and is enriched with text mining data and domain-specific language data using Biological Expression Language. Here, context is a more general concept than annotations. This dense graph has more than 71M nodes and 850M relationships. We discuss the impact of this novel approach with 27 real-world use cases represented by graph queries. Storing and querying a giant knowledge graph as a labeled property graph is still a technological challenge. Here, we demonstrate how our data model is able to support the understanding and interpretation of biomedical data. We present several real-world use cases that utilize our massive, generated knowledge graph derived from PubMed data and enriched with additional contextual data. Finally, we show a working example in context of biologically relevant information using SCAIView.

26 September 2023 in Information
Verified
Journal Article
Open access
PDF file
JDJens Dörpinghaus
Jens Dörpinghaus
DSDavid Samray
David Samray
RHRobert Helmrich
Robert Helmrich
The German labor market relies heavily on vocational training, retraining, and continuing education. In order to match training seekers with training offers and to make the available data interoperable, we present a novel approach to automatically detect access to education and training in German training offers and advertisements and identify open research questions and areas for further research. In particular, we focus on (a) general education and school leaving certificates, (b) work experience, (c) previous apprenticeship, and (d) a list of skills provided by the German Federal Employment Agency. This novel approach combines several methods: First, we provide technical terms and classes of the education system that are used synonymously, combining different qualifications and adding obsolete terms. Second, we provide rule-based matching to identify the need for work experience or education. However, not all qualification requirements can be matched due to incompatible data schemas or non-standardized requirements such as initial tests or interviews. Although there are several shortcomings, the presented approach shows promising results for two data sets: training and retraining advertisements.

14 June 2018 in BioData Mining
Verified
Journal Article
Open access
PDF file
JDJens Dörpinghaus
Jens Dörpinghaus
SSSebastian Schaaf
Sebastian Schaaf
MJMarc Jacobs
Marc Jacobs
In text mining, document clustering describes the efforts to assign unstructured documents to clusters, which in turn usually refer to topics. Clustering is widely used in science for data retrieval and organisation. In this paper we present and discuss a novel graph-theoretical approach for document clustering and its application on a real-world data set. We will show that the well-known graph partition to stable sets or cliques can be generalized to pseudostable sets or pseudocliques. This allows to perform a soft clustering as well as a hard clustering. The software is freely available on GitHub. The presented integer linear programming as well as the greedy approach for this N P $\mathcal {NP}$ -complete problem lead to valuable results on random instances and some real-world data for different similarity measures. We could show that PS-Document Clustering is a remarkable approach to document clustering and opens the complete toolbox of graph theory to this field.