基于数据集的广义关联规则后挖掘

H. Brahmi
{"title":"基于数据集的广义关联规则后挖掘","authors":"H. Brahmi","doi":"10.1109/ICOIN.2019.8718147","DOIUrl":null,"url":null,"abstract":"Data warehouses provide decision makers with the necessary tools to help them understand their data. The structural complexity of the data is maintained through multidimensional data views commonly called data cubes. Mining such data is still an open problem as few approaches really take the specificities of this framework into account (e.g. multidimensionality, hierarchies, measures). In this paper, we introduce a novel approach that post-mines generalized association rules by exploiting the dimension hierarchies that feature data warehouses. We define the concepts related to our problem as well as the associated algorithm. Carried out experiments show the significance of our approach.","PeriodicalId":422041,"journal":{"name":"2019 International Conference on Information Networking (ICOIN)","volume":"43 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Post-Mining of Generalized Association Rules from Data Cubes\",\"authors\":\"H. Brahmi\",\"doi\":\"10.1109/ICOIN.2019.8718147\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Data warehouses provide decision makers with the necessary tools to help them understand their data. The structural complexity of the data is maintained through multidimensional data views commonly called data cubes. Mining such data is still an open problem as few approaches really take the specificities of this framework into account (e.g. multidimensionality, hierarchies, measures). In this paper, we introduce a novel approach that post-mines generalized association rules by exploiting the dimension hierarchies that feature data warehouses. We define the concepts related to our problem as well as the associated algorithm. Carried out experiments show the significance of our approach.\",\"PeriodicalId\":422041,\"journal\":{\"name\":\"2019 International Conference on Information Networking (ICOIN)\",\"volume\":\"43 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2019 International Conference on Information Networking (ICOIN)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICOIN.2019.8718147\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 International Conference on Information Networking (ICOIN)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICOIN.2019.8718147","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

数据仓库为决策者提供了必要的工具,帮助他们理解数据。数据的结构复杂性是通过通常称为数据立方体的多维数据视图来维护的。挖掘这样的数据仍然是一个开放的问题,因为很少有方法真正考虑到这个框架的特殊性(例如多维度、层次结构、度量)。在本文中,我们引入了一种新的方法,通过利用数据仓库特征的维度层次结构,对广义关联规则进行后挖掘。我们定义了与问题相关的概念以及相关的算法。实验结果表明了该方法的意义。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Post-Mining of Generalized Association Rules from Data Cubes
Data warehouses provide decision makers with the necessary tools to help them understand their data. The structural complexity of the data is maintained through multidimensional data views commonly called data cubes. Mining such data is still an open problem as few approaches really take the specificities of this framework into account (e.g. multidimensionality, hierarchies, measures). In this paper, we introduce a novel approach that post-mines generalized association rules by exploiting the dimension hierarchies that feature data warehouses. We define the concepts related to our problem as well as the associated algorithm. Carried out experiments show the significance of our 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学术官方微信