Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Drahomira Herrmannova

dblp:120/1448 · also Dasha Herrmannova · DBLP profile ↗
← Back
7ranked-venue papers
2as first author
3since 2021 · last 2026
0000-0002-2730-1546ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 5 · 2 first-author · 2 since 2021Databases, data management, data science and information retrieval · 2 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 2 · 2 since 2021Systems, architecture and hardware · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Parallel and multicore computing · 75% GPUs and heterogeneous computing · 25%
Databases, data mining, and information retrieval
2 papers
Information retrieval · 69% Data mining · 31%

Topics — the 5 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Parallel and multicore computing › parallel algorithms › graph algorithms
all-pairs shortest paths
0.412020
Scalable knowledge graph analytics at 136 petaflop/s · SC 2020
Parallel and multicore computing › parallel algorithms
distributed-memory parallel algorithms
0.412020
Scalable knowledge graph analytics at 136 petaflop/s · SC 2020
GPUs and heterogeneous computing
GPU computing
0.412020
Scalable knowledge graph analytics at 136 petaflop/s · SC 2020
Parallel and multicore computing
graph processing
0.412020
Scalable knowledge graph analytics at 136 petaflop/s · SC 2020
Data mining › structured data mining
relational data mining
0.112020
Scalable knowledge graph analytics at 136 petaflop/s · SC 2020

Methods — techniques the papers use, named apart from their topics

