Mining Closed High Utility Itemsets based on Propositional Satisfiability.
Amel HidouriSaïd JabbourBadran RaddaouiBoutheina Ben YaghlanePublished in: Data Knowl. Eng. (2021)
Keyphrases
- propositional satisfiability
- mining closed
- high utility itemsets
- frequent item sets
- mining algorithm
- itemsets
- constraint programming
- itemset mining
- sat solvers
- propositional logic
- automated reasoning
- frequent itemsets
- industrial applications
- association rule mining
- pattern mining
- high utility
- frequent itemset mining
- data structure
- sequential patterns
- sat problem
- association rules
- data mining algorithms
- tree structure
- sequential pattern mining
- frequent patterns
- constraint satisfaction
- mining frequent
- frequent pattern mining
- constraint satisfaction problems
- data streams
- minimum support
- knn
- stochastic local search
- anti monotone
- mining association rules
- max sat
- pruning strategy
- association mining
- bayesian networks
- search space
- orders of magnitude
- distance function