Discretized-Vapnik-Chervonenkis dimension for analyzing complexity of real function classes

In this paper, we introduce the discretized-Vapnik-Chervonenkis (VC) dimension for studying the complexity of a real function class, and then analyze properties of real function classes and neural networks. We first prove that a countable traversal set is enough to achieve the VC dimension for a rea...

Full description

Saved in:
Bibliographic Details
Main Authors: Zhang, Chao, Bian, Wei, Tao, Dacheng, Lin, Weisi
Other Authors: School of Computer Engineering
Format: Article
Language:English
Published: 2013
Subjects:
Online Access:https://hdl.handle.net/10356/99545
http://hdl.handle.net/10220/13524
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Nanyang Technological University
Language: English