A beam search is a heuristic search technique that combines elements of breadth-first and best-first searches. Like a breadth-first search, the beam search maintains a list of nodes that represent a frontier in the search space. Whereas the breadth-first adds all neighbors to the list, the beam search orders the neighboring nodes according to some heuristic and only keeps the n best, where n is the beam size. This can significantly reduce the processing and storage requirements for the search.
In machine learning, the beam search has been used in algorithms, such as AQ11 (Dietterich & Michalski, 1977).
Cross References
This is a preview of subscription content, log in via an institution to check access.
Recommended Reading
Dietterich, T. G., & Michalski, R. S. (1977). Learning and generalization of characteristic descriptions: Evaluation criteria and comparative review of selected methods. In Fifth international joint conference on artificial intelligence (pp. 223–231). Cambridge, MA: William Kaufmann.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer Science+Business Media, LLC
About this entry
Cite this entry
Sammut, C. (2011). Beam Search. In: Sammut, C., Webb, G.I. (eds) Encyclopedia of Machine Learning. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-30164-8_68
Download citation
DOI: https://doi.org/10.1007/978-0-387-30164-8_68
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-30768-8
Online ISBN: 978-0-387-30164-8
eBook Packages: Computer ScienceReference Module Computer Science and Engineering