Using decision trees to aid algorithm selection in combinatorial interaction tests generation.
Angelo GargantiniPaolo VavassoriPublished in: ICST Workshops (2015)
Keyphrases
- selection algorithm
- detection algorithm
- dynamic programming
- times faster
- worst case
- learning algorithm
- computational complexity
- theoretical analysis
- generation algorithm
- computational cost
- cost function
- significant improvement
- decision trees
- search space
- optimization algorithm
- selection strategy
- machine learning
- convergence rate
- objective function
- np hard
- input data
- k means
- probabilistic model
- experimental evaluation
- human computer interaction
- matching algorithm
- high accuracy
- convex hull
- recognition algorithm
- data sets