Research on Method of Tree Structure Selecting Optimal Medication Granularity Based on of Multi-granularity Decision System

Yucheng Xue, Xiajiong Shen, Lei Zhang, Daojun Han, Tongyuan Qi
{"title":"Research on Method of Tree Structure Selecting Optimal Medication Granularity Based on of Multi-granularity Decision System","authors":"Yucheng Xue, Xiajiong Shen, Lei Zhang, Daojun Han, Tongyuan Qi","doi":"10.1109/ICCSE.2019.8845437","DOIUrl":null,"url":null,"abstract":"In recent years, the cancer incidence rate has generally increased on a global scale and there are around a thousand anticancer drugs available in the market now. Doctors can only choose effective drugs based on existing knowledge and experience without automated tools. The granularity selection about the drugs is consistent with multi-granularity decision making system for optimal granularity. The system mainly stems from two parts, global and local optimal granularity selections. This paper proposes to use the tree structure to select the global optimal granularity by improving traditional method and providing the specific algorithm. Parallel processing is conducted to solve the long-time consumption problems. To conclude is the tree structure can efficiently save plenty of time to solve the global optimal granularity problems by comparative analysis. Besides, the larger the amount of patient data, the more time saved. The local optimal granularity selection with parallel processing can save nearly half of the time, which provides automated aids and more time for doctors to choose better anticancer drugs.","PeriodicalId":351346,"journal":{"name":"2019 14th International Conference on Computer Science & Education (ICCSE)","volume":"49 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 14th International Conference on Computer Science & Education (ICCSE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCSE.2019.8845437","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

In recent years, the cancer incidence rate has generally increased on a global scale and there are around a thousand anticancer drugs available in the market now. Doctors can only choose effective drugs based on existing knowledge and experience without automated tools. The granularity selection about the drugs is consistent with multi-granularity decision making system for optimal granularity. The system mainly stems from two parts, global and local optimal granularity selections. This paper proposes to use the tree structure to select the global optimal granularity by improving traditional method and providing the specific algorithm. Parallel processing is conducted to solve the long-time consumption problems. To conclude is the tree structure can efficiently save plenty of time to solve the global optimal granularity problems by comparative analysis. Besides, the larger the amount of patient data, the more time saved. The local optimal granularity selection with parallel processing can save nearly half of the time, which provides automated aids and more time for doctors to choose better anticancer drugs.
基于多粒度决策系统的树状结构选择最优用药粒度方法研究
近年来,癌症发病率在全球范围内普遍上升,目前市场上有大约一千种抗癌药物。在没有自动化工具的情况下,医生只能根据现有的知识和经验选择有效的药物。药物粒度选择符合多粒度决策系统的最优粒度选择。该系统主要从全局最优粒度选择和局部最优粒度选择两部分入手。本文通过对传统方法的改进,提出了采用树状结构选择全局最优粒度的方法,并给出了具体的算法。通过并行处理,解决了长时间消耗的问题。对比分析表明,树形结构可以有效地节省求解全局最优粒度问题的时间。此外,患者数据量越大,节省的时间就越多。并行处理的局部最优粒度选择可以节省近一半的时间,为医生选择更好的抗癌药物提供了自动化的帮助和更多的时间。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信