卫生所库存物品聚类方法的比较

Oki Derajat Sudarmojo, Purwanto, M. Soeleman
{"title":"卫生所库存物品聚类方法的比较","authors":"Oki Derajat Sudarmojo, Purwanto, M. Soeleman","doi":"10.1109/iSemantic55962.2022.9920416","DOIUrl":null,"url":null,"abstract":"Clinics are health service facilities for the community that provides medical services, but sometimes some clinics do not have the stock of goods needed by the community. This is because the inventory management system does not always update the stock of goods that are empty or piled up. The problem is certainly detrimental to the clinic and the community. Because this is done optimization on the stock of goods. One way to group goods is to use the clustering method. In this study, the author will compare the X-Means Algorithm, K-Means Algorithm, and K-Medoids Algorithm, to compare which algorithm is more optimal in grouping stock items at Health Clinic. The results obtained using 3 clusters show that the X-Means Algorithm has the smallest DBI value of 0.075. So that we can conclude that the X-Means algorithm is more optimal than the K-Means algorithm and the K-Medoids algorithm.","PeriodicalId":360042,"journal":{"name":"2022 International Seminar on Application for Technology of Information and Communication (iSemantic)","volume":"1440 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Comparison of Clustering Methods for Health Clinic Stock Goods\",\"authors\":\"Oki Derajat Sudarmojo, Purwanto, M. Soeleman\",\"doi\":\"10.1109/iSemantic55962.2022.9920416\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Clinics are health service facilities for the community that provides medical services, but sometimes some clinics do not have the stock of goods needed by the community. This is because the inventory management system does not always update the stock of goods that are empty or piled up. The problem is certainly detrimental to the clinic and the community. Because this is done optimization on the stock of goods. One way to group goods is to use the clustering method. In this study, the author will compare the X-Means Algorithm, K-Means Algorithm, and K-Medoids Algorithm, to compare which algorithm is more optimal in grouping stock items at Health Clinic. The results obtained using 3 clusters show that the X-Means Algorithm has the smallest DBI value of 0.075. So that we can conclude that the X-Means algorithm is more optimal than the K-Means algorithm and the K-Medoids algorithm.\",\"PeriodicalId\":360042,\"journal\":{\"name\":\"2022 International Seminar on Application for Technology of Information and Communication (iSemantic)\",\"volume\":\"1440 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-09-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2022 International Seminar on Application for Technology of Information and Communication (iSemantic)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/iSemantic55962.2022.9920416\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 International Seminar on Application for Technology of Information and Communication (iSemantic)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/iSemantic55962.2022.9920416","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

诊所是为社区提供医疗服务的保健服务设施,但有时一些诊所没有社区所需的物资库存。这是因为库存管理系统并不总是更新空的或堆积的货物的库存。这个问题肯定对诊所和社区有害。因为这是在商品库存上做的优化。对商品进行分组的一种方法是使用聚类方法。在本研究中,笔者将比较X-Means算法、K-Means算法和K-Medoids算法,比较哪种算法在卫生所库存物品分组中更优。3个聚类的结果表明,X-Means算法的DBI值最小,为0.075。因此,我们可以得出结论,X-Means算法比K-Means算法和K-Medoids算法更优。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Comparison of Clustering Methods for Health Clinic Stock Goods
Clinics are health service facilities for the community that provides medical services, but sometimes some clinics do not have the stock of goods needed by the community. This is because the inventory management system does not always update the stock of goods that are empty or piled up. The problem is certainly detrimental to the clinic and the community. Because this is done optimization on the stock of goods. One way to group goods is to use the clustering method. In this study, the author will compare the X-Means Algorithm, K-Means Algorithm, and K-Medoids Algorithm, to compare which algorithm is more optimal in grouping stock items at Health Clinic. The results obtained using 3 clusters show that the X-Means Algorithm has the smallest DBI value of 0.075. So that we can conclude that the X-Means algorithm is more optimal than the K-Means algorithm and the K-Medoids algorithm.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信