Affiliations: [a] Department of Information Management, I-Shou University, Kaohsiung, 84008, Taiwan, ROC. E-mail: [email protected]; URL: http://www.nuk.edu.tw/tphong | [b] Institute of Computer and Information Science, National Chiao-Tung University, Hsinchu, 300, Taiwan, ROC. E-mail: [email protected] | [c] Department of Information Management, I-Shou University, Kaohsiung, 84008, Taiwan, ROC. E-mail: [email protected]
Correspondence:
[*]
Corresponding author.
Note: [1] This is a modified and expanded version of the paper “Incremental data mining based on two support thresholds”, presented at The Fourth International Conference on Knowledge-Based Intelligent Engineering Systems & Allied Technologies, 2000, England.
Abstract: Due to the increasing use of very large databases and data warehouses, mining useful information and helpful knowledge from transactions is evolving into an important research area. In the past, researchers usually assumed databases were static to simplify data mining problems. Thus, most of the classic algorithms proposed focused on batch mining, and did not utilize previously mined information in incrementally growing databases. In real-world applications, however, developing a mining algorithm that can incrementally maintain discovered information as a database grows is quite important. In this paper, we propose the concept of pre-large itemsets and design a novel, efficient, incremental mining algorithm based on it. Pre-large itemsets are defined by a lower support threshold and an upper support threshold. They act as gaps to avoid the movements of itemsets directly from large to small and vice-versa. The proposed algorithm doesn't need to rescan the original database until a number of transactions have been newly inserted. If the database has grown larger, then the number of new transactions allowed will be larger too.
Keywords: data mining, association rule, large itemset, pre-large itemset, incremental mining
