Noise-Tolerant Occam Algorithms and Their Applications to Learning Decision Trees

ISSN： 0885-6125

Source： Machine Learning, Vol.11, Iss.1, 1993-04, pp. : 37-62

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

ANALYZING STUDENT PERFORMANCE IN DISTANCE LEARNING WITH GENETIC ALGORITHMS AND DECISION TREES

By Kalles Dimitris Pierrakeas Christos

Applied Artificial Intelligence, Vol. 20, Iss. 8, 2006-09 ,pp. : 655-674

Taylor & Francis Ltd

Access to resources Recommend Favorite

Algorithms for optimal dyadic decision trees

By Hush Don

Machine Learning, Vol. 80, Iss. 1, 2010-07 ,pp. : 85-107

Springer Publishing Company

Access to resources Recommend Favorite

A Theoretical and Empirical Study of a Noise-Tolerant Algorithm to Learn Geometric Patterns

By Goldman S.A.

Machine Learning, Vol. 37, Iss. 1, 1999-10 ,pp. : 5-49

Springer Publishing Company

Access to resources Recommend Favorite

Learning compact Markov logic networks with decision trees

By Khosravi Hassan Schulte Oliver Hu Jianfeng Gao Tianxiang

Machine Learning, Vol. 89, Iss. 3, 2012-12 ,pp. : 257-277

Springer Publishing Company

Access to resources Recommend Favorite

Pareto-optimality of oblique decision trees from evolutionary algorithms

By Pangilinan Jose

Journal of Global Optimization, Vol. 51, Iss. 2, 2011-10 ,pp. : 301-311

Springer Publishing Company

Access to resources Recommend Favorite