Novel Approach For Feature Selection Research Articles

Optimizing Road Transportation Big Data: A Novel Approach for Feature Selection through Optimization Techniques

Road traffic accidents are very essential for common people, consequential an estimated 1.2 million deaths and 50 million injuries all over the world every year. In this emerging world, the road accidents are among the principal reason of fatality and injury. The concern of traffic safety has heaved immense alarms across the manageable enhancement of contemporary traffic and transportation. The analysis on road traffic accident grounds can detect the major aspects quickly, professionally and afford instructional techniques to the prevention of traffic accidents and reduction of road traffic accident, which might significantly decrease personal victim by means of road traffic accidents. Data Mining techniques are used in the process of knowledge discovery for many domains’ problems. Feature Selection plays a vital role for a large number of datasets. In this research work, the model involves two main phases (i) Feature Selection and (ii) Classification. Since the length of feature vector tends to high, optimal feature selection technology is included, from which the most relevant features are selected by the Lion-based Firefly Algorithm which is referred as Optimization based Feature Selection Method (OFSM). The main objective of this paper is projected on minimizing the correlation between the selected features, which results in providing diverse information regarding the different classes of data. Once, the optimal features are selected, the classification algorithm called Neural Network (NN) is adopted, which can classify the data in an effective manner with the selected features.

A Novel Feature Selection Method for Risk Management in High-Dimensional Time Series of Cryptocurrency Market

In this study, a novel approach for feature selection has been presented in order to overcome the challenge of classifying positive and negative risk prediction in the cryptocurrency market, which contains high fluctuation. This approach is based on maximizing information gain with simultaneously minimizing the similarity of selected features to achieve a proper feature set for improving classification accuracy. The proposed method was compared with other feature selection techniques, such as sequential and bidirectional feature selection, univariate feature selection, and least absolute shrinkage and selection operator. To evaluate the feature selection techniques, several classifiers were employed: XGBoost, k-nearest neighbor, support vector machine, random forest, logistic regression, long short-term memory, and deep neural networks. The features were elicited from the time series of Bitcoin, Binance, and Ethereum cryptocurrencies. The results of applying the selected features to different classifiers indicated that XGBoost and random forest provided better results on the time series datasets. Furthermore, the proposed feature selection method achieved the best results on two (out of three) cryptocurrencies. The accuracy in the best state varied between 55% to 68% for different time series. It is worth mentioning that preprocessed features were used in this research, meaning that raw data (candle data) were used to derive efficient features that can explain the problem and help the classifiers in predicting the labels.

Binary Horse Optimization Algorithm for Feature Selection

The bio-inspired research field has evolved greatly in the last few years due to the large number of novel proposed algorithms and their applications. The sources of inspiration for these novel bio-inspired algorithms are various, ranging from the behavior of groups of animals to the properties of various plants. One problem is the lack of one bio-inspired algorithm which can produce the best global solution for all types of optimization problems. The presented solution considers the proposal of a novel approach for feature selection in classification problems, which is based on a binary version of a novel bio-inspired algorithm. The principal contributions of this article are: (1) the presentation of the main steps of the original Horse Optimization Algorithm (HOA), (2) the adaptation of the HOA to a binary version called the Binary Horse Optimization Algorithm (BHOA), (3) the application of the BHOA in feature selection using nine state-of-the-art datasets from the UCI machine learning repository and the classifiers Random Forest (RF), Support Vector Machines (SVM), Gradient Boosted Trees (GBT), Logistic Regression (LR), K-Nearest Neighbors (K-NN), and Naïve Bayes (NB), and (4) the comparison of the results with the ones obtained using the Binary Grey Wolf Optimizer (BGWO), Binary Particle Swarm Optimization (BPSO), and Binary Crow Search Algorithm (BCSA). The experiments show that the BHOA is effective and robust, as it returned the best mean accuracy value and the best accuracy value for four and seven datasets, respectively, compared to BGWO, BPSO, and BCSA, which returned the best mean accuracy value for four, two, and two datasets, respectively, and the best accuracy value for eight, seven, and five datasets, respectively.

A Novel Approach for Feature Selection and Classification of Diabetes Mellitus: Machine Learning Methods.

An active research area where the experts from the medical field are trying to envisage the problem with more accuracy is diabetes prediction. Surveys conducted by WHO have shown a remarkable increase in the diabetic patients. Diabetes generally remains in dormant mode and it boosts the other diseases if patients are diagnosed with some other disease such as damage to the kidney vessels, problems in retina of the eye, and cardiac problem; if unidentified, it can create metabolic disorders and too many complications in the body. The main objective of our study is to draw a comparative study of different classifiers and feature selection methods to predict the diabetes with greater accuracy. In this paper, we have studied multilayer perceptron, decision trees, K-nearest neighbour, and random forest classifiers and few feature selection techniques were applied on the classifiers to detect the diabetes at an early stage. Raw data is subjected to preprocessing techniques, thus removing outliers and imputing missing values by mean and then in the end hyperparameters optimization. Experiments were conducted on PIMA Indians diabetes dataset using Weka 3.9 and the accuracy achieved for multilayer perceptron is 77.60%, for decision trees is 76.07%, for K-nearest neighbour is 78.58%, and for random forest is 79.8%, which is by far the best accuracy for random forest classifier.

