Mining N-most Interesting Multi-level Frequent Itemsets without Support Threshold.
Sorapol ChompaisalKomate AmphawanAthasit SurarerksPublished in: IC2IT (2014)
Keyphrases
- frequent itemsets
- support threshold
- itemsets
- interesting patterns
- mining frequent itemsets
- frequent itemset mining
- minimum support
- mining algorithm
- association rules
- association rule mining
- frequent patterns
- itemset mining
- data streams
- mining frequent patterns
- interesting itemsets
- mining association rules
- frequent pattern mining
- closed frequent itemsets
- concise representation
- transactional databases
- transaction databases
- frequent item sets
- emerging patterns
- pattern mining
- sequential patterns
- dense datasets
- sequential pattern mining
- fp tree
- apriori algorithm
- closed itemsets
- frequent closed itemsets
- candidate itemsets
- condensed representations
- previously unknown
- frequent sets
- maximal frequent itemsets
- data structure
- data sets
- association patterns
- association rules mining
- association mining
- pruning strategy
- uncertain data
- data mining algorithms
- generalized association rules
- mining frequent
- data mining techniques
- knowledge discovery
- preprocessing
- real world