【24h】

Domain Adaptation for Disease Phrase Matching with Adversarial Networks

机译:与对抗网络匹配的疾病短语匹配域

获取原文

摘要

With the development of medical information management, numerous medical data are being classified, indexed, and searched in various systems. Disease phrase matching, i.e., deciding whether two given disease phrases interpret each other, is a basic but crucial preprocessing step for the above tasks. Being capable of relieving the scarceness of annotations, domain adaptation is generally considered useful in medical systems. However, efforts on applying it to phrase matching remain limited. This paper presents a domain-adaptive matching network for disease phrases. Our network achieves domain adaptation by adversarial training, i.e., preferring features indicating whether the two phrases match, rather than which domain they come from. Experiments suggest that our model has the best performance among the very few non-adaptive or adaptive methods that can benefit from out-of-domain annotations.
机译:随着医学信息管理的发展,在各种系统中对许多医学数据进行分类,索引和搜索。疾病短语匹配,即确定两个给定的疾病短语是否相互解释,是上述任务的基本但至关重要的预处理步骤。由于能够缓解注释的稀缺性,通常认为域自适应在医疗系统中很有用。但是,将其应用于短语匹配的努力仍然有限。本文提出了一种针对疾病短语的领域自适应匹配网络。我们的网络通过对抗性训练来实现领域适应,即偏爱表示两个词组是否匹配的特征,而不是表示它们来自哪个领域的特征。实验表明,在可从域外注释中受益的极少数非自适应或自适应方法中,我们的模型具有最佳性能。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号