Feature Extraction and Fuzzy-Based Feature Selection Method for Long Range Captured Iris Images

Software defect prediction models are used for predicting high risk software components. Feature selection has significant impact on the prediction performance of the software defect prediction models since redundant and unimportant features make the prediction model more difficult to learn. Ensemble feature selection has recently emerged as a new methodology for enhancing feature selection performance. This paper proposes a new multi-criteria-decision-making (MCDM) based ensemble feature selection (EFS) method. This new method is termed as MCDM-EFS. The proposed method, MCDM-EFS, first generates the decision matrix signifying the feature’s importance score with respect to various existing feature selection methods. Next, the decision matrix is used as the input to well-known MCDM method TOPSIS for assigning a final rank to each feature. The proposed approach is validated by an experimental study for predicting software defects using two classifiers K-nearest neighbor (KNN) and naïve bayes (NB) over five open-source datasets. The predictive performance of the proposed approach is compared with existing feature selection algorithms. Two evaluation metrics – nMCC and G-measure are used to compare predictive performance. The experimental results show that the MCDM-EFS significantly improves the predictive performance of software defect prediction models against other feature selection methods in terms of nMCC as well as G-measure.

Risk evaluation is an important part of the product design and product manufacturing process; it entails the pursuit of the highest product quality and preventing failure under the constraints of limited resources. The failure mode and effects analysis approach is one of the most widely applied risk evaluation tools that uses the product of the three risk elements of product failure items, severity, occurrence probability, and detection probability, to calculate the risk priority number, the priority of failure risk. However, the typical failure mode and effects analysis method ignores the consideration of objective weights, which may lead to incorrect evaluation results. Moreover, the method of expressing information about product failure provided by experts also directly affects the results of risk assessment. To comprehensively assess the risk of product failure, in this study, the hybrid of the Fermatean fuzzy set and entropy method was used to prioritize product failure items risk. This study used a service failure mode and effects analysis numerical example of self-service electric vehicles to illustrate and test the correctness of the proposed new hybrid Fermatean fuzzy set and entropy method. The mathematical operation results were also compared with the listing of different calculation methods. The test results prove that the proposed new hybrid Fermatean fuzzy set and entropy method can fully consider the cognitive information provided by experts to provide more accurate risk ranking results of failure items.

Ordinal measures have been demonstrated as an effective feature representation model for iris and palmprint recognition. However, ordinal measures are a general concept of image analysis and numerous variants with different parameter settings, such as location, scale, orientation, and so on, can be derived to construct a huge feature space. This paper proposes a novel optimization formulation for ordinal feature selection with successful applications to both iris and palmprint recognition. The objective function of the proposed feature selection method has two parts, i.e., misclassification error of intra and interclass matching samples and weighted sparsity of ordinal feature descriptors. Therefore, the feature selection aims to achieve an accurate and sparse representation of ordinal measures. And, the optimization subjects to a number of linear inequality constraints, which require that all intra and interclass matching pairs are well separated with a large margin. Ordinal feature selection is formulated as a linear programming (LP) problem so that a solution can be efficiently obtained even on a large-scale feature pool and training database. Extensive experimental results demonstrate that the proposed LP formulation is advantageous over existing feature selection methods, such as mRMR, ReliefF, Boosting, and Lasso for biometric recognition, reporting state-of-the-art accuracy on CASIA and PolyU databases.

High-order correlation detecting in features for diagnosis of Alzheimer’s disease and mild cognitive impairment

Many feature selection methods have been proposed for text categorization. However, their performances are usually verified by experiments, so the results rely on the corpora used and may not be accurate. This paper proposes a novel feature selection framework called Distribution-Based Feature Selection (DBFS) based on distribution difference of features. This framework generalizes most of the state-of-the-art feature selection methods including OCFS, MI, ECE, IG, CHI and OR. The performances of many feature selection methods can be estimated by theoretical analysis using components of this framework. Besides, DBFS sheds light on the merits and drawbacks of many existing feature selection methods. In addition, this framework helps to select suitable feature selection methods for specific domains. Moreover, a weighted model based on DBFS is given so that suitable feature selection methods for unbalanced datasets can be derived. The experimental results show that they are more effective than CHI, IG and OCFS on both balanced and unbalanced datasets.

