首页> 外文会议>IEEE International Conference on Computer Research and Development >A Learning to Rank Approach for Pharmacist Assignment
【24h】

A Learning to Rank Approach for Pharmacist Assignment

机译:学习药剂师分配的方法

获取原文

摘要

With people focus much more on their health, the need of Chinese medicine is increasing heavily. There are thousands of kinds of Chinese medicine prescriptions. Different pharmacists are familiar with different prescriptions and a single pharmacist is not likely to deal with all the prescriptions well. Therefore, there is a need to find the most proper pharmacist for each prescription so that the quality and efficiency for pharmacists dealing with prescriptions can be improved.To solve the problem, we propose a novel approach by leveraging learning to rank algorithm. The model built by our approach can be used to automatically recommend which pharmacist is the most proper for an unknown labeled prescription.With experiments on a Chinese medicine dataset, we demonstrate that our approach can better achieve pharmacist assignment. In particular, when compared with the baseline, our approach can achieve an improvement of over 300% in terms of MAP.With the learning to rank approach, we can achieve automated pharmacist assignment for different kinds of Chinese medicine prescriptions and improve the quality and efficiency for pharmacists dealing with prescriptions.
机译:人们对他们的健康更多地关注更多,中药的需要越来越大。有数千种中医处方。不同的药剂师熟悉不同的处方,单一的药剂师不太可能与所有处方处理。因此,需要为每个处方找到最适合的药剂师,以便可以提高处理处方的药剂师的质量和效率。要解决问题,我们通过利用学习来提出一种新的方法来排序算法。我们的方法构建的模型可用于自动推荐哪些药剂师最适合未知标记的处方。在中医数据集中,我们证明我们的方法可以更好地实现药剂师分配。特别是,与基线相比,我们的方法可以在地图方面实现超过300%的提高。在学习对方法进行学习,我们可以实现针对不同种类的中医处方的自动药剂师分配,提高质量和效率对于处理处方的药剂师。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号