Identification of nonlinear systems using generalized kernel models

Nonlinear system identification is considered using a generalized kernel regression model. Unlike the standard kernel model, which employs a fixed common variance for all the kernel regressors, each kernel regressor in the generalized kernel model has an individually tuned diagonal covariance matrix that is determined by maximizing the correlation between the training data and the regressor using a repeated guided random search based on boosting optimization. An efficient construction algorithm based on orthogonal forward regression with leave-one-out (LOO) test statistic and local regularization (LR) is then used to select a parsimonious generalized kernel regression model from the resulting full regression matrix. The proposed modeling algorithm is fully automatic and the user is not required to specify any criterion to terminate the construction procedure. Experimental results involving two real data sets demonstrate the effectiveness of the proposed nonlinear system identification approach.

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.

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 kernel-based two-class classifier for imbalanced data sets

Many kernel classifier construction algorithms adopt classification accuracy as performance metrics in model evaluation. Moreover, equal weighting is often applied to each data sample in parameter estimation. These modeling practices often become problematic if the data sets are imbalanced. We present a kernel classifier construction algorithm using orthogonal forward selection (OFS) in order to optimize the model generalization for imbalanced two-class data sets. This kernel classifier identification algorithm is based on a new regularized orthogonal weighted least squares (ROWLS) estimator and the model selection criterion of maximal leave-one-out area under curve (LOO-AUC) of the receiver operating characteristics (ROCs). It is shown that, owing to the orthogonalization procedure, the LOO-AUC can be calculated via an analytic formula based on the new regularized orthogonal weighted least squares parameter estimator, without actually splitting the estimation data set. The proposed algorithm can achieve minimal computational expense via a set of forward recursive updating formula in searching model terms with maximal incremental LOO-AUC value. Numerical examples are used to demonstrate the efficacy of the algorithm.

A forward-constrained regression algorithm for sparse kernel density estimation

Using the classical Parzen window (PW) estimate as the target function, the sparse kernel density estimator is constructed in a forward-constrained regression (FCR) manner. The proposed algorithm selects significant kernels one at a time, while the leave-one-out (LOO) test score is minimized subject to a simple positivity constraint in each forward stage. The model parameter estimation in each forward stage is simply the solution of jackknife parameter estimator for a single parameter, subject to the same positivity constraint check. For each selected kernels, the associated kernel width is updated via the Gauss-Newton method with the model parameter estimate fixed. The proposed approach is simple to implement and the associated computational cost is very low. Numerical examples are employed to demonstrate the efficacy of the proposed approach.

Stubs versus swabs? A comparison of gunshot residue collection techniques

The collection efficiency of two widely used gunshot residue (GSR) collection techniques—carbon-coated adhesive stubs and alcohol swabs—has been compared by counting the number of characteristic GSR particles collected from the firing hand of a shooter after firing one round. Samples were analyzed with both scanning electron microscopy and energy dispersive X-rays by an experienced GSR analyst, and the number of particles on each sample containing Pb, Ba, and Sb counted. The adhesive stubs showed a greater collection efficiency as all 24 samples gave positive results for GSR particles whereas the swabs gave only positive results for half of the 24 samples. Results showed a statistically significant collection efficiency for the stub collection method and likely reasons for this are considered.

Sparse kernel density estimation technique based on zero-norm constraint

A sparse kernel density estimator is derived based on the zero-norm constraint, in which the zero-norm of the kernel weights is incorporated to enhance model sparsity. The classical Parzen window estimate is adopted as the desired response for density estimation, and an approximate function of the zero-norm is used for achieving mathemtical tractability and algorithmic efficiency. Under the mild condition of the positive definite design matrix, the kernel weights of the proposed density estimator based on the zero-norm approximation can be obtained using the multiplicative nonnegative quadratic programming algorithm. Using the -optimality based selection algorithm as the preprocessing to select a small significant subset design matrix, the proposed zero-norm based approach offers an effective means for constructing very sparse kernel density estimates with excellent generalisation performance.

Regression based D-optimality experimental design for sparse kernel density estimation

This paper derives an efficient algorithm for constructing sparse kernel density (SKD) estimates. The algorithm first selects a very small subset of significant kernels using an orthogonal forward regression (OFR) procedure based on the D-optimality experimental design criterion. The weights of the resulting sparse kernel model are then calculated using a modified multiplicative nonnegative quadratic programming algorithm. Unlike most of the SKD estimators, the proposed D-optimality regression approach is an unsupervised construction algorithm and it does not require an empirical desired response for the kernel selection task. The strength of the D-optimality OFR is owing to the fact that the algorithm automatically selects a small subset of the most significant kernels related to the largest eigenvalues of the kernel design matrix, which counts for the most energy of the kernel training data, and this also guarantees the most accurate kernel weight estimate. The proposed method is also computationally attractive, in comparison with many existing SKD construction algorithms. Extensive numerical investigation demonstrates the ability of this regression-based approach to efficiently construct a very sparse kernel density estimate with excellent test accuracy, and our results show that the proposed method compares favourably with other existing sparse methods, in terms of test accuracy, model sparsity and complexity, for constructing kernel density estimates.

Lorrie Moore collection, 'A Little Ethnic Kink Is Always Good to See”: Jewish performance anxiety and anti-passing in the fiction of Lorrie Moore

This essay explores the ways in which the performance of Jewish identity (in the sense both of representing Jewish characters and of writing about those characters’ conscious and unconscious renditions of their Jewishness) is a particular concern (in both senses of the word) for Lorrie Moore. Tracing Moore's representations of Jewishness over the course of her career, from the early story “The Jewish Hunter” through to her most recent novel, A Gate at the Stairs, I argue that it is characterized by (borrowing a phrase from Moore herself) “performance anxiety,” an anxiety that manifests itself in awkward comedy and that can be read both in biographical terms and as an oblique commentary on, or reworking of, the passing narrative, which I call “anti-passing.” Just as passing narratives complicate conventional ethno-racial definitions so Moore's anti-passing narratives, by representing Jews who represent themselves as other to themselves, as well as to WASP America, destabilize the category of Jewishness and, by implication, deconstruct the very notion of ethnic categorization.

Proanthocyanidin diversity in the EU 'HealthyHay' sainfoin (onobrychis viciifolia) germplasm collection

This study investigated 37 diverse sainfoin (Onobrychis viciifolia Scop.) accessions from the EU ‘HealthyHay’ germplasm collection for proanthocyanidin (PA) content and composition. Accessions displayed a wide range of differences: PA contents varied from 0.57 to 2.80 g/100 g sainfoin; the mean degree of polymerisation from 12 to 84; the proportion of prodelphinidin tannins from 53% to 95%, and the proportion of trans-flavanol units from 12% to 34%. A positive correlation was found between PA contents (thiolytic versus acid–butanol degradation; P < 0.001; R2 = 0.49). A negative correlation existed between PA content (thiolysis) and mDP (P < 0.05; R2 = −0.30), which suggested that accessions with high PA contents had smaller PA polymers. Cluster analysis revealed that European accessions clustered into two main groups: Western Europe and Eastern Europe/Asia. In addition, accessions from USA, Canada and Armenia tended to cluster together. Overall, there was broad agreement between tannin clusters and clusters that were based on morphological and agronomic characteristics.