More Nearly Optimal Algorithms for Unbounded Searching, Part II: The Transfinite Case.
Edward M. ReingoldXiaojun ShenPublished in: SIAM J. Comput. (1991)
Keyphrases
- worst case
- learning algorithm
- recently developed
- computational cost
- benchmark datasets
- data sets
- exhaustive search
- significant improvement
- dynamic programming
- computationally efficient
- computational efficiency
- early stopping
- times faster
- computationally expensive
- orders of magnitude
- theoretical analysis
- simulated annealing
- bayesian networks
- feature selection
- data mining