Mining association rules between sets of items in large databases
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Exploratory mining and pruning optimizations of constrained associations rules
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Mining frequent patterns without candidate generation
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Exploiting succinct constraints using FP-trees
ACM SIGKDD Explorations Newsletter
Mining Frequent Item Sets with Convertible Constraints
Proceedings of the 17th International Conference on Data Engineering
Fast Algorithms for Mining Association Rules in Large Databases
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
DualMiner: a dual-pruning algorithm for itemsets with constraints
Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining
Efficient dynamic mining of constrained frequent sets
ACM Transactions on Database Systems (TODS)
Moment: Maintaining Closed Frequent Itemsets over a Stream Sliding Window
ICDM '04 Proceedings of the Fourth IEEE International Conference on Data Mining
ACM SIGMOD Record
An Algorithm for In-Core Frequent Itemset Mining on Streaming Data
ICDM '05 Proceedings of the Fifth IEEE International Conference on Data Mining
DSTree: A Tree Structure for the Mining of Frequent Sets from Data Streams
ICDM '06 Proceedings of the Sixth International Conference on Data Mining
Efficient Mining of Constrained Frequent Patterns from Streams
IDEAS '06 Proceedings of the 10th International Database Engineering and Applications Symposium
CanTree: a canonical-order tree for incremental frequent-pattern mining
Knowledge and Information Systems
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Max-FTP: mining maximal fault-tolerant frequent patterns from databases
BNCOD'07 Proceedings of the 24th British national conference on Databases
FIsViz: a frequent itemset visualizer
PAKDD'08 Proceedings of the 12th Pacific-Asia conference on Advances in knowledge discovery and data mining
A tree-based approach for frequent pattern mining from uncertain data
PAKDD'08 Proceedings of the 12th Pacific-Asia conference on Advances in knowledge discovery and data mining
A FP-tree-based method for inverse frequent set mining
BNCOD'06 Proceedings of the 23rd British National Conference on Databases, conference on Flexible and Efficient Information Handling
Stream mining of frequent sets with limited memory
Proceedings of the 28th Annual ACM Symposium on Applied Computing
Mining frequent itemsets from sparse data streams in limited memory environments
WAIM'13 Proceedings of the 14th international conference on Web-Age Information Management
| Hi-index | 0.00 |
As technology advances, floods of data can be produced and shared in many applications such as wireless sensor networks or Web click streams. This calls for efficient mining techniques for extracting useful information and knowledge from streams of data. In this paper, we propose a novel algorithm for stream mining of frequent itemsets in a limited memory environment. This algorithm uses a compact tree structure to capture important contents from streams of data. By exploiting its nice properties, such a tree structure can be easily maintained and can be used for mining frequent itemsets, as well as other patterns like constrained itemsets, even when the available memory space is small.