药师分配的学习排序方法

Lv Hexin, Xinli Yang, Guoyong Dai
{"title":"药师分配的学习排序方法","authors":"Lv Hexin, Xinli Yang, Guoyong Dai","doi":"10.1109/ICCRD51685.2021.9386461","DOIUrl":null,"url":null,"abstract":"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.","PeriodicalId":294200,"journal":{"name":"2021 IEEE 13th International Conference on Computer Research and Development (ICCRD)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-01-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"A Learning to Rank Approach for Pharmacist Assignment\",\"authors\":\"Lv Hexin, Xinli Yang, Guoyong Dai\",\"doi\":\"10.1109/ICCRD51685.2021.9386461\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"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.\",\"PeriodicalId\":294200,\"journal\":{\"name\":\"2021 IEEE 13th International Conference on Computer Research and Development (ICCRD)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-01-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2021 IEEE 13th International Conference on Computer Research and Development (ICCRD)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCRD51685.2021.9386461\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 IEEE 13th International Conference on Computer Research and Development (ICCRD)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCRD51685.2021.9386461","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

随着人们对健康的关注越来越多,对中医的需求也在急剧增加。中医处方有成千上万种。不同的药剂师熟悉不同的处方,一个药剂师不可能处理好所有的处方。因此,有必要为每个处方找到最合适的药剂师,以提高药剂师处理处方的质量和效率。为了解决这个问题,我们提出了一种利用学习排序算法的新方法。通过我们的方法建立的模型可以用来自动推荐哪个药剂师最适合未知的标签处方。通过对中药数据集的实验,我们证明了我们的方法可以更好地实现药师分配。特别是,与基线相比,我们的方法在MAP方面可以实现300%以上的改进。通过学习排序的方法,可以实现不同种类中药处方的自动药师分配,提高药师处理处方的质量和效率。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
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.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信