谷歌浏览器插件
订阅小程序
在清言上使用

Binary Classification by Svm Based Tree Type Neural Networks

Neural Networks, 2002 IJCNN '02 Proceedings of the 2002 International Joint Conference(2002)

引用 6|浏览10
暂无评分
摘要
A technique for building a multilayer perceptron classifier network is presented. Initially, a single perceptron tries to correctly classify as many samples as possible. Misclassified samples are taken care of by adding as bias the output of upto two neurons to the parent neuron. The final classification boundary between the two disjoint half spaces at the output of the parent neuron is determined by a maximum margin classifier type SVM applied jointly to the training set of the parent neuron along with the correcting inputs from its child neuron(s). The growth of a branch in the network ceases when the terminal neuron is able to correctly classify all samples from its training set. No a priori assumptions need to be made regarding the number of neurons in the network or the kernel of the SVM classifier. Examples are presented to illustrate the effectiveness of the technique.
更多
查看译文
关键词
function approximation,learning (artificial intelligence),learning automata,multilayer perceptrons,pattern classification,trees (mathematics),binary classification,function approximation,learning algorithm,maximum margin classifier,multilayer perceptron,support vector machines,terminal neuron,training set,tree type neural networks
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要