5,208 research outputs found
Sparse multinomial kernel discriminant analysis (sMKDA)
Dimensionality reduction via canonical variate analysis (CVA) is important for pattern recognition and has been extended variously to permit more flexibility, e.g. by "kernelizing" the formulation. This can lead to over-fitting, usually ameliorated by regularization. Here, a method for sparse, multinomial kernel discriminant analysis (sMKDA) is proposed, using a sparse basis to control complexity. It is based on the connection between CVA and least-squares, and uses forward selection via orthogonal least-squares to approximate a basis, generalizing a similar approach for binomial problems. Classification can be performed directly via minimum Mahalanobis distance in the canonical variates. sMKDA achieves state-of-the-art performance in terms of accuracy and sparseness on 11 benchmark datasets
Regression-Based Methods for Using Control and Antithetic Variates in Monte Carlo Experiments
Methods based on linear regression provide a very easy way to use the information in control and antithetic variates to improve the efficiency with which certain features of the distributions of estimators and test statistics are estimated in Monte Carlo experiments. We propose a new technique that allows these methods to be used when the quantities of interest are quantiles. Ways to obtain approximately optimal control variates in many cases of interest are also proposed. These methods seem to work well in practice, and can greatly reduce the number of replications required to obtain a given level of accuracy.
Sparse canonical correlation analysis from a predictive point of view
Canonical correlation analysis (CCA) describes the associations between two
sets of variables by maximizing the correlation between linear combinations of
the variables in each data set. However, in high-dimensional settings where the
number of variables exceeds the sample size or when the variables are highly
correlated, traditional CCA is no longer appropriate. This paper proposes a
method for sparse CCA. Sparse estimation produces linear combinations of only a
subset of variables from each data set, thereby increasing the interpretability
of the canonical variates. We consider the CCA problem from a predictive point
of view and recast it into a regression framework. By combining an alternating
regression approach together with a lasso penalty, we induce sparsity in the
canonical vectors. We compare the performance with other sparse CCA techniques
in different simulation settings and illustrate its usefulness on a genomic
data set
Detecting Generalized Synchronization Between Chaotic Signals: A Kernel-based Approach
A unified framework for analyzing generalized synchronization in coupled
chaotic systems from data is proposed. The key of the proposed approach is the
use of the kernel methods recently developed in the field of machine learning.
Several successful applications are presented, which show the capability of the
kernel-based approach for detecting generalized synchronization. It is also
shown that the dynamical change of the coupling coefficient between two chaotic
systems can be captured by the proposed approach.Comment: 20 pages, 15 figures. massively revised as a full paper; issues on
the choice of parameters by cross validation, tests by surrogated data, etc.
are added as well as additional examples and figure
- …