Sequential All Frequent Itemsets Detection: A Method to Detect All Frequent Sequential Itemsets Using LERP-Reduced Suffix Array Data Structure and ARPaD Algorithm.
Konstantinos F. XylogiannopoulosPanagiotis KarampelasReda AlhajjPublished in: ASONAM (2015)
Keyphrases
- itemsets
- frequent itemsets
- data structure
- apriori algorithm
- compact data structure
- prefix tree
- pruning strategy
- frequent itemset mining
- minimum support threshold
- frequent item sets
- frequent patterns
- suffix array
- fp tree
- association rules
- maximal frequent itemsets
- support threshold
- frequent itemsets mining
- association rule mining algorithm
- mining algorithm
- association rule mining
- pattern growth
- suffix tree
- minimum support
- tree structure
- algorithms for mining association rules
- mining association rules
- space efficient
- closed itemsets
- mining frequent itemsets
- association rule mining algorithms
- candidate itemsets
- data streams
- frequent closed itemsets
- transactional databases
- frequent sets
- itemset mining
- incremental updating
- transaction databases
- pattern mining
- association rules mining
- condensed representations
- concise representation
- interesting patterns
- mining frequent
- emerging patterns
- frequent pattern mining
- mining frequent patterns
- high utility
- closed frequent itemsets
- candidate generation
- high utility itemsets
- mining of frequent itemsets
- uncertain data
- main memory
- data mining algorithms
- transaction data
- distance function
- data sets