{"title":"索引数据块上的项集挖掘","authors":"Elena Baralis, T. Cerquitelli, S. Chiusano","doi":"10.1109/IS.2006.348526","DOIUrl":null,"url":null,"abstract":"This paper presents a novel index, called I-Forest, to support data mining activities on evolving databases, whose content is periodically updated through insertion (or deletion) of data blocks. I-Forest allows the extraction of itemsets from transactional databases such as transactional data from large retail chains. Item, support and time constraints may be enforced during the extraction phase. The proposed index is a covering index that represents transactional blocks in a succinct form and allows different kinds of analysis (e.g., analyze quarterly data). During the creation phase no support constraint is enforced. Thus, the index provides a complete representation of the evolving data. The I-Forest index has been implemented Into the Post-greSQL open source DBMS and exploits its physical level access methods. Experiments have been run for both sparse and dense data distributions. The execution time of the frequent itemset extraction task exploiting the index is always comparable with and for low support threshold faster than the Prefix-Tree algorithm accessing static data on at file","PeriodicalId":116809,"journal":{"name":"2006 3rd International IEEE Conference Intelligent Systems","volume":"17 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Itemset Mining on Indexed Data Blocks\",\"authors\":\"Elena Baralis, T. Cerquitelli, S. Chiusano\",\"doi\":\"10.1109/IS.2006.348526\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper presents a novel index, called I-Forest, to support data mining activities on evolving databases, whose content is periodically updated through insertion (or deletion) of data blocks. I-Forest allows the extraction of itemsets from transactional databases such as transactional data from large retail chains. Item, support and time constraints may be enforced during the extraction phase. The proposed index is a covering index that represents transactional blocks in a succinct form and allows different kinds of analysis (e.g., analyze quarterly data). During the creation phase no support constraint is enforced. Thus, the index provides a complete representation of the evolving data. The I-Forest index has been implemented Into the Post-greSQL open source DBMS and exploits its physical level access methods. Experiments have been run for both sparse and dense data distributions. The execution time of the frequent itemset extraction task exploiting the index is always comparable with and for low support threshold faster than the Prefix-Tree algorithm accessing static data on at file\",\"PeriodicalId\":116809,\"journal\":{\"name\":\"2006 3rd International IEEE Conference Intelligent Systems\",\"volume\":\"17 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2006 3rd International IEEE Conference Intelligent Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IS.2006.348526\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2006 3rd International IEEE Conference Intelligent Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IS.2006.348526","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
This paper presents a novel index, called I-Forest, to support data mining activities on evolving databases, whose content is periodically updated through insertion (or deletion) of data blocks. I-Forest allows the extraction of itemsets from transactional databases such as transactional data from large retail chains. Item, support and time constraints may be enforced during the extraction phase. The proposed index is a covering index that represents transactional blocks in a succinct form and allows different kinds of analysis (e.g., analyze quarterly data). During the creation phase no support constraint is enforced. Thus, the index provides a complete representation of the evolving data. The I-Forest index has been implemented Into the Post-greSQL open source DBMS and exploits its physical level access methods. Experiments have been run for both sparse and dense data distributions. The execution time of the frequent itemset extraction task exploiting the index is always comparable with and for low support threshold faster than the Prefix-Tree algorithm accessing static data on at file