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