用于医疗保健服务组合管理的多维数据挖掘

J. Chiang, Sheng-Yin Huang
{"title":"用于医疗保健服务组合管理的多维数据挖掘","authors":"J. Chiang, Sheng-Yin Huang","doi":"10.1109/ICCMA.2013.6506172","DOIUrl":null,"url":null,"abstract":"Data Mining is one of the most significant tools for discovering association patterns that are useful in for health services, Customer Relationship Management (CRM) etc. Yet, there are some drawbacks in conventional mining techniques. Since most of them perform the plain mining based on predefined schemata through the data warehouse as a whole, a re-scan must be done whenever new attributes are added. Secondly, an association rule may be true on a certain granularity but fail on a smaller one and vise verse. Last but not least, they are usually designed specifically to find either frequent or infrequent rules. With regard to healthcare service management, this research aims at providing a novel data schema and an algorithm to solve the aforementioned problems. A forest of concept taxonomies is used as the data structure for representing healthcare associations patterns that consist of concepts picked up from various taxonomies. Then, the mining process is formulated as a combination of finding the large itemsets, generating, updating and output the association patterns. Crucial mechanisms in each step will be clarified. At last, this paper presents experimental results regarding efficiency, scalability, information loss, etc. of the proposed approach to prove the advents of the approach.","PeriodicalId":187834,"journal":{"name":"2013 International Conference on Computer Medical Applications (ICCMA)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"Multidimensional data mining for healthcare service portfolio management\",\"authors\":\"J. Chiang, Sheng-Yin Huang\",\"doi\":\"10.1109/ICCMA.2013.6506172\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Data Mining is one of the most significant tools for discovering association patterns that are useful in for health services, Customer Relationship Management (CRM) etc. Yet, there are some drawbacks in conventional mining techniques. Since most of them perform the plain mining based on predefined schemata through the data warehouse as a whole, a re-scan must be done whenever new attributes are added. Secondly, an association rule may be true on a certain granularity but fail on a smaller one and vise verse. Last but not least, they are usually designed specifically to find either frequent or infrequent rules. With regard to healthcare service management, this research aims at providing a novel data schema and an algorithm to solve the aforementioned problems. A forest of concept taxonomies is used as the data structure for representing healthcare associations patterns that consist of concepts picked up from various taxonomies. Then, the mining process is formulated as a combination of finding the large itemsets, generating, updating and output the association patterns. Crucial mechanisms in each step will be clarified. At last, this paper presents experimental results regarding efficiency, scalability, information loss, etc. of the proposed approach to prove the advents of the approach.\",\"PeriodicalId\":187834,\"journal\":{\"name\":\"2013 International Conference on Computer Medical Applications (ICCMA)\",\"volume\":\"25 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-04-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 International Conference on Computer Medical Applications (ICCMA)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCMA.2013.6506172\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 International Conference on Computer Medical Applications (ICCMA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCMA.2013.6506172","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

摘要

数据挖掘是发现关联模式的最重要工具之一,这些模式在医疗服务、客户关系管理(CRM)等领域非常有用。然而,传统的采矿技术也有一些缺点。由于它们中的大多数通过整个数据仓库执行基于预定义模式的普通挖掘,因此每当添加新属性时都必须进行重新扫描。其次,关联规则在特定粒度上可能是正确的,但在较小粒度上可能会失败,反之亦然。最后但并非最不重要的是,它们通常专门用于查找频繁或不频繁的规则。在医疗服务管理方面,本研究旨在提供一种新的数据模式和算法来解决上述问题。概念分类法林用作表示医疗保健关联模式的数据结构,这些模式由从各种分类法中获取的概念组成。然后,将挖掘过程表述为查找大型项目集、生成、更新和输出关联模式的组合。将阐明每一步的关键机制。最后给出了该方法的效率、可扩展性、信息丢失等方面的实验结果,证明了该方法的优越性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Multidimensional data mining for healthcare service portfolio management
Data Mining is one of the most significant tools for discovering association patterns that are useful in for health services, Customer Relationship Management (CRM) etc. Yet, there are some drawbacks in conventional mining techniques. Since most of them perform the plain mining based on predefined schemata through the data warehouse as a whole, a re-scan must be done whenever new attributes are added. Secondly, an association rule may be true on a certain granularity but fail on a smaller one and vise verse. Last but not least, they are usually designed specifically to find either frequent or infrequent rules. With regard to healthcare service management, this research aims at providing a novel data schema and an algorithm to solve the aforementioned problems. A forest of concept taxonomies is used as the data structure for representing healthcare associations patterns that consist of concepts picked up from various taxonomies. Then, the mining process is formulated as a combination of finding the large itemsets, generating, updating and output the association patterns. Crucial mechanisms in each step will be clarified. At last, this paper presents experimental results regarding efficiency, scalability, information loss, etc. of the proposed approach to prove the advents of the approach.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信