Learning a hyperplane classifier by minimizing an exact bound on the VC dimension

被引：0
|
作者：
Jayadeva [1 ]
机构：
[1] Department of Electrical Engineering, Indian Institute of Technology, Delhi, Hauz Khas, New Delhi,110016, India
来源：
Neurocomputing | 2015年 / 149卷
关键词：
34;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
引用
收藏
页码：683 / 689
相关论文
共 47 条
  • [1] Learning a hyperplane classifier by minimizing an exact bound on the VC dimensioni
    Jayadeva
    NEUROCOMPUTING, 2015, 149 : 683 - 689
  • [2] Learning a hyperplane regressor through a tight bound on the VC dimension
    Jayadeva
    Chandra, Suresh
    Batra, Sanjit S.
    Sabharwal, Siddarth
    NEUROCOMPUTING, 2016, 171 : 1610 - 1616
  • [3] QMCM: Minimizing Vapnik's bound on the VC dimension
    Jayadeva
    Soman, Sumit
    Pant, Himanshu
    Sharma, Mayank
    NEUROCOMPUTING, 2020, 399 : 352 - 360
  • [4] The Exact VC Dimension of the WiSARD n-Tuple Classifier
    Carneiro, Hugo C. C.
    Pedreira, Carlos E.
    Franca, Felipe M. G.
    Lima, Priscila M. V.
    NEURAL COMPUTATION, 2019, 31 (01) : 176 - 207
  • [5] Designing nonlinear classifiers through minimizing VC dimension bound
    Xu, JH
    ADVANCES IN NEURAL NETWORKS - ISNN 2005, PT 1, PROCEEDINGS, 2005, 3496 : 900 - 905
  • [6] Optimal hyperplane classifier based on entropy number bound
    Tsuda, K
    NINTH INTERNATIONAL CONFERENCE ON ARTIFICIAL NEURAL NETWORKS (ICANN99), VOLS 1 AND 2, 1999, (470): : 419 - 424
  • [7] Exact VC-dimension of Boolean monomials
    Natschlager, T
    Schmitt, M
    INFORMATION PROCESSING LETTERS, 1996, 59 (01) : 19 - 20
  • [8] An improved VC dimension bound for sparse polynomials
    Schmitt, M
    LEARNING THEORY, PROCEEDINGS, 2004, 3120 : 393 - 407
  • [9] Lower bound on VC-dimension by local shattering
    Erlich, Y
    Chazan, D
    Petrack, S
    Levy, A
    NEURAL COMPUTATION, 1997, 9 (04) : 771 - 776
  • [10] An upper bound for minimizing coefficients of dimension Kolchin polynomial
    M. V. Kondratieva
    Programming and Computer Software, 2010, 36 : 83 - 86
12345