Resolving Infeasibility in Linear Programs for the Frequent Itemset Hiding Problem.
Panteleimon KrasadakisVassilios S. VerykiosEvangelos SakkopoulosPublished in: ICTAI (2021)
Keyphrases
- linear program
- frequent itemsets
- linear programming
- itemsets
- frequent itemset mining
- feasible solution
- mining algorithm
- mining frequent itemsets
- association rule mining
- semi infinite
- association rules
- frequent itemsets mining
- data streams
- simplex method
- frequent itemset discovery
- closed itemsets
- optimal solution
- stochastic programming
- discovery of association rules
- primal dual
- frequent closed itemsets
- mining association rules
- dynamic programming
- data structure
- np hard
- objective function
- interior point methods
- itemset mining
- column generation
- linear programming problems
- condensed representations
- simplex algorithm
- uncertain data
- transactional databases
- frequent pattern mining
- linear inequalities
- integer program
- mixed integer
- transaction databases
- emerging patterns
- pruning strategy
- extreme points
- mixed integer linear program
- learning algorithm
- frequent patterns
- data mining