z-logo
open-access-imgOpen Access
Using constrained exhaustive search vs. greedy heuristic search for classification rule learning
Author(s) -
Mattiev Jamolbek Maqsudovich,
Branko Kavšek
Publication year - 2018
Language(s) - English
Resource type - Conference proceedings
DOI - 10.26493/978-961-7055-26-9.35-38
Subject(s) - greedy algorithm , computer science , best first search , beam search , heuristic , greedy randomized adaptive search procedure , artificial intelligence , machine learning , mathematical optimization , search algorithm , algorithm , mathematics

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here