Parasitism – Predation algorithm (PPA): A novel approach for feature selection

Maximizing the classification accuracy and minimizing the number of selected features are the two main incompatible objectives for using feature selection to overcome the curse of dimensionality. “Classification accuracy highly dependents on the nature of the features in a dataset which may contain irrelevant or redundant data. The main aim of feature selection is to eliminate these types of features to enhance the classification accuracy.” This work presents a new meta-heuristic optimization approach, called Parasitism-Predation Algorithm (PPA), which mimics the interaction between the predator (cats), the parasite (cuckoos) and the host (crows) in the crow–cuckoo–cat system model to overcome the problems of low convergence and the curse of dimensionality of large data. The proposed hybrid framework combines the relative advantages of cat swarm optimization (CSO), cuckoo search (CS) and crow search algorithm (CSA) to attain a combinatorial set of features to boost up the classification accuracy. Nesting, parasitism, and predation phases are supposed to help exploration ability and balance in the context of solving classification problems. In addition, Levy flight distribution is applied to help better diversity of conventional CSA and improve ability of exploration. Meanwhile, an effective fitness function is utilized to enable the proposed PPA-based feature selector using K-Nearest Neighbors algorithm (KNN) to attain a combinatorial set of features. The proposed PPA and four standard heuristic search algorithms are looked at to gauge how efficient the proposed option is. Additionally, eighteen classification datasets are deployed to gauges its efficacy. The results highlight that the algorithm proposed is both effective and competitive in terms of performance of classification and dimensionality reduction as opposed to other heuristic options.

A Novel Approach for Feature Selection and Classifier Optimization Compressed Medical Retrieval Using Hybrid Cuckoo Search

Nowadays, huge data bases are required to store the Digital medical images so that they can be accessed easily on requirement. To retrieve the diagnostic images, radiologist and physicians are using Content based image retrieval (CBIR). Algorithms extract features like texture, edge, color and shape from an image in CBIR systems and these extracted features from the input and are compared for similarity with the features of images in database. In this paper, Lossless compression is used for storage and effective transmission in inadequate bandwidth. Visually lossless image compression is obtained using the Daubechies wavelet with Huffman coding. Gabor transforms are utilized to extract the shape and texture features from the images. Features are selected with Mutual Information (MI) and the proposed wrapper based Cuckoo Search (CS) technique. Extracted features are fed as input to the proposed partial Recurrent Neural Networks (RNN) for the classification. The network is optimized hybrid Particle Swarm Optimization and Cuckoo Search. It was observed that the classification accuracy acquired is satisfactory

Selection by partitioning the solution paths

The performance of penalized likelihood approaches depends profoundly on the selection of the tuning parameter; however, there is no commonly agreed-upon criterion for choosing the tuning parameter. Moreover, penalized likelihood estimation based on a single value of the tuning parameter suffers from several drawbacks. This article introduces a novel approach for feature selection based on the entire solution paths rather than the choice of a single tuning parameter, which significantly improves the accuracy of the selection. Moreover, the approach allows for feature selection using ridge or other strictly convex penalties. The key idea is to classify variables as relevant or irrelevant at each tuning parameter and then to select all of the variables which have been classified as relevant at least once. We establish the theoretical properties of the method, which requires significantly weaker conditions than existing methods in the literature. We also illustrate the advantages of the proposed approach with simulation studies and a data example.

L0-norm based structural sparse least square regression for feature selection

This paper presents a novel approach for feature selection with regard to the problem of structural sparse least square regression (SSLSR). Rather than employing the l1-norm regularization to control the sparsity, we directly work with sparse solutions via l0-norm regularization. In particular, we develop an effective greedy algorithm, where the forward and backward steps are combined adaptively, to resolve the SSLSR problem with the intractable lr,0-norm. On the one hand, features with the strongest correlation to classes are selected in the forward steps. On the other hand, redundant features which contribute little to the improvement of the objective function are removed in the backward steps. Furthermore, we provide solid theoretical analysis to prove the effectiveness of the proposed method. Experimental results on synthetic and real world data sets from different domains also demonstrate the superiority of the proposed method over the state-of-the-arts.

Feature Selection with Chaotic Hybrid Artificial Bee Colony Algorithm based on Fuzzy (CHABCF)

