THE FEATURE SUBSET SELECTION ALGORITHM

The motivation of data mining is how to extract effective information from huge data in very large database. However, some redundant and irrelevant attributes, which result in low performance and high computing complexity, are included in the very large database in general.So, Feature Subset Selection (FSS) becomes one important issue in the field of data mining. In this letter, an FSS model based on the filter approach is built, which uses the simulated annealing genetic algorithm. Experimental results show that convergence and stability of this algorithm are adequately achieved.

Feature subset selection based on mahalanobis distance: a statistical rough set method

In order to select effective feature subsets for pattern classification, a novel statistics rough set method is presented based on generalized attribute reduction. Unlike classical reduction approaches, the objects in universe of discourse are signs of training sample sets and values of attributes are taken as statistical parameters. The binary relation and discernibility matrix for the reduction are induced by distance function. Furthermore, based on the monotony of the distance function defined by Mahalanobis distance, the effective feature subsets are obtained as generalized attribute reducts. Experiment result shows that the classification performance can be improved by using the selected feature subsets.

OPTIMAL ANTENNA SUBSET SELECTION AND BLIND DETECTION APPROACH APPLIED TO ORTHOGONAL SPACE-TIME BLOCK CODING

An approach combining optimal antenna subset selection with blind detection scheme for Orthogonal Space-Time Block Coding (OSTBC) is proposed in this paper. The optimal antenna sub- set selection is taken into account at transmitter and/or receiver sides, which chooses the optimal an- tennas to increase the diversity order of OSTBC and improve further its performance. In order to en- hance the robustness of the detection used in the conventional OSTBC scheme, a blind detection scheme based on Independent Component Analysis (ICA) is exploited which can directly extract transmitted signals without channel estimation. Performance analysis shows that the proposed ap- proach can achieve the full diversity and the flexibility of system design by using the antenna selec-tion and the ICA based blind detection schemes.

Face recognition based on subset selection via metric learning on manifold

With the development of face recognition using sparse representation based classification(SRC), many relevant methods have been proposed and investigated. However, when the dictionary is large and the representation is sparse, only a small proportion of the elements contributes to the l1-minimization. Under this observation,several approaches have been developed to carry out an efficient element selection procedure before SRC. In this paper, we employ a metric learning approach which helps find the active elements correctly by taking into account the interclass/intraclass relationship and manifold structure of face images. After the metric has been learned, a neighborhood graph is constructed in the projected space. A fast marching algorithm is used to rapidly select the subset from the graph, and SRC is implemented for classification. Experimental results show that our method achieves promising performance and significant efficiency enhancement.

Empirical Likelihood-Based Subset Selection for Partially Linear Autoregressive Models

Based on the empirical likelihood method, the subset selection and hypothesis test for parameters in a partially linear autoregressive model are investigated. We show that the empirical log-likelihood ratio at the true parameters converges to the standard chi-square distribution. We then present the definitions of the empirical likelihood-based Bayes information criteria （EBIC） and Akaike information criteria （EAIC）. The results show that EBIC is consistent at selecting subset variables while EAIC is not. Simulation studies demonstrate that the proposed empirical likelihood confidence regions have better coverage probabilities than the least square method, while EBIC has a higher chance to select the true model than EAIC.

Switching Between Antenna Subset Selection and Quasi-Orthogonal Space-Time Block Code in Presence of Correlation

We address the problem of adaptive modulation and coding scheme(AMCS) for a multi-input multioutput(MIMO) system in presence of time-varying transmitting correlation.Antenna subset selection and quasiorthogonal space-time block code(QOSTBC) have different error performances with different signal-to-noise ratios(SNRs) and in different spatial correlation scenarios.The error performance can be improved by selecting an appropriate transmission scheme to adapt to various channel conditions.The maximum distance criterion is the simplest and very effective algorithm for the antenna subset selection without needs of complex calculation and channel state information at transmitter(CSIT).The minimum error performance criteria and the simplified linear decision strategy are developed for constant transmission rate traffic to select the optimal transmission scheme.It can dramatically decrease algorithm complexity for obtaining error probability according to the known quantities comparing with using instant CSIT.Simulation results show that,remarkable performances including low SNR and weak spatial correlation at the expense of simple calculation and almost no bandwidth loss by adopting AMCS can be achieved.The proposed AMCS improves robustness of slowly varying spatial correlated channels.

An Efficient Allocation for Lung Transplantation Using Ant Colony Optimization

