This article addresses the incremental and decremental maintenance of the frequent pattern space. We conduct an in-depth investigation on how the frequent pattern space evolves under both incremental and decremental updates. Based on the evolution analysis, a new data structure, Generator-Enumeration Tree (GE-tree), is developed to facilitate the maintenance of the frequent pattern space. With the concept of GE-tree, we propose two novel algorithms, Pattern Space Maintainer+ (PSM+) and Pattern Space Maintainer- (PSM-), for the incremental and decremental maintenance of frequent patterns. Experimental results demonstrate that the proposed algorithms, on average, outperform the representative state-of-the-art methods by an order of magnitude....
The problem of mining frequent sequences is to extract frequently occurring subsequences in a sequen...
An incremental updating technique is developed for maintenance of the association rules discovered b...
[[abstract]]Repeating patterns represent temporal relations among data items, which could be used fo...
This paper addresses the incremental and decremental maintenance of the frequent pattern space. We c...
This Thesis explores the theories and algorithms for frequent pattern space maintenance. Frequent pa...
This chapter surveys the maintenance of frequent patterns in transaction datasets. It is written to ...
Data generated from both the offline and online sources are incremental in nature. Changes in the un...
Abstract. Data mining and machine learning must confront the problem of pattern maintenance because ...
Data-mining and machine learning must confront the problem of pattern maintenance because data updat...
In many applications, databases are frequently changed by insertions, deletions, and/or modification...
Mining association rules among items in a large database have been recognized as one of the most imp...
[[abstract]]The Frequent-Pattern-tree (FP-tree) is an efficient data structure for association-rule ...
[[abstract]]The frequent pattern tree (FP-tree) is an efficient data structure for association-rule ...
[[abstract]]The Frequent-Pattern-tree (FP tree) is an efficient data structure for association-rule ...
In this paper, we propose an algorithm for maintaining the frequent itemsets discovered in a databas...
The problem of mining frequent sequences is to extract frequently occurring subsequences in a sequen...
An incremental updating technique is developed for maintenance of the association rules discovered b...
[[abstract]]Repeating patterns represent temporal relations among data items, which could be used fo...
This paper addresses the incremental and decremental maintenance of the frequent pattern space. We c...
This Thesis explores the theories and algorithms for frequent pattern space maintenance. Frequent pa...
This chapter surveys the maintenance of frequent patterns in transaction datasets. It is written to ...
Data generated from both the offline and online sources are incremental in nature. Changes in the un...
Abstract. Data mining and machine learning must confront the problem of pattern maintenance because ...
Data-mining and machine learning must confront the problem of pattern maintenance because data updat...
In many applications, databases are frequently changed by insertions, deletions, and/or modification...
Mining association rules among items in a large database have been recognized as one of the most imp...
[[abstract]]The Frequent-Pattern-tree (FP-tree) is an efficient data structure for association-rule ...
[[abstract]]The frequent pattern tree (FP-tree) is an efficient data structure for association-rule ...
[[abstract]]The Frequent-Pattern-tree (FP tree) is an efficient data structure for association-rule ...
In this paper, we propose an algorithm for maintaining the frequent itemsets discovered in a databas...
The problem of mining frequent sequences is to extract frequently occurring subsequences in a sequen...
An incremental updating technique is developed for maintenance of the association rules discovered b...
[[abstract]]Repeating patterns represent temporal relations among data items, which could be used fo...