Cross-validation based weights and structure determination of Chebyshev-polynomial neural networks for pattern classification
DOI10.1016/j.patcog.2014.04.026zbMath1373.68362OpenAlexW2008095228MaRDI QIDQ1676889
Lin Xiao, Xiaotian Yu, Yonghua Yin, Yu-Nong Zhang, Dong-Sheng Guo
Publication date: 10 November 2017
Published in: Pattern Recognition (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.patcog.2014.04.026
Learning and adaptive systems in artificial intelligence (68T05) Pattern recognition, speech recognition (68T10) Orthogonal polynomials and functions of hypergeometric type (Jacobi, Laguerre, Hermite, Askey scheme, etc.) (33C45)
Related Items (4)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Multi-class pattern classification using neural networks
- A survey of cross-validation procedures for model selection
- Pattern classification by linear goal programming and its extensions
- Using Chebyshev polynomials to approximate partial differential equations
- Machine learning for first-order theorem proving
- Extension of Bernstein polynomials to infinite dimensional case
- The Predictive Sample Reuse Method with Applications
This page was built for publication: Cross-validation based weights and structure determination of Chebyshev-polynomial neural networks for pattern classification