Issue No. 04 - July/August (1998 vol. 10)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/69.706057
<p><b>Abstract</b>—In this paper, we provide an overall framework for learning in search-based systems that are used to find optimum solutions to problems. This framework assumes that prior knowledge is available in the form of one or more heuristic functions (or features) of the problem domain. An appropriate clustering strategy is used to partition the state space into a number of classes based on the available features. The number of classes formed will depend on the resource constraints of the system. In the training phase, example problems are run using a standard admissible search algorithm. In this phase, heuristic information corresponding to each class is learned. This new information can be used in the problem-solving phase by appropriate search algorithms so that subsequent problem instances can be solved more efficiently. In this framework, we also show that heuristic information of forms other than the conventional single-valued underestimate value can be used, since we maintain the heuristic of each class explicitly. We show some novel search algorithms that can work with some such forms. Experimental results have been provided for some domains.</p>
Clustering, heuristic features, learning, search algorithms.
Sudeshna Sarkar, Sujoy Ghose, P.p. Chakrabarti, "A Framework for Learning in Search-Based Systems", IEEE Transactions on Knowledge & Data Engineering, vol. 10, no. , pp. 563-575, July/August 1998, doi:10.1109/69.706057