Synonyms
Definition
The divide-and-conquer strategy is a learning algorithm for inducing Decision Trees. Its name reflects its key idea, which is to successively partition the dataset into smaller sets (the divide part) and recursively call itself on each subset (the conquer part). It should not be confused with the separate-and-conquer strategy which is used in the Covering Algorithm for rule learning.
Cross References
This is a preview of subscription content, log in via an institution to check access.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer Science+Business Media New York
About this entry
Cite this entry
Fürnkranz, J. (2016). Divide-and-Conquer Learning. In: Sammut, C., Webb, G. (eds) Encyclopedia of Machine Learning and Data Mining. Springer, Boston, MA. https://doi.org/10.1007/978-1-4899-7502-7_303-1
Download citation
DOI: https://doi.org/10.1007/978-1-4899-7502-7_303-1
Received:
Accepted:
Published:
Publisher Name: Springer, Boston, MA
Online ISBN: 978-1-4899-7502-7
eBook Packages: Springer Reference Computer SciencesReference Module Computer Science and Engineering