A Measure of Learning Model Complexity by VC Dimension

被引:0
作者
WANG Wenjian ZHANG Lixia XU ZongbenInstitute for Information and System Science Faculty of Science Xian Jiaotong University Xian ChinaDepartment of Computer Science Henan Normal University Xinxiang China [1 ,2 ,11 ,710049 ,2 ,453002 ]
机构
关键词
VC dimension; learning model; complexity; statistical learning theory; modeling;
D O I
暂无
中图分类号
TP311.13 [];
学科分类号
1201 ;
摘要
When developing models there is always a trade-off between model complexity and model fit. In this paper, a measure of learning model complexity based on VC dimension is presented, and some relevant mathematical theory surrounding the derivation and use of this metric is summarized. The measure allows modelers to control the amount of error that is returned from a modeling system and to state upper bounds on the amount of error that the modeling system will return on all future, as yet unseen and uncollected data sets. It is possible for modelers to use the VC theory to determine which type of model more accurately represents a system.
引用
收藏
页码:455 / 461
页数:7
相关论文
共 2 条
[1]  
Modelling the abundance of rare species: statistical models for counts with extra zeros[J] . A.H. Welsh,R.B. Cunningham,C.F. Donnelly,D.B. Lindenmayer.Ecological Modelling . 1996 (1)
[2]   SUPPORT-VECTOR NETWORKS [J].
CORTES, C ;
VAPNIK, V .
MACHINE LEARNING, 1995, 20 (03) :273-297