Statistical learning and VC theory

Abstract

The article applies statistical learning theory to the supervised learning problem. Pattern recognition is covered, including Vapnik-Chervonenkis (VC) theory and the implications for support vector machines (SVMs), neural networks and decision trees. Real predictions are given for scale-sensitive dimensions. The article concludes by analysing large margin classification.