{"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}
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.