A relationship between lung transplant success and many features of recipients’/donors has long been studied.However,modeling a robust model of a potential impact on organ transplant success has proved challenging.In this study,a hybrid feature selection model was developed based on ant colony opti-mization(ACO)and k-nearest neighbor(kNN)classifier to investigate the rela-tionship between the most defining features of recipients/donors and lung transplant success using data from the United Network of Organ Sharing(UNOS).The proposed ACO-kNN approach explores the features space to identify the representative attributes and classify patients’functional status(i.e.,quality of life)after lung transplantation.The efficacy of the proposed model was verified using 3,684 records and 118 input features from the UNOS.The developed approach examined the reliability and validity of the lung allocation process.The results are promising regarding accuracy prediction to be 91.3%and low computational time,along with better decision capabilities,emphasizing the potential for automatic classification of the lung and other organs allocation pro-cesses.In addition,the proposed model recommends a new perspective on how medical experts and clinicians respond to uncertain and challenging lung alloca-tion strategies.Having such ACO-kNN model,a medical professional can sum-marize information through the proposed method and make decisions for the upcoming transplants to allocate the donor organ.

An Improved Binary Quantum-based Avian Navigation Optimizer Algorithm to Select Effective Feature Subset from Medical Data:A COVID-19 Case Study

Feature Subset Selection(FSS)is an NP-hard problem to remove redundant and irrelevant features particularly from medical data,and it can be effectively addressed by metaheuristic algorithms.However,existing binary versions of metaheuristic algorithms have issues with convergence and lack an effective binarization method,resulting in suboptimal solutions that hinder diagnosis and prediction accuracy.This paper aims to propose an Improved Binary Quantum-based Avian Navigation Optimizer Algorithm(IBQANA)for FSS in medical data preprocessing to address the suboptimal solutions arising from binary versions of metaheuristic algorithms.The proposed IBQANA’s contributions include the Hybrid Binary Operator(HBO)and the Distance-based Binary Search Strategy(DBSS).HBO is designed to convert continuous values into binary solutions,even for values outside the[0,1]range,ensuring accurate binary mapping.On the other hand,DBSS is a two-phase search strategy that enhances the performance of inferior search agents and accelerates convergence.By combining exploration and exploitation phases based on an adaptive probability function,DBSS effectively avoids local optima.The effectiveness of applying HBO is compared with five transfer function families and thresholding on 12 medical datasets,with feature numbers ranging from 8 to 10,509.IBQANA's effectiveness is evaluated regarding the accuracy,fitness,and selected features and compared with seven binary metaheuristic algorithms.Furthermore,IBQANA is utilized to detect COVID-19.The results reveal that the proposed IBQANA outperforms all comparative algorithms on COVID-19 and 11 other medical datasets.The proposed method presents a promising solution to the FSS problem in medical data preprocessing.

Integration of optical and SAR remote sensing images for crop-type mapping based on a novel object-oriented feature selection method

Remote sensing is an important technical means to investigate land resources.Optical imagery has been widely used in crop classification and can show changes in moisture and chlorophyll content in crop leaves,whereas synthetic aperture radar(SAR)imagery is sensitive to changes in growth states and morphological structures.Crop-type mapping with a single type of imagery sometimes has unsatisfactory precision,so providing precise spatiotemporal information on crop type at a local scale for agricultural applications is difficult.To explore the abilities of combining optical and SAR images and to solve the problem of inaccurate spatial information for land parcels,a new method is proposed in this paper to improve crop-type identification accuracy.Multifeatures were derived from the full polarimetric SAR data(GaoFen-3)and a high-resolution optical image(GaoFen-2),and the farmland parcels used as the basic for object-oriented classification were obtained from the GaoFen-2 image using optimal scale segmentation.A novel feature subset selection method based on within-class aggregation and between-class scatter(WA-BS)is proposed to extract the optimal feature subset.Finally,crop-type mapping was produced by a support vector machine(SVM)classifier.The results showed that the proposed method achieved good classification results with an overall accuracy of 89.50%,which is better than the crop classification results derived from SAR-based segmentation.Compared with the ReliefF,mRMR and LeastC feature selection algorithms,the WA-BS algorithm can effectively remove redundant features that are strongly correlated and obtain a high classification accuracy via the obtained optimal feature subset.This study shows that the accuracy of crop-type mapping in an area with multiple cropping patterns can be improved by the combination of optical and SAR remote sensing images.

