Statistical learning theory: a tutorial

✍ Scribed by Sanjeev R. Kulkarni; Gilbert Harman

• Publisher: Wiley (John Wiley & Sons)
• Year: 2011
• Tongue: English
• Weight: 259 KB
• Volume: 3
• Category: Article
• ISSN: 0163-1829
• DOI: 10.1002/wics.179

✦ Synopsis

Abstract

In this article, we provide a tutorial overview of some aspects of statistical learning theory, which also goes by other names such as statistical pattern recognition, nonparametric classification and estimation, and supervised learning. We focus on the problem of two‐class pattern classification for various reasons. This problem is rich enough to capture many of the interesting aspects that are present in the cases of more than two classes and in the problem of estimation, and many of the results can be extended to these cases. Focusing on two‐class pattern classification simplifies our discussion, and yet it is directly applicable to a wide range of practical settings. We begin with a description of the two‐class pattern recognition problem. We then discuss various classical and state‐of‐the‐art approaches to this problem, with a focus on fundamental formulations, algorithms, and theoretical results. In particular, we describe nearest neighbor methods, kernel methods, multilayer perceptrons, Vapnik–Chervonenkis theory, support vector machines, and boosting. WIREs Comp Stat 2011 3 543–556 DOI: 10.1002/wics.179

This article is categorized under:

Statistical Learning and Exploratory Methods of the Data Sciences > Clustering and Classification

Statistical and Graphical Methods of Data Analysis > Nonparametric Methods

Statistical Learning and Exploratory Methods of the Data Sciences > Pattern Recognition

Statistical Learning and Exploratory Methods of the Data Sciences > Knowledge Discovery

Statistical Learning and Exploratory Methods of the Data Sciences > Support Vector Machines

Statistical Learning and Exploratory Methods of the Data Sciences > Neural Networks