{"title":"Transformer-based literature-based discovery: Discriminative and generative formulations for Hallmarks of Cancer relationship replication.","authors":"Clint Cuffy, Logan Mills, Bridget T McInnes","doi":"10.1016/j.jbi.2026.105123","DOIUrl":"https://doi.org/10.1016/j.jbi.2026.105123","url":null,"abstract":"<p><strong>Objective: </strong>Literature-based discovery (LBD) infers implicit relationships that no single document states but that are latent across the literature. Computational LBD has been dominated by methods that embed a biomedical knowledge graph with graph-embedding algorithms. These methods draw on the graph alone, and a concept added to the graph has no representation until the embedding is retrained. We investigate whether contextual transformer encoders address these limitations for closed discovery on the Hallmarks of Cancer (HOC) benchmark.</p><p><strong>Methods: </strong>We study two formulations of LBD on a shared encoder backbone: a discriminative model that treats discovery as knowledge-graph completion and classifies candidate edges, and a generative model that predicts the embedding of the implicit linking concept and ranks candidates by cosine similarity. We compare both against established baselines, a shallow KGC model (CD-2) and multilayer perceptron (MLP) and similarity-based models, using a ranking protocol and non-parametric significance testing.</p><p><strong>Results: </strong>Both formulations replicate multiple held-out discoveries and are statistically on par with prior work, while representing any concept that has a text descriptor without retraining, which the graph-embedding baselines cannot do. A general-domain encoder (BERT) is competitive with, and on one dataset exceeds, its domain-adapted counterpart (BioBERT), and input scaling helps the generative but harms the discriminative formulation.</p><p><strong>Conclusion: </strong>Contextual encoders are viable for LBD, and how the task is posed shapes discovery-replication performance.</p>","PeriodicalId":15263,"journal":{"name":"Journal of Biomedical Informatics","volume":" ","pages":"105123"},"PeriodicalIF":5.9,"publicationDate":"2026-11-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"149406452","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"医学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Varada Khanna, Nilay Bhatt, Ikgyu Shin, Mattia Rosso, Sule Tinaz, Yang Ren, Hua Xu, Vipina K Keloth
{"title":"Toward automated cognitive assessment in Parkinson's disease using pretrained language models.","authors":"Varada Khanna, Nilay Bhatt, Ikgyu Shin, Mattia Rosso, Sule Tinaz, Yang Ren, Hua Xu, Vipina K Keloth","doi":"10.1016/j.jbi.2026.105126","DOIUrl":"https://doi.org/10.1016/j.jbi.2026.105126","url":null,"abstract":"<p><strong>Objective: </strong>Cognitive changes in Parkinson' s Disease (PD) are often difficult to capture through formal assessments alone. First-person patient narratives offer a rich source of cognitive and emotional information, but extracting structured insights from unstructured text remains challenging due to the abstract and overlapping nature of cognitive constructs. This study aims to develop and evaluate natural language processing models to automatically identify seven cognitive categories from first-person narratives written by individuals with PD.</p><p><strong>Methods: </strong>We analyzed 299 annotated narratives from 15 individuals with PD. Three model families were compared: a Bio_ClinicalBERT-based span categorization model for nested entity recognition, a fine-tuned Meta-Llama-3-8B-Instruct model using QloRA, and GPT-4o mini evaluated under zero- and few-shot settings. In addition to narrative-level evaluation, we conducted participant-grouped cross-validation to assess performance on previously unseen participant narratives.</p><p><strong>Results: </strong>Model performance varied substantially across categories and model families. In the narrative-level evaluation, the fine-tuned Meta-Llama-3-8B-Instruct achieved the highest overall performance (lenient micro-F1: 0.796 ± 0.004; macro-F1: 0.660 ± 0.009 across five random seeds), with particularly strong performance in context-dependent categories such as thought and social interaction. Under participant-grouped cross-validation, Llama achieved a mean lenient micro-F1 of 0.787 ± 0.033 and macro-F1 of 0.639 ± 0.037, compared with 0.647 ± 0.030 and 0.425 ± 0.019 for Bio_ClinicalBERT. GPT-4o mini performed substantially lower, although five-shot prompting improved performance. Overall, this task proved more challenging than conventional information extraction due to the abstract and overlapping nature of narrative cognitive accounts.</p><p><strong>Conclusion: </strong>Fine-tuned large language models show strong potential for extracting categories related to cognitive processes from patient narratives in PD. With continued refinement, and validation in cohorts spanning the full range of cognitive status, these NLP approaches could provide a foundation for future systems designed to support longitudinal cognitive monitoring and serve as a prospective complement to formal neuropsychological assessments.</p>","PeriodicalId":15263,"journal":{"name":"Journal of Biomedical Informatics","volume":" ","pages":"105126"},"PeriodicalIF":5.9,"publicationDate":"2026-11-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"149406445","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"医学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Yishu Wei, Hexin Dong, Yi Lin, Jiahe Qian, Yi Liu, Yifan Peng
{"title":"Towards end-to-end LLM-based censoring-aware survival analysis.","authors":"Yishu Wei, Hexin Dong, Yi Lin, Jiahe Qian, Yi Liu, Yifan Peng","doi":"10.1016/j.jbi.2026.105120","DOIUrl":"10.1016/j.jbi.2026.105120","url":null,"abstract":"<p><strong>Objective: </strong>Survival analysis is central to medical prediction, yet large language models (LLMs) are rarely used as end-to-end survival models because censoring prevents straightforward supervised fine-tuning. Here we present LLMSurvival, a framework that enables censoring-aware survival analysis with unmodified LLMs operating directly on tabular clinical data.</p><p><strong>Materials and methods: </strong>LLMSurvival reformulates time-to-event prediction as pairwise ranking among comparable subjects, and derives test-time risk by aggregating comparisons against anchor individuals from the training cohort.</p><p><strong>Results: </strong>Across two clinical tasks (ICU mortality prediction in MIMIC-IV and fragility fracture prediction in a NewYork-Presbyterian/Weill Cornell Medicine cohort), LLMSurvival improves overall concordance over Cox proportional hazards modeling by 3.1% for ICU mortality and 0.5% for fracture risk, and by 2.1% on average for ICU mortality and 2.8% for fracture risk over three established deep learning survival models.</p><p><strong>Discussion: </strong>The results show that survival modeling with censoring can be made compatible with LLM fine-tuning through comparison-based reformulation. The framework demonstrates high portability and superior performance over expert-curated scores like SAPS-II and FRAX scores across diverse clinical contexts. Furthermore, the framework supports local deployment, as compact, publicly available base models provide sufficient performance.</p><p><strong>Conclusion: </strong>The LLMSurvival framework serves as a proof of concept for an integrated, censoring-conscious approach to survival analysis via LLMs.</p>","PeriodicalId":15263,"journal":{"name":"Journal of Biomedical Informatics","volume":" ","pages":"105120"},"PeriodicalIF":5.9,"publicationDate":"2026-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"149394357","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"医学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"HGSAF: Heterogeneous graph structural alignment and distillation model with attentive fusion for microbe-drug association prediction.","authors":"Yanbu Guo, Quanming Guo, Jinde Cao, Montasir Qasymeh, Shengli Song, Mahmoud Abdel-Aty","doi":"10.1016/j.jbi.2026.105124","DOIUrl":"10.1016/j.jbi.2026.105124","url":null,"abstract":"<p><p>The rapid emergence of antimicrobial resistance necessitates AI-driven computational strategies to navigate the molecular diversity landscape of microbe-drug interactions. While graph neural networks have shown promise in predicting such associations, existing methods struggle with the intertwined challenges of processing topological and semantic features in isolation and handling severe class imbalance inherent in biomedical datasets. In this work, we devised a heterogeneous graph structural alignment and distillation with an attentive fusion model to predict microbe-drug associations. Our model constructs heterogeneous biological graphs alongside meta-path-induced subgraphs to capture complementary views of microbial and drug entities. A layer-adaptive graph transformer is devised to simultaneously encode topological and positional information while mitigating noise and over-smoothing. Critically, we introduce a reciprocal distillation module for dual-path heterogeneous graph learning that mutually transfers structural and semantic knowledge between pathways, eliminating the need for explicit negative sampling during representation alignment. For the final association prediction, unobserved pairs are sampled as negative examples for supervised training, following standard practice. A cross‑graph alignment loss, jointly optimized with focal loss, improves robustness against class imbalance under controlled sampling ratios (1:1 and 1:5). Extensive evaluations, including comparisons against both domain-specialized predictors and general-purpose graph neural network backbones, demonstrate that HGSAF consistently achieves superior performance and highlight the methodological robustness and potential for broader application in biomedical network analysis.</p>","PeriodicalId":15263,"journal":{"name":"Journal of Biomedical Informatics","volume":" ","pages":"105124"},"PeriodicalIF":5.9,"publicationDate":"2026-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"149370774","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"医学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Temporally consistent survival prediction for non-uniform longitudinal data","authors":"Harrison Fah , Russell Greiner , Roger A. Dixon","doi":"10.1016/j.jbi.2026.104996","DOIUrl":"10.1016/j.jbi.2026.104996","url":null,"abstract":"<div><h3>Objective:</h3><div>Traditional survival prediction models use a patient’s covariates at a single time point to estimate the time until a specific event occurs, such as death or hospital readmission. However, in many longitudinal datasets, patient covariates are recorded at multiple time points, typically with varying intervals. Our objective is to learn a survival prediction model by training on longitudinal datasets with non-uniform time intervals between covariate measurements, both within and across patient trajectories.</div></div><div><h3>Methods:</h3><div>We propose a new algorithm, Temporally Consistent Multi-Task Logistic Regression (TC-MTLR), which incorporates concepts from distributional reinforcement learning to model survival outcomes. Unlike existing dynamic survival prediction algorithms, TC-MTLR is designed to leverage the non-uniformity of longitudinal measurements. We evaluate this method against two standard and two dynamic survival prediction algorithms across three short and three long longitudinal datasets, including two related to healthcare.</div></div><div><h3>Results:</h3><div>On short datasets, TC-MTLR achieves top performance in Concordance Index (C-Index) and Uncensored Mean Average Error (MAE-Uncensored) while displaying mixed results according to Integrated Brier Score (IBS) and Pseudo-Observable MAE (MAE-PO). However, on long datasets, TC-MTLR achieves similar C-Index performance as the other survival predictions methods while outperforming them according to MAE-PO and achieving top performance according to MAE-Uncensored and IBS.</div></div><div><h3>Conclusion:</h3><div>TC-MTLR effectively utilizes the non-uniform temporal structure of longitudinal datasets, offering a competitive and often superior alternative to existing survival prediction models.</div></div>","PeriodicalId":15263,"journal":{"name":"Journal of Biomedical Informatics","volume":"176 ","pages":"Article 104996"},"PeriodicalIF":4.5,"publicationDate":"2026-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146191965","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"医学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Learning dynamic binary treatment policies under treatment selection bias: A Conservative Q-Learning approach with representation balancing","authors":"Animesh Kumar Paul, Russell Greiner","doi":"10.1016/j.jbi.2026.104994","DOIUrl":"10.1016/j.jbi.2026.104994","url":null,"abstract":"<div><h3>Objective:</h3><div>Learn safe, robust dynamic treatment regimes (DTRs) from observational trajectories that exhibit treatment selection bias, using an offline reinforcement learning (RL) approach.</div></div><div><h3>Methods:</h3><div>We propose <em>CQL-RB</em>, which augments Conservative Q-Learning (CQL) with a representation-balancing penalty based on an integral probability metric (IPM) (instantiated as either a maximum mean discrepancy (MMD) or an energy-distance penalty). The penalty aligns latent patient representations across treatment groups to reduce action-conditioned distribution shift while preserving CQL’s conservative policy estimation. We evaluate CQL-RB on two clinically realistic simulators: <em>EpiCare</em> (eight environments) and <em>AhnChemo</em> from <em>DTR-Bench</em>, both modeling longitudinal healthcare decisions with binary actions at each stage. To emulate selection bias, we implement clinician-like behavior policies that assign treatment as a function of patient covariates. Baselines include BOWL, ACWL, T-RL, RL-NN, and standard CQL. Outcomes are expected return and adverse-event counts from simulator rollouts; model selection uses weighted importance sampling off-policy evaluation on held-out data. Ablations vary both the IPM weight <span><math><mi>β</mi></math></span> and the choice of IPM metric.</div></div><div><h3>Results:</h3><div>Across all eight EpiCare environments and the challenging AhnChemo task, CQL-RB with either MMD or energy-distance penalties consistently achieves higher returns than competing methods while yielding lower (or comparable) adverse-event rates. Removing the balancing term degrades both return and safety, confirming its contribution. Performance is robust for moderate penalty weights (e.g., <span><math><mrow><mi>β</mi><mspace></mspace><mo>∈</mo><mspace></mspace><mrow><mo>{</mo><mn>1</mn><mo>,</mo><mn>10</mn><mo>,</mo><mn>100</mn><mo>}</mo></mrow></mrow></math></span>), with degradation only at overly large values (e.g., <span><math><mrow><mi>β</mi><mo>≥</mo><mn>1000</mn></mrow></math></span> for MMD or <span><math><mrow><mi>β</mi><mo>=</mo><mn>10000</mn></mrow></math></span> for energy distance).</div></div><div><h3>Conclusion:</h3><div>Representation balancing materially strengthens conservative offline RL for DTR learning under treatment selection bias. By aligning patient representations without altering CQL’s safety mechanics, CQL-RB delivers policies that are both <em>effective</em> (higher returns) and <em>safer</em> (fewer adverse events) in realistic healthcare simulations. These findings underscore the importance of addressing treatment selection bias when learning robust and safe dynamic treatment policies.</div></div>","PeriodicalId":15263,"journal":{"name":"Journal of Biomedical Informatics","volume":"176 ","pages":"Article 104994"},"PeriodicalIF":4.5,"publicationDate":"2026-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146179225","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"医学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Multi-channel causal variational autoencoder for multimodal biomedical causal disentanglement","authors":"Safaa Al-Ali, Irene Balelli, Alzheimer’s Disease Neuroimaging Initiative","doi":"10.1016/j.jbi.2026.104995","DOIUrl":"10.1016/j.jbi.2026.104995","url":null,"abstract":"<div><div>The multimodal nature of clinical assessment and decision-making, and the high rate of healthcare data generation, motivate the need to develop approaches specifically tailored to the analysis of these complex and potentially high-dimensional multimodal datasets. This poses both technical and conceptual challenges: how can such heterogeneous data be analyzed jointly? How can modality-specific information be identified from shared information? Variational autoencoders (VAEs) offer a robust framework for learning latent representations of complex data distributions, while being flexible enough to adapt to different data types and structures, and having already been successfully applied for latent disentanglement of multimodal (multi-channel) data. We aim at tackling multi-channel disentanglement from a causal perspective, and seek at identifying causal relationships between channels, beyond simple statistical associations. To do that, we propose Multi-Channel Causal VAE (MC<span><math><msup><mrow></mrow><mrow><mn>2</mn></mrow></msup></math></span>VAE), a novel causal disentanglement approach for multi-channel data, whose objective is to jointly learn modality-specific latent representations from a multi-channel dataset, and identify a causal structure between the latent channels. Each channel is projected into its own latent space, where a causal discovery step is integrated to learn the hidden causal graph. Finally, the decoder takes into account the discovered graph to predict the data. Covariate of interest can be integrated as well when available, and accounted in the causal graph structure. Extensive experiments on synthetically generated multi-channel datasets demonstrate the ability of MC<span><math><msup><mrow></mrow><mrow><mn>2</mn></mrow></msup></math></span>VAE in effectively uncovering the underlying latent causal structures across multiple channels, hence making it a strong candidate for real-world multi-channel causal disentanglement. Application to multi-channel data on neurodegeneration extracted from the Alzheimer’s Disease Neuroimaging Initiative highlights the existence of a biologically meaningful latent causal structure, whose pertinence is supported by multiple previous experimental and modeling work, and provides actionable insight for disease progression.</div></div>","PeriodicalId":15263,"journal":{"name":"Journal of Biomedical Informatics","volume":"176 ","pages":"Article 104995"},"PeriodicalIF":4.5,"publicationDate":"2026-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146137458","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"医学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A study of large language models for patient information extraction: Model architecture, fine-tuning strategy, and multi-task instruction tuning","authors":"Cheng Peng , Xinyu Dong , Mengxian Lyu , Daniel Paredes , Yaoyun Zhang , Yonghui Wu","doi":"10.1016/j.jbi.2026.105034","DOIUrl":"10.1016/j.jbi.2026.105034","url":null,"abstract":"<div><h3>Background</h3><div>Natural language processing (NLP) is a key technology to extract important patient information from clinical narratives to support healthcare applications. The rapid development of large language models (LLMs) has revolutionized patient information extraction in the clinical domain, yet critical strategies for effectively adopting LLMs for optimal performance need further exploration. This study examines LLMs’ effectiveness in patient information extraction, focusing on LLM architectures, fine-tuning strategies, and multi-task instruction tuning techniques for developing robust and generalizable patient information extraction systems.</div></div><div><h3>Methods</h3><div>This study aims to explore key strategies of adopting LLMs for clinical concept and relation extraction tasks, including: (1) encoder-only or decoder-only LLMs, (2) prompt-based parameter-efficient fine-tuning (PEFT) algorithms, and (3) multi-task instruction tuning on few-shot learning performance. We benchmarked a suite of LLMs, including encoder-only LLMs (BERT, GatorTron) and decoder-only LLMs (GatorTronGPT, Llama 3.1, GatorTronLlama), across five widely used benchmarking datasets. We compared traditional full-size fine-tuning and prompt-based PEFT. We explored a multi-task instruction tuning framework that combines both tasks across four datasets to evaluate the zero-shot and few-shot learning performance using the leave-one-dataset-out strategy.</div></div><div><h3>Results</h3><div>For single-task clinical CE, the two decoder-only LLMs (Llama 3.1 and GatorTronLlama) achieved the best performance, with average F1 scores of 0.8964 and 0.8981, respectively, across the five datasets, outperforming other LLMs with average F1 improvement of 0.7 ∼ 3.3%. Encoder-only LLMs with prompt-based learning outperformed those implemented using classification. For RE, the prompt-based PEFT strategy demonstrated remarkable performance, with an F1 improvement of up to 15.9% over traditional fine-tuning on all datasets. All three decoder-only LLMs outperformed encoder-only LLMs, increasing average F1 score by 1.8 to 6.6%, with GatorTronLlama achieving the best performance with an average F1 score of 0.8978. Multi-task instruction tuning showed remarkable improvements, boosting zero-shot and few-shot F1 scores by 1.1 ∼ 37.8% compared to those without multi-task fine-tuning. Notably, generative LLMs with multitask instruction tuning using only 20% of the full dataset achieved similar performance comparable to the full-size fine-tuning (<0.005 in terms of F1 score).</div></div><div><h3>Conclusions</h3><div>Our findings support generative LLMs with PEFT as a cost-effective solution for patient information extraction. In addition, multi-task instruction tuning significantly improves the zero-shot and few-shot performance, contributing to better generalizability. This study provides practical guidelines to develop LLM-based scalable, adaptable, and high-performing pati","PeriodicalId":15263,"journal":{"name":"Journal of Biomedical Informatics","volume":"178 ","pages":"Article 105034"},"PeriodicalIF":4.5,"publicationDate":"2026-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"147574145","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"医学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"On the transfer learning behavior of domain-specific vision–language models in screening mammography","authors":"Aisha Urooj Khan , Gokul Ramasamy , Muhammad Danish Khan , John Garrett , Tyler Bradshaw , Lonie Salkowski , Imon Banerjee","doi":"10.1016/j.jbi.2026.104986","DOIUrl":"10.1016/j.jbi.2026.104986","url":null,"abstract":"<div><div>Vision-Language models have shown remarkable performance for natural images and text. Given the homology of the anatomy, high gray-scale image dimension, and the unbalanced datasets, the traditional VLMs do not adapt well to radiological applications. In this work, we empirically adapted image encoder trained within domain-specific VLMs to be applied in two downstream tasks for 2D mammogram image analysis: tissue density estimation and BI-RADS prediction. We study the transfer learning behavior using linear probing, fine-tuning, and online self distillation. We analyze that knowledge driven domain-specific VLM backbones with frozen weights perform better than MammoClip VLM model as well as supervised baselines such as ViT and CNNs even with only 5% of training data. Generalization capabilities are further studied of these models on two external datasets.</div></div>","PeriodicalId":15263,"journal":{"name":"Journal of Biomedical Informatics","volume":"175 ","pages":"Article 104986"},"PeriodicalIF":4.5,"publicationDate":"2026-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146043748","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"医学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Ziqian Qiao , Shaofu Lin , Jiatong Fan , Jianhui Chen , Zhiyi Tang , Zitong Zhang
{"title":"KATMed: a knowledge-augmented transformer model for contraindication-aware medication recommendation in comorbidities","authors":"Ziqian Qiao , Shaofu Lin , Jiatong Fan , Jianhui Chen , Zhiyi Tang , Zitong Zhang","doi":"10.1016/j.jbi.2026.104991","DOIUrl":"10.1016/j.jbi.2026.104991","url":null,"abstract":"<div><div>Drug-disease contraindications in comorbidities (DDCC) pose a significant challenge and priority in clinical treatment. These contraindications exhibit a prototypical long-tail distribution, characterized by low-frequency, highly diverse, and substantial individual variability. Such distinct properties impose significant limitations on electronic health record-based medication recommendation modeling, ultimately elevating safety risks in clinical practice. To address this challenge, this study proposes KATMed, a knowledge-augmented transformer model for contraindication-aware medication recommendation in comorbidities. The model employs Transformer-based encoding of patient records and leverages two self-supervised tasks to capture rich temporal and semantic dependencies. Based on this foundation, a hybrid knowledge-augmented framework is developed to integrate bidirectional medication-related clinical associations. Positive disease-procedure associations are modeled by using a dynamic semantic relevance matrix to expand the input information, thereby enhancing the model’s feature learning capability on sparse yet diverse comorbidity records. Negative DDCC rules are incorporated as differentiable logical constraints in the loss function to suppress unsafe medications. Experiments on the MIMIC-III and MIMIC-IV datasets show that KATMed significantly improves performance, achieving a 5.2% increase in accuracy and a 2.04% reduction in safety violations.</div></div>","PeriodicalId":15263,"journal":{"name":"Journal of Biomedical Informatics","volume":"175 ","pages":"Article 104991"},"PeriodicalIF":4.5,"publicationDate":"2026-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146100243","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"医学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}