Anthony, Martin (2008) Aspects of discrete mathematics and probability in the theory of machine learning. Discrete applied mathematics, 156 (6). pp. 883-902. ISSN 0166-218X
This paper discusses the applications of certain combinatorial and probabilistic techniques to the analysis of machine learning. Probabilistic models of learning initially addressed binary classification (or pattern classification). Subsequently, analysis was extended to regression problems, and to classification problems in which the classification is achieved by using real-valued functions (where the concept of a large margin has proven useful). Another development, important in obtaining more applicable models, has been the derivation of data-dependent bounds. Here, we discuss some of the key probabilistic and combinatorial techniques and results, focusing on those of most relevance to researchers in discrete applied mathematics.
|Additional Information:||© 2008 Elsevier|
|Library of Congress subject classification:||Q Science > QA Mathematics|
|Sets:||Departments > Mathematics|
Actions (login required)
|Record administration - authorised staff only|