Title :
Structure of Indicator Function Classes With Finite Vapnik–Chervonenkis Dimensions
Author :
Chao Zhang ; Dacheng Tao
Author_Institution :
Sch. of Comput. Eng., Nanyang Technol. Univ., Singapore, Singapore
Abstract :
The Vapnik-Chervonenkis (VC) dimension is used to measure the complexity of a function class and plays an important role in a variety of fields, including artificial neural networks and machine learning. One major concern is the relationship between the VC dimension and inherent characteristics of the corresponding function class. According to Sauer´s lemma, if the VC dimension of an indicator function class F is equal to D, the cardinality of the set FS1N will not be larger than Σd=0DCNd. Therefore, there naturally arises a question about the VC dimension of an indicator function class: what kinds of elements will be contained in the function class F if F has a finite VC dimension? In this brief, we answer the above question. First, we investigate the structure of the function class F when the cardinality of the set FS1N reaches the maximum value Σd=0DCNd. Based on the derived result, we then figure out what kinds of elements will be contained in F if F has a finite VC dimension.
Keywords :
learning (artificial intelligence); neural nets; Sauer´s lemma; VC dimension; artificial neural networks; cardinality; finite Vapnik-Chervonenkis dimensions; indicator function classes; machine learning; Indicator function class; Sauer´s lemma; Vapnik–Chervonenkis (VC) dimension; machine learning; neural network;
Journal_Title :
Neural Networks and Learning Systems, IEEE Transactions on
DOI :
10.1109/TNNLS.2013.2251746