{"title":"维护用于事务插入的dbv树","authors":"H. Le, Thien-Phuong Le, Bay Vo, T. Hong","doi":"10.1109/TAAI.2012.31","DOIUrl":null,"url":null,"abstract":"In this paper, we present an incremental mining algorithm for handling the mining problem from inserted transactions. The algorithm is based on the Dynamic Bit-Vector (DBV) structure and pre-large item sets. The DBV structure facilitates the processes for maintaining large and pre-large item sets. The pre-large concept is used to reduce the number of database scans. The experimental results show that the proposed algorithm is faster than some other algorithms.","PeriodicalId":385063,"journal":{"name":"2012 Conference on Technologies and Applications of Artificial Intelligence","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Maintenance of DBV-Trees for Transaction Insertion\",\"authors\":\"H. Le, Thien-Phuong Le, Bay Vo, T. Hong\",\"doi\":\"10.1109/TAAI.2012.31\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we present an incremental mining algorithm for handling the mining problem from inserted transactions. The algorithm is based on the Dynamic Bit-Vector (DBV) structure and pre-large item sets. The DBV structure facilitates the processes for maintaining large and pre-large item sets. The pre-large concept is used to reduce the number of database scans. The experimental results show that the proposed algorithm is faster than some other algorithms.\",\"PeriodicalId\":385063,\"journal\":{\"name\":\"2012 Conference on Technologies and Applications of Artificial Intelligence\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-11-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2012 Conference on Technologies and Applications of Artificial Intelligence\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/TAAI.2012.31\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 Conference on Technologies and Applications of Artificial Intelligence","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/TAAI.2012.31","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Maintenance of DBV-Trees for Transaction Insertion
In this paper, we present an incremental mining algorithm for handling the mining problem from inserted transactions. The algorithm is based on the Dynamic Bit-Vector (DBV) structure and pre-large item sets. The DBV structure facilitates the processes for maintaining large and pre-large item sets. The pre-large concept is used to reduce the number of database scans. The experimental results show that the proposed algorithm is faster than some other algorithms.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
