The Size of Arrays for a Prime Implicant Generating Algorithm.
Yasuhiro IgarashiPublished in: Comput. J. (1980)
Keyphrases
- computational complexity
- improved algorithm
- experimental evaluation
- learning algorithm
- objective function
- high accuracy
- dynamic programming
- optimization algorithm
- simulated annealing
- probabilistic model
- classification algorithm
- np hard
- significant improvement
- space complexity
- scales linearly
- matching algorithm
- standard deviation
- detection algorithm
- convergence rate
- selection algorithm
- particle swarm optimization
- computational cost
- fixed size
- neural network
- polynomial size
- convex hull
- times faster
- graph cuts
- linear programming
- k means
- search space
- association rules
- preprocessing