Construction of tunable radial basis function networks using orthogonal forward selection

An orthogonal forward selection (OFS) algorithm based on leave-one-out (LOO) criteria is proposed for the construction of radial basis function (RBF) networks with tunable nodes. Each stage of the construction process determines an RBF node, namely, its center vector and diagonal covariance matrix, by minimizing the LOO statistics. For regression application, the LOO criterion is chosen to be the LOO mean-square error, while the LOO misclassification rate is adopted in two-class classification application. This OFS-LOO algorithm is computationally efficient, and it is capable of constructing parsimonious RBF networks that generalize well. Moreover, the proposed algorithm is fully automatic, and the user does not need to specify a termination criterion for the construction process. The effectiveness of the proposed RBF network construction procedure is demonstrated using examples taken from both regression and classification applications.

Kernel classifier construction using orthogonal forward selection and boosting with Fisher ratio class separability measure

A greedy technique is proposed to construct parsimonious kernel classifiers using the orthogonal forward selection method and boosting based on Fisher ratio for class separability measure. Unlike most kernel classification methods, which restrict kernel means to the training input data and use a fixed common variance for all the kernel terms, the proposed technique can tune both the mean vector and diagonal covariance matrix of individual kernel by incrementally maximizing Fisher ratio for class separability measure. An efficient weighted optimization method is developed based on boosting to append kernels one by one in an orthogonal forward selection procedure. Experimental results obtained using this construction technique demonstrate that it offers a viable alternative to the existing state-of-the-art kernel modeling methods for constructing sparse Gaussian radial basis function network classifiers. that generalize well.

Ratio selection for classification models

This paper is concerned with the selection of inputs for classification models based on ratios of measured quantities. For this purpose, all possible ratios are built from the quantities involved and variable selection techniques are used to choose a convenient subset of ratios. In this context, two selection techniques are proposed: one based on a pre-selection procedure and another based on a genetic algorithm. In an example involving the financial distress prediction of companies, the models obtained from ratios selected by the proposed techniques compare favorably to a model using ratios usually found in the financial distress literature.

Fast kernel classifier construction using orthogonal forward selection to minimise leave-one-out misclassification rate

We propose a simple yet computationally efficient construction algorithm for two-class kernel classifiers. In order to optimise classifier's generalisation capability, an orthogonal forward selection procedure is used to select kernels one by one by minimising the leave-one-out (LOO) misclassification rate directly. It is shown that the computation of the LOO misclassification rate is very efficient owing to orthogonalisation. Examples are used to demonstrate that the proposed algorithm is a viable alternative to construct sparse two-class kernel classifiers in terms of performance and computational efficiency.

A fast linear-in-the-parameters classifier construction algorithm using orthogonal forward selection to minimize leave-one-out misclassification rate

We propose a simple and computationally efficient construction algorithm for two class linear-in-the-parameters classifiers. In order to optimize model generalization, a forward orthogonal selection (OFS) procedure is used for minimizing the leave-one-out (LOO) misclassification rate directly. An analytic formula and a set of forward recursive updating formula of the LOO misclassification rate are developed and applied in the proposed algorithm. Numerical examples are used to demonstrate that the proposed algorithm is an excellent alternative approach to construct sparse two class classifiers in terms of performance and computational efficiency.

Model selection approaches for non-linear system identification: a review

The identification of non-linear systems using only observed finite datasets has become a mature research area over the last two decades. A class of linear-in-the-parameter models with universal approximation capabilities have been intensively studied and widely used due to the availability of many linear-learning algorithms and their inherent convergence conditions. This article presents a systematic overview of basic research on model selection approaches for linear-in-the-parameter models. One of the fundamental problems in non-linear system identification is to find the minimal model with the best model generalisation performance from observational data only. The important concepts in achieving good model generalisation used in various non-linear system-identification algorithms are first reviewed, including Bayesian parameter regularisation and models selective criteria based on the cross validation and experimental design. A significant advance in machine learning has been the development of the support vector machine as a means for identifying kernel models based on the structural risk minimisation principle. The developments on the convex optimisation-based model construction algorithms including the support vector regression algorithms are outlined. Input selection algorithms and on-line system identification algorithms are also included in this review. Finally, some industrial applications of non-linear models are discussed.

