Multidimensional rotations in feature selection
Mathematical feature selection transformations by multidimensional rotations, considering character recognition experiment
Andrews, H. C.↗
SEARCH · Search NASA
Results for “Feature selection”
Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.
Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.
Decision boundary feature selection for non-parametric classifier
Feature selection has been one of the most important topics in pattern recognition. Although many authors have studied feature selection for parametric classifiers, few algorithms are available for feature selection for nonparametric classifiers. In this paper we propose a new feature selection algorithm based on decision boundaries for nonparametric classifiers. We first note that feature selection for pattern recognition is equivalent to retaining 'discriminantly informative features', and a discriminantly informative feature is related to the decision boundary. A procedure to extract discriminantly informative features based on a decision boundary for nonparametric classification is proposed. Experiments show that the proposed algorithm finds effective features for the nonparametric classifier with Parzen density estimation.
Lee, Chulhee↗
Feature Selection for Classification of Polar Regions Using a Fuzzy Expert System
Labeling, feature selection, and the choice of classifier are critical elements for classification of scenes and for image understanding. This study examines several methods for feature selection in polar regions, including the list, of a fuzzy logic-based expert system for further refinement of a set of selected features. Six Advanced Very High Resolution Radiometer (AVHRR) Local Area Coverage (LAC) arctic scenes are classified into nine classes: water, snow / ice, ice cloud, land, thin stratus, stratus over water, cumulus over water, textured snow over water, and snow-covered mountains. Sixty-seven spectral and textural features are computed and analyzed by the feature selection algorithms. The divergence, histogram analysis, and discriminant analysis approaches are intercompared for their effectiveness in feature selection. The fuzzy expert system method is used not only to determine the effectiveness of each approach in classifying polar scenes, but also to further reduce the features into a more optimal set. For each selection method,features are ranked from best to worst, and the best half of the features are selected. Then, rules using these selected features are defined. The results of running the fuzzy expert system with these rules show that the divergence method produces the best set features, not only does it produce the highest classification accuracy, but also it has the lowest computation requirements. A reduction of the set of features produced by the divergence method using the fuzzy expert system results in an overall classification accuracy of over 95 %. However, this increase of accuracy has a high computation cost.
Penaloza, Mauel A.↗
On minimizing the probability of misclassification for linear feature selection
The use of techniques for feature selection permits treatment of classification problems in spaces of reduced dimensions. A method is considered of linear feature selection for n-dimensional observation vectors which belong to one of two populations, where each population is described by a known multivariate normal density function. More specifically, the problem of finding a 1xn transformation matrix B for which the probability of misclassification with respect to the one-dimensional transformed density functions was minimized was considered. Theoretical results are presented which give rise to a numerically tractable expression for the variation in the probability of misclassification with respect to B. Using this expression a computational procedure is discussed for obtaining a B which minimizes the probability of misclassification. Preliminary numerical results are discussed.
Guseman, L. F., Jr.↗
Feature selection for neural networks using Parzen density estimator
A feature selection method for neural networks is proposed using the Parzen density estimator. A new feature set is selected using the decision boundary feature selection algorithm. The selected feature set is then used to train a neural network. Using a reduced feature set, an attempt is made to reduce the training time of the neural network and obtain a simpler neural network, which further reduces the classification time for test data.
Lee, Chulhee↗
A counter example in linear feature selection theory
The linear feature selection problem in multi-class pattern recognition is described as that of linearly transforming statistical information from n-dimensional (real Euclidean) space into k-dimensional space, while requiring that average interclass divergence in the transformed space decrease as little as possible. Divergence is the expected interclass divergence derived from Hajek two-class divergence; it is known that there always exists a k x n matrix B such that the transformation determined by B maximizes the divergence in k-dimensional space. It is known that, if Q is any k x k invertible matrix, and B is as defined above, then QB again maximizes the divergence in k-space. It is shown that the converse of this result is false: two matrices exist, B sub 1 and B sub 2, each of which maximizes transformed divergence, which are not related in the fashion B sub 2 = QB sub 1 for any k x k matrix Q.
Brown, D. R.↗
Linear feature selection with applications
Several ways in which feature selection techniques were used in LACIE are discussed. In all cases, the methods require some a priori information and assumptions; in most, the classification procedure (Bayes optimal) was chosen in advance. The transformations used for dimensionality reduction are linear, that is, the variables in feature space are always linear combinations of the original measurements. Several numerically tractable criteria developed for LACIE, which provide information about the probability of misclassification, are discussed. Recent results on linear feature selection techniques are included. Their use in LACIE is discussed. Related open questions are mentioned.
Decell, H. P., Jr.↗
On differentiating the probability of error in multipopular feature selection
A method of linear feature selection for n dimensional observation vectors which belong to one of m populations is presented. Each population has a known apriori probability and is described by a known multivariate normal density function. Specifically we consider the problem of finding a k x n matrix B of rank k (k n) for which the transformed probability of misclassification is minimized. Providing that the transformed a posterior probabilities are distinct theoretical results are obtained which, for the case k = l, give rise to a numerically tractable formula for the derivative of the probability of misclassification. It is shown that for the two population problem this condition is also necessary. The dependence of the minimum probability of error on the a priori probabilities is investigated. The minimum probability of error satisfies a uniform Lipschitz condition with respect to the a priori probabilities.
Peters, B. C.↗
Some results on the divergence criterion used to solve the feature selection problem
Techniques for solving the feature selection problem are presented. Topics discussed include the reduction of the number of variables in "best b", and the iterative selection of H sub i.
Brown, D. R.↗
Two effective feature selection criteria for multispectral remote sensing
Distance measures which are useful for feature selection are considered, giving attention to the divergence distance measure and the Jeffreys-Matusita (JM) distance. Experimental studies show that the JM-distance yields more reliable results than other distance measures. A number of questions which are not solved by the experiments are discussed. The investigation provides an explanation for previous observations that the JM-distance and a saturating transform of divergence are highly useful for feature selection in the multiclass case.
Swain, P. H.↗
Evaluation of entropy and JM-distance criterions as features selection methods using spectral and spatial features derived from LANDSAT images
A study area near Ribeirao Preto in Sao Paulo state was selected, with predominance in sugar cane. Eight features were extracted from the 4 original bands of LANDSAT image, using low-pass and high-pass filtering to obtain spatial features. There were 5 training sites in order to acquire the necessary parameters. Two groups of four channels were selected from 12 channels using JM-distance and entropy criterions. The number of selected channels was defined by physical restrictions of the image analyzer and computacional costs. The evaluation was performed by extracting the confusion matrix for training and tests areas, with a maximum likelihood classifier, and by defining performance indexes based on those matrixes for each group of channels. Results show that in spatial features and supervised classification, the entropy criterion is better in the sense that allows a more accurate and generalized definition of class signature. On the other hand, JM-distance criterion strongly reduces the misclassification within training areas.
Parada, N. D. J.↗
Orthogonal transforms and feature selection in pattern recognition
Orthogonal transforms and feature selection using pattern, Harr, Walsh, Fourier and Karhunen- Loeve spaces for providing efficient classification algorithms in pattern recognition
Andrews, H. C.↗
An Iterative Approach to the Feature Selection Problem
The problem dealt with concerns feature selection or reducing the dimension of the data to be processed from n to k. By reducing the dimension of the data from n to k, classification time is generally reduced. Yet the dimension reduction should not be so great that classification accuracy is impaired. Thus, the general problem is considered of classifying an n-dimensional observation vector x into one of m-distinct classes where each class is normally distributed with mean and covariance. It is shown that the probability of misclassification is minimized if a maximum likelihood classification procedure is used to classify the data. The dimension of each observation vector to be processed is conveniently reduced by performing the transformation y = Bx, where B is a K by n matrix of rank k. Thus, the n-dimensional classification problem transforms into a k-dimensional classification problem.
Decell, H. P., Jr.↗
Feature Selection in High-Dimensional Space with Applications to Gene Expression Data
Recent years have seen rapid growth in high-dimensional datasets. Most existing machine learning (ML) algorithms fail in high-dimensional settings where many features could be redundant. A critical process of feature selection is thus applied in such a setting that helps in identifying the most relevant features while removing redundant ones. With the increase in high dimensionality, one is also faced with problems of efficiency and interpretation in performing such selection methods. Therefore, this paper proposes a “novel” feature selection framework that uses an ensemble of interpretable ML algorithms to perform feature selection and the ranking of final features. Finally, this framework is applied to a gene expression dataset obtained through collaboration with the National Aeronautics and Space Administration (NASA)’s Biological and Physical Sciences (BPS) team and helps identify important and relevant genes contributing to specific target attributes through classification tasks.
Nishan Pantha↗
Choice: 36 band feature selection software with applications to multispectral pattern recognition
Feature selection software was developed at the Earth Resources Laboratory that is capable of inputting up to 36 channels and selecting channel subsets according to several criteria based on divergence. One of the criterion used is compatible with the table look-up classifier requirements. The software indicates which channel subset best separates (based on average divergence) each class from all other classes. The software employs an exhaustive search technique, and computer time is not prohibitive. A typical task to select the best 4 of 22 channels for 12 classes takes 9 minutes on a Univac 1108 computer.
Jones, W. C.↗
Walsh functions in image processing, feature selection and pattern recognition
Walsh functions in image processing, rotational feature selection and pattern recognition, defining set of orthogonal transformations
Andrews, H. C.↗
Nearest-Neighbor Machine Learning Feature Selection for Interpretation of Microbial Molecular Signatures from Isotope Ratio Mass Spectrometry Data
Mass spectrometry (MS) promises to be a powerful tool for potential biosignature detection during astrobiological missions on ocean worlds in our solar system. Accurate and generalizable machine learning methods could enhance science return on investment by predicting seawater chemistry and classifying isotopic biosignatures, either as a signature consistent with microbial life (biotic) or as a novelty (unclassified/unique). However, machine learning models are likely to be complex and involve interactions between MS features, making biosignatures difficult to interpret. Feature selection methods provide biological and chemical context that help interpret the mechanisms of machine learning models, but these methods also need the ability to detect complex interactions. Previously, we developed a machine learning feature selection algorithm called nearest-neighbor projected distance regression (NPDR) that has the ability to identify important model features that involve complex interactions and automatically reduce correlation and the dimensionality in a high-dimensional variable space. The standard distance metrics used in NPDR – Manhattan and Euclidean – assume the multivariate data are isotropic, which is often violated in real data due to differences in the covariance between variables. Thus, we extend NPDR to include a random forest distance, and other anisotropic distance metrics, for computing nearest neighbors. We also augment the isotope-ratio MS data with time-series features from the raw MS signal to improve biotic classification. We test NPDR on our novel experimental ocean world seawater analog MS data. We measure isotope fractionations of volatile CO 2 that could be measured in exospheres or plumes. Samples include baseline abiotic conditions using a range of possible seawater chemistry consistent with Europa and Enceladus, and biotic samples that include microbes in these seawaters. We use penalized NPDR with random forest proximity to identify interpretable microbial molecular signatures. We compare features with random forest importance, and we train a classifier that discriminates between biotic and abiotic samples with high accuracy. These ML-trained ocean-world analog MS data could be used to assist in identifying biosignatures during future missions.
geochemistry↗
Weighted feature selection criteria for visual servoing of a telerobot
Because of the continually changing environment of a space station, visual feedback is a vital element of a telerobotic system. A real time visual servoing system would allow a telerobot to track and manipulate randomly moving objects. Methodologies for the automatic selection of image features to be used to visually control the relative position between an eye-in-hand telerobot and a known object are devised. A weighted criteria function with both image recognition and control components is used to select the combination of image features which provides the best control. Simulation and experimental results of a PUMA robot arm visually tracking a randomly moving carburetor gasket with a visual update time of 70 milliseconds are discussed.
Feddema, John T.↗