semiring algebra · 0.9floyd-warshall algorithm · 0.9web mining · 0.3
YearPublicationVenuePosition
2026 Deformable phrase level attention: A flexible approach for improving AI based medical coding
abstract
OBJECTIVE: Improving the AI-driven automated medical encoding of clinical text plays a vital role in gathering information on the occurrence of diseases to improve population-level health. This work presents a novel attention mechanism designed to enhance text classification models and ensure appropriate classification of medical concepts in unstructured electronic health records. MATERIALS AND METHODS: We developed a deformable, phrase-level attention mechanism to identify important lexical word-level and contextual phrase-level information from clinical text documents. We evaluated conventional and transformer-based deep learning models that we extended with our attention mechanism on the extraction of critical cancer information (e.g., site, subsite, laterality, histology, behavior) from 629,908 electronic pathology reports and on the automated medical encoding of 52,722 hospital discharge summaries. RESULTS: Transformer-based models with the deformable, phrase-level attention mechanism achieved the best performance on the extraction of critical cancer information from pathology reports. Conventional- and transformer-based models show similar or better performance than their baseline counterparts on the automated medical encoding of clinical documents. DISCUSSION: The addition of phrase-level information allowed models extended with our proposed method to outperform standard word-level attention. Our method showed favorable properties for the real-world application in terms of model robustness and phenotyping. These results indicate that our method is promising for automated data harmonization for common data models. CONCLUSION: This work proposes a novel deformable, phrase-level attention mechanism that enhances text classification models in the extraction of medical concepts from clinical text documents. We demonstrate strong performances on two clinical text datasets and showcase real-world deployability of our method.
Christoph Metzner, Shang Gao 0008, Drahomira Herrmannova, John Gounley, Heidi A. Hanson
Artif. Intell. Medicine3
2024 Attention Mechanisms in Clinical Text Classification: A Comparative Evaluation
abstract
Attention mechanisms are now a mainstay architecture in neural networks and improve the performance of biomedical text classification tasks. In particular, models that perform automated medical encoding of clinical documents make extensive use of the label-wise attention mechanism. A label-wise attention mechanism increases a model's discriminatory ability by using label-specific reference information. This information can either be implicitly learned during training or explicitly provided through embedded textual code descriptions or information on the code hierarchy; however, contemporary studies arbitrarily select the type of label-specific reference information. To address this shortcoming, we evaluated label-wise attention initialized with either implicit or explicit label-specific reference information against two common baseline methods-target-attention and text-encoder architecture-specific methods-to generate document embeddings across four text-encoder architectures-a convolutional neural network, two recurrent neural networks, and a transformer. We also present an extension of label-wise attention that can embed the information on the code hierarchy. We performed our experiments on the MIMIC III dataset, which is a standard dataset in the clinical text classification domain. Our experiments showed that using pretrained reference information and the hierarchical design helped improve classification performance. These performance improvements had less impact on larger datasets and label spaces across all text-encoder architectures. In our analysis, we used an attention mechanism's energy scores to explain the perceived differences in performance and interpretability between the text-encoder architectures and types of label-attention.
Christoph S. Metzner, Shang Gao 0008, Drahomira Herrmannova, Elia Lima-Walton, Heidi A. Hanson
IEEE J. Biomed. Health Informatics3
2021 Visual Understanding of COVID-19 Knowledge Graph for Predictive Analysis
abstract
This study aims to effectively analyze and visualize the concept to concept network derived from the COVID-19 Open Research Dataset (CORD-19) dataset, where we have more than 48,000 concepts with more than 300,000 relationships between concepts. In analyzing networks, we focus on finding relationship patterns between the coronavirus disease 2019 (COVID-19) concepts and other concepts. Given the node and edge datasets, we construct directional graphs and calculate all pair shortest paths based on multiple edge weight schemes. However, statistical metrics are not sufficient to identify specific relationships represented in the network. Therefore, we also propose a visual analytics approach to effectively understand the knowledge graph. Our highly interactive visual analytics allows users to effectively analyze the evolving graphs and (COVID-19) concept nodes and other nodes related to the COVID-19 nodes. We envision that this study will pave the path to develop strategies to provide more accurate and scalable predictive analysis on knowledge graphs related to CORD19 and other biomedical knowledge graphs.
Seung-Hwan Lim, Junghoon Chae, Guojing Cong, Drahomira Herrmannova, Robert M. Patton, Ramakrishnan Kannan, Thomas E. Potok
IEEE BigData4
2020 Scalable knowledge graph analytics at 136 petaflop/s
abstract
We are motivated by newly proposed methods for data mining large-scale corpora of scholarly publications, such as the full biomedical literature, which may consist of tens of millions of papers spanning decades of research. In this setting, analysts seek to discover how concepts relate to one another. They construct graph representations from annotated text databases and then formulate the relationship-mining problem as one of computing all-pairs shortest paths (APSP), which becomes a significant bottleneck. In this context, we present a new high-performance algorithm and implementation of the Floyd-Warshall algorithm for distributed-memory parallel computers accelerated by GPUs, which we call DSNAPSHOT (Distributed Accelerated Semiring All-Pairs Shortest Path). For our largest experiments, we ran DSNAPSHOT on a connected input graph with millions of vertices using 4, 096nodes (24,576GPUs) of the Oak Ridge National Laboratory's Summit supercomputer system. We find DSNAPSHOT achieves a sustained performance of $136\times 10^{15}$ floating-point operations per second (136petaflop/s) at a parallel efficiency of 90% under weak scaling and, in absolute speed, 70% of the best possible performance given our computation (in the single-precision tropical semiring or “min-plus” algebra). Looking forward, we believe this novel capability will enable the mining of scholarly knowledge corpora when embedded and integrated into artificial intelligence-driven natural language processing workflows at scale.
Ramakrishnan Kannan, Piyush Sao, Hao Lu 0001, Drahomira Herrmannova, Vijay Thakkar, Robert M. Patton, Richard W. Vuduc, Thomas E. Potok
SC4
2018 Research Collaboration Analysis Using Text and Graph Features
Drahomira Herrmannova, Petr Knoth, Christopher G. Stahl, Robert M. Patton, Jack C. Wells
CICLing (2)1
2018 Analyzing Citation-Distance Networks for Evaluating Publication Impact
Drahomira Herrmannova, Petr Knoth, Robert M. Patton
LREC1
2017 Workshop on Scholarly Web Mining (SWM 2017)
abstract
No abstract available.
Robert M. Patton, Thomas E. Potok, Petr Knoth, Drahomira Herrmannova
WSDM4