Scholars Central

Conference abstractPublished 20 Oct 2016

Extensions of dynamic programming for machine learning and knowledge representation

Authors: Mikhail Moshkov

King Abdullah University of Science and Technology, Saudi Arabia

Ask about this article

Abstract

Select any words in the title or abstract, or press this and choose a sentence.

We discuss so called multi-pruning which allows us to construct classifiers (decision trees) that outperform often classifiers constructed by CART. This approach is based on the construction of the set of Pareto optimal points for bi-criteria optimization problem relative to the size of decision trees and the number of misclassifications. The second topic is connected with multi-stage optimization of decision rules relative to the coverage and length. Based on this optimization procedure, we can simulate the work of greedy algorithm for the set cover problem. As a result, for many datasets from UCI ML Repository, we can construct small systems of enough accurate decision rules that cover the most part of objects (rows). The end of the presentation is devoted to the introduction to KAUST

Ask about this article

Answers come only from this article's title, abstract and keywords, each sentence pointing to where it comes from. Your question is sent to OpenAI to write the answer. Scholars Central does not store it.

Try:

For authors and organisers

Publish, present and keep up with your field

Find the right journal for your paper and submit your manuscript.

Photo: Pexels