A forward constrained selection algorithm for probabilistic neural network

A new probabilistic neural network (PNN) learning algorithm based on forward constrained selection (PNN-FCS) is proposed. An incremental learning scheme is adopted such that at each step, new neurons, one for each class, are selected from the training samples arid the weights of the neurons are estimated so as to minimize the overall misclassification error rate. In this manner, only the most significant training samples are used as the neurons. It is shown by simulation that the resultant networks of PNN-FCS have good classification performance compared to other types of classifiers, but much smaller model sizes than conventional PNN.

Trade-off associated with selection for increased ability to resist parasitoid attack in Drosophila melanogaster

Costs of resistance are widely assumed to be important in the evolution of parasite and pathogen defence in animals, but they have been demonstrated experimentally on very few occasions. Endoparasitoids are insects whose larvae develop inside the bodies of other insects where they defend themselves from attack by their hosts' immune systems (especially cellular encapsulation). Working with Drosophila melanogaster and its endoparasitoid Leptopilina boulardi, we selected for increased resistance in four replicate populations of flies. The percentage of flies surviving attack increased from about 0.5% to between 40% and 50% in five generations, revealing substantial additive genetic variation in resistance in the field population from which our culture was established. In comparison with four control lines, flies from selected lines suffered from lower larval survival under conditions of moderate to severe intraspecific competition.

Cross-resistance following artificial selection for increased defense against parasitoids in Drosophila melanogaster

An increase in resistance to one natural enemy may result in no correlated change, a positive correlated change, or a negative correlated change in the ability of the host or prey to resist other natural enemies. The type of specificity is important in understanding the evolutionary response to natural enemies and was studied here in a Drosaphila-parasitoid system. Drosophila melanogaster lines selected for increased larval resistance to the endoparasitoid wasps Asobara tabida or Leptopilina boulardi were exposed to attack by A. tabida, L. boulardi and Leptopilina heterotama at 15 degrees C, 20 degrees C, and 25 degrees C. In general, encapsulation ability increased with temperature, with the exception of the lines selected against L. boulardi, which showed the opposite trend. Lines selected against L, boulardi showed large increases in resistance against all three parasitoid species, and showed similar levels of defense against A. tabida to the lines selected against that parasitoid. In contrast, lines selected against A. tabida showed a large increase in resistance to A. tabida and generally to L. heterotoma, but displayed only a small change in their ability to survive attack by L. boulardi. Such asymmetries in correlated responses to selection for increased resistance to natural enemies may influence host-parasitoid community structure.

To 'be', and not to 'have': auxiliary selection in unaccusative verbs in Italian

This paper investigates the characteristics of unaccusative verbs in Italian with respect to the consistency with which these verbs select the auxiliaries ‘be’ (essere) and ‘have’ (avere) in compound tense forms. The study builds on the gradient approach to split intransitivity (Sorace 2000) by exploring the behaviour of 29 intransitive Italian verbs with respect to their core-peripheral features: auxiliary selection acceptability ratings and associated variance measures. Although there is clear support for the gradient approach in relation to the general order of semantic categories along the unaccusativity gradient, the results reveal that the ordering of subclasses within the Change group conflict with that currently proposed in the literature. In addition, the findings demonstrate the aspectual and lexical semantic characteristics of internally-caused change-of-state verbs in Italian require further investigation before their auxiliary selection behaviour can be properly understood. Furthermore, contrary to the gradient account, Existence verbs, the most stative and therefore the most peripheral subclass in the unaccusativity hierarchy, exhibit behaviour more characteristic of core unaccusative verbs. This study examines a wider range of semantic subclasses of unaccusative verbs than has hitherto been reported and identifies the core-peripheral boundary for Italian.1