Parsimonious Mahalanobis Kernel for the Classification of High Dimensional Data

The classification of high dimensional data with kernel methods is considered in this article. Exploit- ing the emptiness property of high dimensional spaces, a kernel based on the Mahalanobis distance is proposed. The computation of the Mahalanobis distance requires the inversion of a covariance matrix. In high dimensional spaces, the estimated covariance matrix is ill-conditioned and its inversion is unstable or impossible. Using a parsimonious statistical model, namely the High Dimensional Discriminant Analysis model, the specific signal and noise subspaces are estimated for each considered class making the inverse of the class specific covariance matrix explicit and stable, leading to the definition of a parsimonious Mahalanobis kernel. A SVM based framework is used for selecting the hyperparameters of the parsimonious Mahalanobis kernel by optimizing the so-called radius-margin bound. Experimental results on three high dimensional data sets show that the proposed kernel is suitable for classifying high dimensional data, providing better classification accuracies than the conventional Gaussian kernel

Clustering in a Data Envelopment Analysis Using Bootstrapped Efficiency Scores

This paper explores the insight from the application of cluster analysis to the results of a Data Envelopment Analysis of productive behaviour. Cluster analysis involves the identification of groups among a set of different objects (individuals or characteristics). This is done via the definitions of a distance matrix that defines the relationship between the different objects, which then allows the determination of which objects are most similar into clusters. In the case of DEA, cluster analysis methods can be used to determine the degree of sensitivity of the efficiency score for a particular DMU to the presence of the other DMUs in the sample that make up the reference technology to that DMU. Using the bootstrapped values of the efficiency measures we construct two types of distance matrices. One is defined as a function of the variance covariance matrix of the scores with respect to each other. This implies that the covariance of the score of one DMU is used as a measure of the degree to which the efficiency measure for a single DMU is influenced by the efficiency level of another. An alternative distance measure is defined as a function of the ranks of the bootstrapped efficiency. An example is provided using both measures as the clustering distance for both a one input one output case and a two input two output case.

Anomalous resilient to decoherence macroscopic quantum superpositions generated by universally covariant optimal quantum cloning

We show that the quantum states generated by universal optimal quantum cloning of a single photon represent an universal set of quantum superpositions resilient to decoherence. We adopt Bures distance as a tool to investigate the persistence ofquantum coherence of these quantum states. According to this analysis, the process of universal cloning realizes a class of quantum superpositions that exhibits a covariance property in lossy configuration over the complete set of polarization states in the Bloch sphere.Comment: 8 pages, 6 figure