Cost-to-Go Function Approximation [chapter]

2017 Encyclopedia of Machine Learning and Data Mining  
Mitchell's, (1982; candidate-elimination algorithm performs a bidirectional search in the hypothesis space. It maintains a set, S , of most specific hypotheses that are consistent with the training data and a set, G, of most general hypotheses consistent with the training data. These two sets form two boundaries on the version space.
doi:10.1007/978-1-4899-7687-1_100093 fatcat:vse7ncdqs5atlosjhz7fhlj3im