GRAPH SPARSIFICATION BY UNIVERSAL GREEDY ALGORITHMS

Graph sparsification is to approximate an arbitrary graph by a sparse graph and is useful in many applications,such as simplification of social networks,least squares problems,and numerical solution of symmetric positive definite linear systems.In this paper,inspired by the well-known sparse signal recovery algorithm called orthogonal matching pursuit(OMP),we introduce a deterministic,greedy edge selection algorithm,which is called the universal greedy approach(UGA)for the graph sparsification problem.For a general spectral sparsification problem,e.g.,the positive subset selection problem from a set of m vectors in R n,we propose a nonnegative UGA algorithm which needs O(mn^(2)+n^(3)/ϵ^(2))time to find a 1+ϵ/β/1-ϵ/β-spectral sparsifier with positive coefficients with sparsity at most[n/ϵ^(2)],where β is the ratio between the smallest length and largest length of the vectors.The convergence of the nonnegative UGA algorithm is established.For the graph sparsification problem,another UGA algorithm is proposed which can output a 1+O(ϵ)/1-O(ϵ)-spectral sparsifier with[n/ϵ^(2)]edges in O(m+n^(2)/ϵ^(2))time from a graph with m edges and n vertices under some mild assumptions.This is a linear time algorithm in terms of the number of edges that the community of graph sparsification is looking for.The best result in the literature to the knowledge of the authors is the existence of a deterministic algorithm which is almost linear,i.e.O(m^(1+o(1)))for some o(1)=O((log log(m))^(2/3)/log^(1/3)(m)).Finally,extensive experimental results,including applications to graph clustering and least squares regression,show the effectiveness of proposed approaches.

Impact of preprocessing on medical data classification

The significance of the preprocessing stage in any data mining task is well known. Before attempting medical data classification, characteristics of medical datasets, including noise, incompleteness, and the existence of multiple and possibly irrelevant features, need to be addressed. In this paper, we show that selecting the right combination of prepro- cessing methods has a considerable impact on the classification potential of a dataset. The preprocessing operations con- sidered include the discretization of numeric attributes, the selection of attribute subset（s）, and the handling of missing values. The classification is performed by an ant colony optimization algorithm as a case study. Experimental results on 25 real-world medical datasets show that a significant relative improvement in predictive accuracy, exceeding 60% in some cases, is obtained.

Intelligent approach of score-based artificial fish swarm algorithm(SAFSA)for Parkinson’s disease diagnosis

Purpose-Conventional diagnostic techniques,on the other hand,may be prone to subjectivity since they depend on assessment of motions that are often subtle to individual eyes and hence hard to classify,potentially resulting in misdiagnosis.Meanwhile,early nonmotor signs of Parkinson’s disease(PD)can be mild and may be due to variety of other conditions.As a result,these signs are usually ignored,making early PD diagnosis difficult.Machine learning approaches for PD classification and healthy controls or individuals with similar medical symptoms have been introduced to solve these problems and to enhance the diagnostic and assessment processes of PD(like,movement disorders or other Parkinsonian syndromes).Design/methodology/approach-Medical observations and evaluation of medical symptoms,including characterization of a wide range of motor indications,are commonly used to diagnose PD.The quantity of the data being processed has grown in the last five years;feature selection has become a prerequisite before any classification.This study introduces a feature selection method based on the score-based artificial fish swarm algorithm(SAFSA)to overcome this issue.Findings-This study adds to the accuracy of PD identification by reducing the amount of chosen vocal features while to use the most recent and largest publicly accessible database.Feature subset selection in PD detection techniques starts by eliminating features that are not relevant or redundant.According to a few objective functions,features subset chosen should provide the best performance.Research limitations/implications-In many situations,this is an Nondeterministic Polynomial Time(NPHard)issue.This method enhances the PD detection rate by selecting the most essential features from the database.To begin,the data set’s dimensionality is reduced using Singular Value Decomposition dimensionality technique.Next,Biogeography-Based Optimization(BBO)for feature selection;the weight value is a vital parameter for finding the best features in PD classification.Originality/value-PD classification is done by using ensemble learning classification approaches such as hybrid classifier of fuzzy K-nearest neighbor,kernel support vector machines,fuzzy convolutional neural network and random forest.The suggested classifiers are trained using data from UCIMLrepository,and their results are verified using leave-one-person-out cross validation.The measures employed to assess the classifier efficiency include accuracy,F-measure,Matthews correlation coefficient.