The paper proposes a hybrid approach to reduce dimension in text classification problems, to overcome the issue of Curse of Dimensionality. This hybrid approach is a combination of Feature Selection (FS) and Feature Extraction (FE) methods, considering different aspects of feature relevance, to effectively reduce the dimension in large text datasets. It prevents feature selection biased in favor of a particular FS method. Many FS methods like Term Variance, Document Frequency, Information Gain, Shannons Entropy measure, Mean-Median and Mean Absolute Difference, were implemented and a comparative study was made on their performance when implemented in a hybrid system. The features selected by the individual FS methods are merged using three approaches, namely, Union, Intersection and Modified Union. The sub lists of features further undergo Feature Extraction by PCA, and the reduced feature sub list is clustered with k-means. Finally, the sentiment-score of the individual clusters are calculated using SentiWordNet database which gives the polarity of the data. The experiments were conducted on the benchmark datasets namely Reuters-21,578 and Classic4. The performance evaluation of the system made using the measures like precision, recall, f-score and accuracy shows that the proposed method has improved performance compared to its competitive methods.

Hyperspectral images (HSIs) generally contain a large amount of spectral bands (features), and the redundant information in them will cause the Hughes phenomenon in the classification process. And feature extraction and feature selection are the two main existing methods to effectively reduce the redundancy of spectral information in the field of HSIs classification. Compared with feature extraction methods, feature selection methods can preserve most of the features of the original HSIs data without losing their valuable details. However, most existing feature selection methods based on single scene (domain) perform poorly in some scenes (domains) with insufficient labeled samples. Therefore, how to adopt an efficient feature selection method to select the optimal feature subsets of source scene and target scene and use the sample information of source scene to assist in the classification of target scene so as to improve the classification accuracy of images in the target scene as much as possible is still very challenging. In order to solve the above problem, this paper proposes a new cross-scene algorithm: Improved Ant Colony Optimization Algorithm-Based Cross-Scene Feature Selection Algorithm (IMACO-CSFS). In order to obtain more accurate feature subsets of the two scenes, IMACO-CSFS proposes a priority sorting-based ant colony strategy to make the subsequent search process focus on the global optimal solution (optimal feature subset) found in the previous iteration. In addition, in order to further accelerate the convergence speed of the global optimal solution, an ant colony strategy based on elite ants is proposed in IMACO-CSFS to more efficiently obtain the optimal feature subsets of the two scenes for training the classifier. Furthermore, this paper simultaneously considers overall classification accuracies of the optimal feature subsets for both scenes and dynamically adjusts their scale to ensure the consistency of the selected features between the two scenes, attenuating the effect of spectral shift and achieving the higher image classification accuracy in the target scene. Experimental results on three cross-scene HSI data pairs demonstrate that IMACO-CSFS is superior in cross-scene feature selection and cross-scene HSIs classification.

In order to solve the problem of face recognition, the method of feature extraction and feature selection is presented in this paper. First using Gabor filters and face image as the convolution Operator to extract the Gabor feature vector of the image and also to uniform sampling; then using the PCA + LDA method to reduce the dimension for high-dimensional Gabor feature vector; Finally, using the nearest neighbor classifier to discriminate and determine the identity of a face image. The result I get is that the sampled Gabor feature in high-dimensional space can be projected onto low-dimensional space though the method of feature selection and compression. The new and original in this paper is that the method of PCA + LDA overcomes the problem of the spread matrix singular in the class and matrix too large which is brought by directly use the LDA.

Personnel evaluation process is aimed at choosing the best alternative to fill the defined vacancy in an organization. It determines the input quality of personnel and thus plays an important role in human resource management. The multi criteria nature and the presence of qualitative factors make it considerably more complex. This paper proposes a hybrid fuzzy MCDM model for personnel evaluation. It combines the fuzzy TOPSIS method with fuzzy worst-case (or entropy) method for linguistic reasoning under group decision making. Fuzzy worst-case and entropy methods are used to get weights of criteria, while fuzzy TOPSIS is utilized to rank the alternatives. The weights obtained from fuzzy worst-case and entropy methods are included in fuzzy TOPSIS computations and the alternatives are evaluated. The fuzzy MCDM for group decision making enables to aggregate subjective assessments of the decision-makers and thus offer an opportunity to perform more robust personnel evaluation procedures. To evaluate the alternatives the authors have formed an executive group consisting of five decision-makers. For evaluation the group has decided to consider five information culture criteria expressed in linguistic variables. A numerical example demonstrated the possibilities of application of the proposed method.