Feature selection plays an important role in data mining and pattern recognition, especially in the case of large scale data. Feature selection is done due to large amount of noise and irrelevant features in the original data set. Hence, the efficiency of learning algorithms will increase incredibly if these irrelevant data are removed by this procedure. A novel approach for feature selection is introduced in this paper using CHABCF, (Chaotic Artificial Bee Colony based on Fuzzy), algorithm which is a combination of three paradigms: (1) Chaos theory (2) Artificial Bee Colony optimization and (3) Fuzzy logic. The fuzzy logic is used for ambiguity removal while chaos is used for generating better diversity in the initial population of our bee colony optimization algorithm. To demonstrate the efficiency of our algorithm, we have tested it on some well-known benchmarks such as wine, diabet and iris.

A Novel Approach for Feature Selection based on the Bee Colony Optimization

One of the successful methods in classification problems is feature selection. Feature selection algorithms; try to classify an instance with lower dimension, instead of huge number of required features, with higher and acceptable accuracy. In fact an instance may contain useless features which might result to misclassification. An appropriate feature selection methods tries to increase the effect of significant features while ignores insignificant subset of features. In this work feature selection is formulated as an optimization problem and a novel feature selection procedure in order to achieve to a better classification results is proposed. Experiments over a standard benchmark demonstrate that applying Bee Colony Optimization in the context of feature selection is a feasible approach and improves the classification results.

Genetic association studies for gene expressions: permutation-based mutual information in a comparison with standard ANOVA and as a novel approach for feature selection

Mutual information (MI) is a robust nonparametric statistical approach for identifying associations between genotypes and gene expression levels. Using the data of Problem 1 provided for the Genetic Analysis Workshop 15, we first compared a quantitative MI (Tsalenko et al. 2006 J Bioinform Comput Biol 4:259-4) with the standard analysis of variance (ANOVA) and the nonparametric Kruskal-Wallis (KW) test. We then proposed a novel feature selection approach using MI in a classification scenario to address the small n - large p problem and compared it with a feature selection that relies on an asymptotic chi2 distribution. In both applications, we used a permutation-based approach for evaluating the significance of MI. Substantial discrepancies in significance were observed between MI, ANOVA, and KW that can be explained by different empirical distributions of the data. In contrast to ANOVA and KW, MI detects shifts in location when the data are non-normally distributed, skewed, or contaminated with outliers. ANOVA but not MI is often significant if one genotype with a small frequency had a remarkable difference in the average gene expression level relative to the other two genotypes. MI depends on genotype frequencies and cannot detect these differences. In the classification scenario, we show that our novel approach for feature selection identifies a smaller list of markers with higher accuracy compared to the standard method. In conclusion, permutation-based MI approaches provide reliable and flexible statistical frameworks which seem to be well suited for data that are non-normal, skewed, or have an otherwise peculiar distribution. They merit further methodological investigation.

문서측 자질선정을 이용한 고속 문서분류기의 성능향상에 관한 연구

문서분류에 있어서 분류속도의 향상이 중요한 연구과제가 되고 있다. 최근 개발된 자질값투표 기법은 문서자동분류 문제에 대해서 매우 빠른 속도를 가졌지만, 분류정확도는 만족스럽지 못하다. 이 논문에서는 새로운 자질선정 기법인 문서측 자질선정 기법을 제안하고, 이를 자질값투표 기법에 적용해 보았다. 문서측 자질선정은 일반적인 분류자질선정과 달리 학습집단이 아닌 분류대상 문서의 자질 중 일부만을 선택하여 분류에 이용하는 방식이다. 문서측 자질선정을 적용한 실험에서는, 간단하고 빠른 자질값투표 분류기로 SVM 분류기만큼 좋은 성능을 얻을 수 있었다. High-speed classification method becomes an important research issue in text categorization systems. A fast text categorization technique, named feature value voting, is introduced recently on the text categorization problems. But the classification accuracy of this technique is not good as its classification speed. We present a novel approach for feature selection, named document-side feature selection, and apply it to feature value voting method. In this approach, there is no feature selection process in learning phase; but realtime feature selection is executed in classification phase. Our results show that feature value voting with document-side feature selection can allow fast and accurate text classification system, which seems to be competitive in classification performance with Support Vector Machines, the state-of-the-art text categorization algorithms.

Integral DOE and MANOVA techniques for classification feature selection: using solder joint defects as an example

This study presents a novel approach for feature selection using an integrated DOE and MANOVA technique to classify solder joint defects for print circuit boards (PCBs). The main selection procedure includes three stages. The first stage adopts a single feature variable selection algorithm to eliminate poorly discriminated feature variables. The second stage, Plackett-Burman (PB) resolution III design, is then constructed to select the remaining feature variables. The MANOVA technique is then used to calculate the Pillai statistic as the response to the PB design of experiment, and statistical analysis is then executed to obtain the optimal multiple feature variables for multiple groups. The discriminate function classifier is used to evaluate the classification results. The experimental analysis results show that the proposed analysis procedure can acquire an optimum subset of features for classification.