arrow
返回

A polynomial kernel neural network classifier based on random sampling and information gain

delete2021-09-09
delete3
PRE
AI
Y
Yueyue Xiao
黄薇 封面图
黄薇 (Wei Huang) *
S
Sung‐Kwun Oh
祝
祝烈煌 (Liehuang Zhu)
DOI:10.1007/s10489-021-02762-zdelete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
In this paper, we propose a polynomial kernel neural network classifier (PKNNC) based on the random sampling and information gain. Random sampling is used here to generate datasets for the construction of polynomial neurons located in the neural networks, while information gain is used to evaluate the importance of the input variables (viz. dataset features) of each neuron. Both random sampling and information gain stem from the concepts of well-known random forest models. Some traditional neural networks have certain limitations, such as slow convergence speed, easily falling to local optima and difficulty describing the polynomial relation between the input and output. In this regard, a general PKNNC is proposed, and it consists of three parts: the premise, conclusion, and aggregation. The method of designing the PKNNC is summarized as follows. In the premise section, random sampling and information gain are used to obtain multiple subdatasets that are passed to the aggregation part, and the conclusion part uses three types of polynomials. In the aggregation part, the least squares method (LSM) is used to estimate the parameters of polynomials. Furthermore, the particle swarm optimization (PSO) algorithm is exploited here to optimize the PKNNC. The overall optimization of the PKNNC combines structure optimization and parameter optimization. The PKNNC takes advantage of three types of polynomial kernel functions, random sampling techniques and information gain algorithms, which have a good ability to describe the higher-order nonlinear relationships between input and output variables and have high generalization and fast convergence capabilities. To evaluate the effectiveness of the PKNNC, numerical experiments are carried out on two types of data: machine learning data and face data. A comparative study illustrates that the proposed PKNNC leads to better performance than several conventional models.
Keyword:
Polynomial kernel neural network classifier (PKNNC)
Random sampling
Information gain
Particle swarm optimization
Least squares method

期刊

Applied Intelligence 封面图
Applied Intelligence
IF:
3.5
论文数:
7.6K
被引数:
1.7W

机构

B
beijing institute of technology
学者数:
5.5W
论文数: 4.0W
被引数: 63
T
Tianjin University of Technology
学者数:
8.8K
论文数: 5.9K
被引数: 1.0W
S
suwon university
学者数:
512
论文数: 623
被引数: 0
学者 查看更多机构
引用论文

引用论文

err分享
err收藏
The Red Book of the soils of Georgia
err2018-09-01
err0
errOAAI
errTamar O. Kvrivishvili; Tengiz F. Urushadze; Winfried E.H. Blum; Leo T. Jorbenadze; Giuli V. Tsereteli; Mariam N. Merabishvili; Ketevan A. Gogidze; Rusudan G. Kakhadze; Ilia O. Kunchulia
err分享
err收藏
Signatures verification based on PNN classifier optimised by PSO algorithm
err2016-12-01
err42
PREAI
errPorwik, Piotr; Doroz, Rafal; Orczyk, Tomasz
err分享
err收藏
Efficient face recognition using wavelet-based generalized neural network
err2013-06-01
err19
PREAI
errSharma, Poonam; Arya, K. V.; Yadav, R. N.
err分享
err收藏
Assessment of the effect on soil microbial communities of genetically modified soybean and a hybrid from crossing with wild soybean
err2021-09-17
err0
PREAI
errSung-Dug Oh; Ye-Jin Jang; Soo-Yun Park; Kijong Lee; Seong-Kon Lee; Doh-Won Yun; Sang Jae Suh; Jong-Chan Chae
err分享
err收藏
学者 查看更多内容