Applicability Condition Extraction for Therapeutic Drug-Disease Relations
Quick Answer
This paper introduces the task of applicability condition extraction for drug-disease relations, presenting a novel dataset with 1,119 annotated pairs.
Quick Take
This paper introduces the task of applicability condition extraction for drug-disease relations, presenting a novel dataset with 1,119 annotated pairs. A new method enhancing LoRA shows superior performance over existing baselines in extracting context-specific conditions from biomedical literature.
Key Points
- First dataset with 1,119 drug-disease-applicability condition triples created.
- New method enhances LoRA to improve extraction performance.
- Systematic evaluation shows consistent outperformance over strong baselines.
- Focus on context-specific conditions crucial for clinical decision-making.
Paper Resources
Article Excerpt
From source RSS / original summaryarXiv:2606. 14031v1 Announce Type: new Abstract: Identifying conditions that a certain drug takes therapeutic effect on a target disease is crucial for clinical decision-making support. However, most existing biomedical information extraction methods have focused on identifying only relations between drugs and diseases, while largely overlooking the context-specific conditions where such relations can apply.
To address this problem, we introduce the task of applicability condition extraction for therapeutic drug--disease relations from biomedical research literature. We create the first dataset that has manually annotated triples of drugs, diseases, and applicability conditions on biomedical paper abstracts with 1,119 drug-disease pairs. Using this dataset, we systematically evaluate the performance of a range of existing methods.
In addition, we propose a new method that enhances LoRA to consider relations between drugs and diseases. Our method consistently outperforms strong baselines across different evaluation settings. The source code and dataset of this paper can be obtained from: https://github. com/guantingluo98/Drug-ACE
Reader Mode unavailable (could not extract clean content).
Want this in your inbox every morning?
Daily brief at your local 8am — bilingual EN/中文, free.
More from arXiv cs.AI
See more →Arbor: Tree Search as a Cognition Layer for Autonomous Agents
Arbor introduces a multi-agent framework utilizing structured tree search for optimizing LLM inference, achieving up to 193% throughput-latency improvement compared to vendor-optimized systems. It employs an Orchestrator and Critic agent for stability and coordination, demonstrating hardware-agnostic performance with minimal variance.