|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
| ASCII Text | x | ||
| W. Wang, J. Chen, "Learning by Discovering Problem Solving Heuristics Through Experience," IEEE Transactions on Knowledge and Data Engineering, vol. 3, no. 4, pp. 415-420, December, 1991. | |||
| BibTex | x | ||
| @article{ 10.1109/69.109103, author = {W. Wang and J. Chen}, title = {Learning by Discovering Problem Solving Heuristics Through Experience}, journal ={IEEE Transactions on Knowledge and Data Engineering}, volume = {3}, number = {4}, issn = {1041-4347}, year = {1991}, pages = {415-420}, doi = {http://doi.ieeecomputersociety.org/10.1109/69.109103}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - JOUR JO - IEEE Transactions on Knowledge and Data Engineering TI - Learning by Discovering Problem Solving Heuristics Through Experience IS - 4 SN - 1041-4347 SP415 EP420 EPD - 415-420 A1 - W. Wang, A1 - J. Chen, PY - 1991 KW - symbolic rule learning; elements exchange; SAFE; strategy acquisition from experience; domain-dependent problem-solving heuristics; sorting system; production rules; insertion sort; solution path; heuristic information; shortcut; inductive learning bias; hypothesis space; heuristic programming; inference mechanisms; knowledge acquisition; learning systems; problem solving; sorting VL - 3 JA - IEEE Transactions on Knowledge and Data Engineering ER - | |||
The authors present a system, called SAFE (strategy acquisition from experience), which incorporates novel methods for discovering domain-dependent problem-solving heuristics. SAFE is implemented as a sorting system whose sorting strategies are represented as production rules. SAFE initially uses the insertion sort strategy to solve problems. After solving each given problem. SAFE learns symbolic rules from the solution path which is obtained by applying the existing heuristic information. By one or several processes of learning. SAFE is able to obtain the heuristics to sort new problems with minimum exchanges of elements. The notion of shortcut, an effective inductive learning bias for reducing the hypothesis space to be searched during learning, is introduced.
[1] P. R. Cohen and E. A. Feigenbaum,The Handbook of Artificial Intelligence, Vol. 3. Los Altos, CA: Kaufmann, 1982.
[2] J. H. Holland, K. F. Holyoak, R. E. Nisbett, and P. R. Thagard,Induction: Processes of Inference, Learning, and Discovery. Cambrigde, MA: M.I.T. Press, 1986.
[3] P. Langley, "Learning to search: From weak methods to domain-specific heuristics,"Cognitive Sci., no. 9, pp. 217-260, 1985.
[4] R. S. Michalski, J. G. Carbonell, and T. M. Mitchell, Eds.,Machine Learning: An Artificial Intelligence Approach, vol. 2. Los Altos, CA: Morgan Kaufmann, 1986.
[5] T. M. Mitchell, J. C. Carbonell, and R. S. Michalski, Eds.,Machine Learning: A Guide to Current Research. Amsterdam, The Netherlands: Kluwer, 1985.
[6] A. Newell and H. A. Simon, "Computer science as empirical inquiring: Symbols and search," inACM Turing Award Lectures: The First Twenty Years, ACM Press, 1987.
[7] R. E. Korf, "A program that learns to solve Rubik's cube,"Proc. AAAI, 1982.
[8] P.S. Rosenbloomet al., "Current research on learning in SOAR," inMachine Learning: A Guide to Current Research, T. Mitchell, J. Carbonel, and R. Michalski, Eds. Norwell, MA: Kluwer Academic, 1986.