In the field of fault diagnosis, machine learning is highly valued for its broad applicability and efficiency. Feature extraction and feature selection are key steps in the application of machine learning, and the performance of fault diagnosis methods relies heavily on the effective execution of these two steps. For this reason, this paper aims to enhance the performance of fault diagnosis methods by improving these two aspects. Firstly, to address the non-linearity and non-stationarity of rotating machinery vibration signals under variable operation conditions, this paper proposes an improved rapid refined composite multiscale sample entropy (IR2CMSE) feature extraction method. In addition, this paper decomposes the vibration signals with improved complete ensemble empirical mode decomposition with adaptive noise (ICEEMDAN) and extracts the sensitive intrinsic modal functions’ (IMFs') IR2CMSE values (SI-IR2CMSE) as the initial feature vector, which more accurately reveals the intrinsic time-scale characteristics of the vibration signals. Secondly, to address the problem of over-reliance on sample labels in most feature selection methods, this paper proposes a semi-supervised Gaussian mixing model with sparse regularization (SSGMM-SR) feature selection model. The model does not require complete fault labels and can automatically identify important features. Finally, validation with two rotating machinery fault datasets shows that the method proposed in this study exhibits high diagnostic accuracy and stability across multiple classifiers.

With the rapid development of artificial intelligence in recent years, the research on image processing, text mining, and genome informatics has gradually deepened, and the mining of large-scale databases has begun to receive more and more attention. The objects of data mining have also become more complex, and the data dimensions of mining objects have become higher and higher. Compared with the ultra-high data dimensions, the number of samples available for analysis is too small, resulting in the production of high-dimensional small sample data. High-dimensional small sample data will bring serious dimensional disasters to the mining process. Through feature selection, redundancy and noise features in high-dimensional small sample data can be effectively eliminated, avoiding dimensional disasters and improving the actual efficiency of mining algorithms. However, the existing feature selection methods emphasize the classification or clustering performance of the feature selection results and ignore the stability of the feature selection results, which will lead to unstable feature selection results, and it is difficult to obtain real and understandable features. Based on the traditional feature selection method, this paper proposes an ensemble feature selection method, Random Bits Forest Recursive Clustering Eliminate (RBF-RCE) feature selection method, combined with multiple sets of basic classifiers to carry out parallel learning and screen out the best feature classification results, optimizes the classification performance of traditional feature selection methods, and can also improve the stability of feature selection. Then, this paper analyzes the reasons for the instability of feature selection and introduces a feature selection stability measurement method, the Intersection Measurement (IM), to evaluate whether the feature selection process is stable. The effectiveness of the proposed method is verified by experiments on several groups of high-dimensional small sample data sets.

Feature selection with specific multivariate performance measures is the key to the success of many applications such as image retrieval and text classification. The existing feature selection methods are usually designed for classification error. In this paper, we propose a generalized sparse regularizer. Based on the proposed regularizer, we present a unified feature selection framework for general loss functions. In particular, we study the novel feature selection paradigm by optimizing multivariate performance measures. The resultant formulation is a challenging problem for high-dimensional data. Hence, a two-layer cutting plane algorithm is proposed to solve this problem, and the convergence is presented. In addition, we adapt the proposed method to optimize multivariate measures for multiple-instance learning problems. The analyses by comparing with the state-of-the-art feature selection methods show that the proposed method is superior to others. Extensive experiments on large-scale and high-dimensional real-world datasets show that the proposed method outperforms l₁-SVM and SVM-RFE when choosing a small subset of features, and achieves significantly improved performances over SVM(perf) in terms of F₁-score.

Day by day the number of text documents in digital form is increasing. Text classification is used to organize these text documents. However, text classification has the problem of high dimensionality of feature space. This high dimensionality of feature space is solved by feature selection and feature extraction methods and improves the performance of text categorization. The feature selection and feature extraction techniques remove the irrelevant features from the text documents and reduce the dimensionality of feature space. This paper presents the various feature selection and feature extraction methods. This paper also discusses various classifiers to classify the documents.

Low-rank learning for feature selection in multi-label classification

To recognize expressions accurately, facial expression systems require robust feature extraction and feature selection methods. In this paper, a normalized mutual information based feature selection technique is proposed for FER systems. The technique is derived from an existing method, that is, the max-relevance and min-redundancy (mRMR) method. We, however, propose to normalize the mutual information used in this method so that the domination of the relevance or of the redundancy can be eliminated. For feature extraction, curvelet transform is used. After the feature extraction and selection the feature space is reduced by employing linear discriminant analysis (LDA). Finally, hidden Markov model (HMM) is used to recognize the expressions. The proposed FER system (CNF-FER) is validated using four publicly available standard datasets. For each dataset, 10-fold cross validation scheme is utilized. CNF-FER outperformed the existing well-known statistical and state-of-the-art methods by achieving a weighted average recognition rate of 99 % across all the datasets.