title: A balanced neural tree for pattern classification.
abstract: This paper proposes a new neural tree (NT) architecture, balanced neural tree (BNT), to reduce tree size and improve classification with respect to classical NTs. To achieve this result, two main innovations have been introduced: (a) perceptron substitution and (b) pattern removal. The first innovation aims to balance the structure of the tree. If the last-trained perceptron largely misclassifies the given training set into a reduced number of classes, then this perceptron is substituted with a new perceptron. The second novelty consists of the introduction of a new criterion for the removal of tough training patterns that generate the problem of over-fitting. Finally, a new error function based on the depth of the tree is introduced to reduce perceptron training time. The proposed BNT has been tested on various synthetic and real datasets. The experimental results show that the proposed BNT leads to satisfactory results in terms of both tree depth reduction and classification accuracy.
authors.affiliation: AVIRES Lab, Department of Mathematics and Computer Science, University of Udine, Via Della Scienze-206, Udine, Italy.
authors.forename: Christian
authors.initials: C
authors.lastname: Micheloni
authors.forename: Asha
authors.initials: A
authors.lastname: Rani
authors.forename: Sanjeev
authors.initials: S
authors.lastname: Kumar
authors.forename: Gian Luca
authors.initials: GL
authors.lastname: Foresti
mesh_terms: D003663:Decision Trees; D016571:Neural Networks, Computer; D010363:Pattern Recognition, Automated / Q000379:methods*