The Top-k Frequent Closed Itemset Mining Using Top-k SAT Problem.
Saïd JabbourLakhdar SaisYakoub SalhiPublished in: ECML/PKDD (3) (2013)
Keyphrases
- itemset mining
- frequent closed
- itemsets
- frequent closed itemsets
- frequent itemsets
- sat problem
- query processing
- sequential patterns
- frequent itemset mining
- sequence mining
- constraint programming
- graph mining
- closed itemsets
- sequential pattern mining
- graph patterns
- constraint satisfaction problems
- satisfiability problem
- np complete
- pattern mining
- sat solvers
- data mining problems
- search algorithm
- association rule mining
- data model