DNF Sparsification and a Faster Deterministic Counting Algorithm.
Parikshit GopalanRaghu MekaOmer ReingoldPublished in: Computational Complexity Conference (2012)
Keyphrases
- learning algorithm
- experimental evaluation
- worst case
- preprocessing
- computational cost
- computational complexity
- k means
- simulated annealing
- cost function
- dynamic programming
- memory efficient
- recognition algorithm
- detection algorithm
- optimization algorithm
- linear programming
- high accuracy
- search space
- probabilistic model
- np hard
- significant improvement
- particle swarm optimization
- association rules
- optimal solution
- times faster
- reinforcement learning
- similarity measure