Approximate inverse frequent itemset mining: privacy, complexity, and approximation
- 1 January 2005
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
No abstract availableAll Related Versions
This publication has 8 references indexed in Scilit:
- Privacy-Aware Market Basket Data Set Generation: A Feasible Approach for Inverse Frequent Set MiningPublished by Society for Industrial & Applied Mathematics (SIAM) ,2005
- Computational complexity of itemset frequency satisfiabilityPublished by Association for Computing Machinery (ACM) ,2004
- Privacy Preserving Data Generation for Database Application Performance TestingPublished by Springer Nature ,2004
- Feasible itemset distributions in data miningPublished by Association for Computing Machinery (ACM) ,2003
- Real world performance of association rule algorithmsPublished by Association for Computing Machinery (ACM) ,2001
- A logic for reasoning about probabilitiesInformation and Computation, 1990
- Probabilistic satisfiabilityJournal of Complexity, 1988
- Analysis of a linear programming heuristic for scheduling unrelated parallel machinesDiscrete Applied Mathematics, 1985