Feature Selection For Classification Research Articles

A Dynamic Tasking-Based Evolutionary Algorithm for Bi-Objective Feature Selection

Feature selection in classification is a complex optimization problem that cannot be solved in polynomial time. Bi-objective feature selection, aiming to minimize both selected features and classification errors, is challenging due to the conflict between objectives, while one of the most effective ways to tackle this is to use multi-objective evolutionary algorithms. However, very few of these have ever reflected an evolutionary multi-tasking framework, despite the implicit parallelism offered by the population-based search characteristic. In this paper, a dynamic multi-tasking-based multi-objective evolutionary algorithm (termed DTEA) is proposed for handling bi-objective feature selection in classification, which is not only suitable for datasets with relatively lower dimensionality of features, but is also suitable for datasets with relatively higher dimensionality of features. The role and influence of multi-tasking on multi-objective evolutionary feature selection were studied, and a dynamic tasking mechanism is proposed to self-adaptively assign multiple evolutionary search tasks by intermittently analyzing the population behaviors. The efficacy of DTEA is tested on 20 classification datasets and compared with seven state-of-the-art evolutionary algorithms. A component contribution analysis was also conducted by comparing DTEA with its three variants. The empirical results show that the dynamic-tasking mechanism works efficiently and enables DTEA to outperform other algorithms on most datasets in terms of both optimization and classification.

Quantum-enhanced hybrid feature engineering in thoracic CT image analysis for state-of-the-art nodule classification: an advanced lung cancer assessment

The intricate nature of lung cancer treatment poses considerable challenges upon diagnosis. Early detection plays a pivotal role in mitigating its escalating global mortality rates. Consequently, there are pressing demands for robust and dependable early detection and diagnostic systems. However, the technological limitations and complexity of the disease make it challenging to implement an efficient lung cancer screening system. AI-based CT image analysis techniques are showing significant contributions to the development of computer-assisted detection (CAD) systems for lung cancer screening. Various existing research groups are working on implementing CT image analysis systems for assessing and classifying lung cancer. However, the complexity of different structures inside the CT image is high and comprehension of significant information inherited by them is more complex even after applying advanced feature extraction and feature selection techniques. Traditional and classical feature selection techniques may struggle to capture complex interdependencies between features. They may get stuck in local optima and sometimes require additional exploration strategies. Traditional techniques may also struggle with combinatorial optimization problems when applied to a prominent feature space. This paper proposed a methodology to overcome the existing challenges by applying feature extraction using Vision Transformer (FexViT) and Feature selection using the Quantum Computing based Quadratic unconstrained binary optimization (QC-FSelQUBO) technique. This algorithm shows better performance when compared with other existing techniques. The proposed methodology showed better performance as compared to other existing techniques when evaluated by applying necessary output measures, such as accuracy, Area under roc (receiver operating characteristics) curve, precision, sensitivity, and specificity, obtained as 94.28%, 99.10%, 96.17%, 90.16% and 97.46%. The further advancement of CAD systems is essential to meet the demand for more reliable detection and diagnosis of cancer, which can be addressed by leading the proposed quantum computation and growing AI-based technology ahead.

Abstract PS06-07: Liquid biopsy determination of HER2 status in breast cancer: results from a novel epigenomic platform

Abstract Background: Tumor HER2 status remains a critical predictive biomarker for patients with breast cancer given the availability of highly effective anti-HER2 therapies. However, determination of HER2 status relies on a complex, tissue-dependent algorithm optimized for extremes of the phenotype – HER2+ vs HER2- status. Given the challenges in reliably obtaining informative tissue biopsies as disease progresses, the new therapeutic relevance of HER2-low breast cancer (IHC 1+ and FISH-negative IHC 2+), and the undependability of biomarkers in this range, better approaches are needed. Epigenomic signatures detectable in cell-free tumor DNA (cfDNA) may provide a minimally invasive, reliable determination of HER2 status. Here, we present a multimodal epigenomic liquid biopsy platform that could offer a minimally invasive alternative to tissue-based determination of transcriptionally regulated targets such as HER2. Methods: We identified patients with metastatic breast cancer (n=20) that were HER2-positive with IHC 3+ (n=6) or HER2-negative with IHC 0 (n=14) based on ASCO/CAP guidelines who underwent research biopsies at the Dana-Farber Cancer Institute from 2012-2023. Study participants had undergone concurrent blood sampling collected in Streck Tubes, processed as plasma, and stored at -80ºC. We applied a novel, multimodal epigenomic assay to profile tumor-derived gene regulatory programs from 1mL plasma. This genome-wide approach analyzed histone modifications associated with active gene promoters and enhancers, and DNA methylation. Classifier feature selection was derived from epigenomically profiled breast cancer cell lines. Final classifier performance was cross validated using a standard Leave one Out (LoO) scheme. Results: Our cross-validated classifier yielded an area under the ROC curve (AUC) of 0.91 in the 20 samples tested. When including only samples with detectable ctDNA as assessed by low pass whole genome sequencing (ichorCNA algorithm) (N=13), our classifier had an AUC of 0.98. Using regularized regression approach, we identified 33 loci with the highest predictive value; 8 loci were within the ERBB2 amplicon on chromosome 17, while the remaining 25 loci were in other genomic regions. We will present results from this and an expanded cohort, including participants with HER2 IHC 1+ and 2+ disease. Conclusions: We present a novel, minimally invasive HER2 classifier leveraging epigenomic information from cell-free tumor DNA from 1 mL plasma. If this approach remains robust in accurately classifying additional HER2 states, it could address the limitations of current tissue-based testing. Integration of this epigenomic platform in prospective interventional studies could support the development of novel and improved predictive classifiers for response to HER2-directed therapy. Citation Format: Heather Parsons, Sylvan Baca, Anthony D'Ippolito, Hyun-Hwan Jeong, Kalie Smith, Paolo Tarantino, Melissa Hughes, Kerry Sendrick, Corrie Painter, Ji-Heui Seo, Elizabeth Grant, Jamey Guess, Matthew Davidsohn, Gitanjali Lakshminarayanan, Sarah Strauss, Hunter Savignano, John Canniff, Brad Fortunato, Matthew Eaton, Toni Choueiri, Sara Tolaney, Matthew Freedman, Nancy Lin. Liquid biopsy determination of HER2 status in breast cancer: results from a novel epigenomic platform [abstract]. In: Proceedings of the 2023 San Antonio Breast Cancer Symposium; 2023 Dec 5-9; San Antonio, TX. Philadelphia (PA): AACR; Cancer Res 2024;84(9 Suppl):Abstract nr PS06-07.

Feature selection by Universum embedding

Feature selection in classification is an important task in machine learning. Inspired by the success of Universum support vector machine proposed by Weston et al. on improving the classification ability of classical support vector machine, this paper considers a special type of Universum and further lets it play its role in both useful feature identification and separating hyperplane construction, aiming to improve both the feature selection ability and classification performance of Universum support vector machine. By introducing this special Universum, a redundant feature can be identified by observing whether some Universum sample is useful. In fact, we prove that by observing the dual solution of the optimization problem, useful features can be selected from a set satisfying some properties. Due to the introduction of these extra Universum samples, it needs to cope with a large-scale optimization problem. To improve the training efficiency, we modify the sequential minimal optimization algorithm and further combine it with the coordinate descent technique to solve the proposed model. Experimental results on artificial datasets, benchmark datasets, and text classification datasets demonstrate that the proposed method improves the classification performance of support vector machine and Universum support vector machine, and also has good feature selection ability.

Classification feature selection and dimensionality reduction based on logical binary sine-cosine function arithmetic optimization algorithm

Arithmetic optimization algorithm (AOA) is a meta-heuristic algorithm inspired by mathematical operations. AOA has been diffusely used for optimization issues on continuous domains, but few scholars have studied discrete optimization problems. In this paper, we proposed Binary AOA (BAOA) based on two strategies to handle the feature selection problem. The first strategy used S-shaped and V-shaped shift functions to map continuous variables to discrete variables. The second strategy was to combine four logical operations (AND, OR, XOR, XNOR) on the basis of the transfer function, and constructed a parameter model based on the sine and cosine function. An enhanced logic binary sine–cosine function arithmetic optimization algorithm (LBSCAOA) was proposed to realize the position update of variables. Its purpose was to improve the algorithm's global search capabilities and local exploitation capabilities. In the simulation experiments, 20 datasets were selected to testify the capability of the proposed algorithm. Since KNN had the advantages of easy understanding and low training time complexity, this classifier was selected for evaluation. The performance of the improved algorithm was comprehensively evaluated by comparing the average classification accuracy, the average number of selected features, the average fitness value and the average running time. Simulation results showed LBSCAOA with V-Shaped “V4” stood out among many improved algorithms. On the other hand, LBSCAOA with V-Shaped “V4” was used as a representative to compare with other typical feature selection algorithms to verify its competitivenes.

A Multi-Task Decomposition-Based Evolutionary Algorithm for Tackling High-Dimensional Bi-Objective Feature Selection

Evolutionary algorithms have been widely applied for solving multi-objective optimization problems, while the feature selection in classification can also be treated as a discrete bi-objective optimization problem if attempting to minimize both the classification error and the ratio of selected features. However, traditional multi-objective evolutionary algorithms (MOEAs) may have drawbacks for tackling large-scale feature selection, due to the curse of dimensionality in the decision space. Therefore, in this paper, we concentrated on designing an multi-task decomposition-based evolutionary algorithm (abbreviated as MTDEA), especially for handling high-dimensional bi-objective feature selection in classification. To be more specific, multiple subpopulations related to different evolutionary tasks are separately initialized and then adaptively merged into a single integrated population during the evolution. Moreover, the ideal points for these multi-task subpopulations are dynamically adjusted every generation, in order to achieve different search preferences and evolutionary directions. In the experiments, the proposed MTDEA was compared with seven state-of-the-art MOEAs on 20 high-dimensional classification datasets in terms of three performance indicators, along with using comprehensive Wilcoxon and Friedman tests. It was found that the MTDEA performed the best on most datasets, with a significantly better search ability and promising efficiency.

A Comprehensive Review of Dimensionality Reduction Techniques for Real time Network Intrusion Detection with Applications in Cybersecurity

This paper reviews popular signature and anomaly-based intrusion detection systems (IDS). Dimensionality reduction techniques (DRT) are used to increase the efficiency of such systems for real-time operation. Autoencoder-based IDS is rapidly gaining in popularity, primarily due to its inherent ability to denoise data and reduce dimensionality. In addition to the efficiency, we also look at the classification techniques used by various authors, and the overall impact of a model in terms of performance metrics. This article is written for novices in cybersecurityto get a jumpstart on the latest IDS algorithms. The purpose is to give useful insights into the broad and progressive view of various techniques in wide use, expose high-impact future research areas and to summarize classic IDS methods and feature selection techniques.

A simple and efficient filter feature selection method via document-term matrix unitization

Text processing tasks commonly grapple with the challenge of high dimensionality. One of the most effective solutions to this challenge is to preprocess text data through feature selection methods. Feature selection can select the most advantageous features for subsequent operations (e.g., classification) from the native feature space of the text. This process effectively trims the feature space’s dimensionality, enhancing subsequent operations’ efficiency and accuracy. This paper proposes a straightforward and efficient filter feature selection method based on document-term matrix unitization (DTMU) for text processing. Diverging from previous filter feature selection methods that concentrate on scoring criteria definition, our method achieves more optimal feature selection by unitizing each column of the document-term matrix. This approach mitigates feature-to-feature influence and reinforces the role of the weighting proportion within the features. Subsequently, our scoring criterion subtracts the sum of weights for negative samples from positive samples and takes the absolute value. We conduct numerical experiments to compare DTMU with four advanced filter feature selection methods: max–min ratio metric, proportional rough feature selector, least loss, and relative discrimination criterion, along with two classical filter feature selection methods: Chi-square and information gain. The experiments are performed on four ten-thousand-dimensional feature space datasets: book, dvd, music, movie and two thousand-dimensional feature space datasets: imdb, amazon_cells, sourced from Amazon product reviews and movie reviews. Experimental findings demonstrate that DTMU selects more advantageous features for subsequent operations and achieves a higher dimensionality reduction rate than those of the other six methods used for comparison. Moreover, DTMU exhibits robust generalization capabilities across various classifiers and dimensional datasets. Notably, the average CPU time for a single run of DTMU is measured at 1.455 s.

Feature selection for classification with Spearman’s rank correlation coefficient-based self-information in divergence-based fuzzy rough sets

Feature selection facilitates uncertainty disposal and information mining, and it has received widespread research interests. Divergence-based fuzzy rough sets (Div-FRSs), a new kind of fuzzy rough sets, have been applied to feature selection and induced two efficient algorithms, FS-AFS and FS-RFS. Nevertheless, FS-AFS and FS-RFS still have advancement space, because the dependency functions only focus on lower approximation and ignore the uncertainty in upper approximation, which will certainly undermine the algorithmic evaluation effects. To this end, this paper introduces the upper approximation and fuses it with lower approximation via class-specific pattern and Spearman coefficient to construct a new information measurement for metric perfection, called Spearman-based self-information. Relying on this new measurement, a novel feature selection algorithm SPESI is established to improve FS-AFS and FS-RFS. At first, Spearman coefficient is introduced and upper approximation is defined. Second, class-driven precision and roughness are built by incorporating Spearman coefficient-based class-specific weight vectors with class-driven lower and upper approximations. Meanwhile, the granulation monotonicity of newly-defined measurements is also explored. Then, the core measurement Spearman-based self-information is firstly given and its feature significance motivates a feature selection algorithm SPESI with heuristic search. Finally, data experiments are implemented to validate the effectiveness of SPESI, and a conclusion can be drawn that SPESI outperforms FS-AFS and FS-RFS to acquire better classification performances with fewer feature numbers and less running time.

Stable feature selection utilizing Graph Convolutional Neural Network and Layer-wise Relevance Propagation for biomarker discovery in breast cancer

High-throughput technologies are becoming increasingly important in discovering prognostic biomarkers and in identifying novel drug targets. With Mammaprint, Oncotype DX, and many other prognostic molecular signatures breast cancer is one of the paradigmatic examples of the utility of high-throughput data to deliver prognostic biomarkers, that can be represented in a form of a rather short gene list. Such gene lists can be obtained as a set of features (genes) that are important for the decisions of a Machine Learning (ML) method applied to high-dimensional gene expression data. Several studies have identified predictive gene lists for patient prognosis in breast cancer, but these lists are unstable and have only a few genes in common. Instability of feature selection impedes biological interpretability: genes that are relevant for cancer pathology should be members of any predictive gene list obtained for the same clinical type of patients. Stability and interpretability of selected features can be improved by including information on molecular networks in ML methods. Graph Convolutional Neural Network (GCNN) is a contemporary deep learning approach applicable to gene expression data structured by a prior knowledge molecular network. Layer-wise Relevance Propagation (LRP) and SHapley Additive exPlanations (SHAP) are methods to explain individual decisions of deep learning models. We used both GCNN+LRP and GCNN+SHAP techniques to construct feature sets by aggregating individual explanations. We suggest a methodology to systematically and quantitatively analyze the stability, the impact on the classification performance, and the interpretability of the selected feature sets. We used this methodology to compare GCNN+LRP to GCNN+SHAP and to more classical ML-based feature selection approaches. Utilizing a large breast cancer gene expression dataset we show that, while feature selection with SHAP is useful in applications where selected features have to be impactful for classification performance, among all studied methods GCNN+LRP delivers the most stable (reproducible) and interpretable gene lists.

A Correlation-Redundancy Guided Evolutionary Algorithm and Its Application to High-Dimensional Feature Selection in Classification

The processing of high-dimensional datasets has become unavoidable with the development of information technology. Most of the literature on feature selection (FS) of high-dimensional datasets focuses on improvements in search strategies, ignoring the characteristics of the dataset itself such as the correlation and redundancy of each feature. This could degrade the algorithm's search effectiveness. Thus, this paper proposes a correlation-redundancy guided evolutionary algorithm (CRGEA) to address high-dimensional FS with the objectives of optimizing classification accuracy and the number of features simultaneously. A new correlation-redundancy assessment method is designed for selecting features with high relevance and low redundancy to speed up the entire evolutionary process. In CRGEA, a novel initialization strategy combined with a multiple threshold selection mechanism is developed to produce a high-quality initial population. A local acceleration evolution strategy based on a parallel simulated annealing algorithm and a pruning method is developed, which can search in different directions and perform deep searches combing the annealing stage around the best solutions to improve the local search ability. Finally, the comparison experiments on 16 public high-dimensional datasets verify that the designed CRGEA outperforms other state-of-the-art intelligent algorithms. The CRGEA can efficiently reduce redundant features while ensuring high accuracy.

Search space division method for wrapper feature selection on high-dimensional data classification

Feature selection (FS) is an essential pre-processing technique for high-dimensional data. Wrapper-based FS techniques are known for their superior performance over filter FS. However, when the dimensionality of data is very high the wrapper techniques become computationally very expensive. To solve this problem of scalability, this paper proposes the concept of search space division (SSD) which leads to smaller search spaces and hence reduced computational cost. The proposed SSD approach is generic in nature and can be integrated with any wrapper-based FS technique. The SSD approach divides search space into multiple parts and the wrapper-based FS is independently applied to each part. To facilitate the interaction of features over the complete search space, all feature subsets obtained from each part are combined and the wrapper-based FS is again applied to get the final feature subset. Moreover, a new wrapper FS technique named Binary Rao (BRAO) Algorithm has been proposed. BRAO is based on the metaphor-less, parameter-less meta-heuristic optimization algorithm Rao-1. The proposed combination of SSD and BRAO algorithm named SSDR has produced better classification accuracies with a smaller number of features in a much shorter time as compared to other well-regarded wrapper FS techniques as well as classical FS techniques over thirteen benchmark high-dimensional datasets.

Feature selection of microarray data using multidimensional graph neural network and supernode hierarchical clustering

Cancer remains a significant cause of mortality, and the application of microarray technology has opened new avenues for cancer diagnosis and treatment. However, due to the challenges in sample acquisition, the genetic dimension of microarray data surpasses the sample dimension, resulting in high-dimensional small sample data. Effective feature selection is crucial for identifying biomarkers and facilitating further analysis. However, existing methods struggle to fully exploit the interdependencies among genes, such as regulatory networks and pathways, to guide the feature selection process and construct efficient classification models. In this paper, we propose a novel feature selection algorithm and classification model based on graph neural networks to address these challenges. Our proposed method employs a multidimensional graph to capture intricate gene interactions. We leverage link prediction techniques to enhance the graph structure relationships and employ a multidimensional node evaluator alongside a supernode discovery algorithm based on spectral clustering for initial node filtering. Subsequently, a hierarchical graph pooling technique based on downsampling is used to further refine node selection for feature extraction and model building. We evaluate the proposed method on nine publicly available microarray datasets, and the results demonstrate its superiority over both classical and advanced feature selection techniques in various evaluation metrics. This highlights the effectiveness and advancement of our proposed approach in addressing the complexities associated with microarray data analysis and cancer classification.

A Hybrid Initialization and Effective Reproduction-Based Evolutionary Algorithm for Tackling Bi-Objective Large-Scale Feature Selection in Classification

Evolutionary algorithms have been widely used for tackling multi-objective optimization problems, while feature selection in classification can also be seen as a discrete bi-objective optimization problem that pursues minimizing both the classification error and the number of selected features. However, traditional multi-objective evolutionary algorithms (MOEAs) can encounter setbacks when the dimensionality of features explodes to a large scale, i.e., the curse of dimensionality. Thus, in this paper, we focus on designing an adaptive MOEA framework for solving bi-objective feature selection, especially on large-scale datasets, by adopting hybrid initialization and effective reproduction (called HIER). The former attempts to improve the starting state of evolution by composing a hybrid initial population, while the latter tries to generate more effective offspring by modifying the whole reproduction process. Moreover, the statistical experiment results suggest that HIER generally performs the best on most of the 20 test datasets, compared with six state-of-the-art MOEAs, in terms of multiple metrics covering both optimization and classification performances. Then, the component contribution of HIER is also studied, suggesting that each of its essential components has a positive effect. Finally, the computational time complexity of HIER is also analyzed, suggesting that HIER is not time-consuming at all and shows promising computational efficiency.

Multi-Objective Self-Adaptive Particle Swarm Optimization for Large-Scale Feature Selection in Classification.

Feature selection (FS) is recognized for its role in enhancing the performance of learning algorithms, especially for high-dimensional datasets. In recent times, FS has been framed as a multi-objective optimization problem, leading to the application of various multi-objective evolutionary algorithms (MOEAs) to address it. However, the solution space expands exponentially with the dataset's dimensionality. Simultaneously, the extensive search space often results in numerous local optimal solutions due to a large proportion of unrelated and redundant features [H.Adeli and H.S. Park, Fully automated design of super-high-rise building structures by a hybrid ai model on a massively parallel machine, AI Mag.17 (1996) 87-93]. Consequently, existing MOEAs struggle with local optima stagnation, particularly in large-scale multi-objective FS problems (LSMOFSPs). Different LSMOFSPs generally exhibit unique characteristics, yet most existing MOEAs rely on a single candidate solution generation strategy (CSGS), which may be less efficient for diverse LSMOFSPs [H.S. Park and H.Adeli, Distributed neural dynamics algorithms for optimization of large steel structures, J. Struct. Eng. ASCE123 (1997) 880-888; M.Aldwaik and H.Adeli, Advances in optimization of highrise building structures, Struct. Multidiscip. Optim.50 (2014) 899-919; E.G. González, J.R. Villar, Q.Tan, J.Sedano and C.Chira, An efficient multi-robot path planning solution using a* and coevolutionary algorithms, Integr. Comput. Aided Eng.30 (2022) 41-52]. Moreover, selecting an appropriate MOEA and determining its corresponding parameter values for a specified LSMOFSP is time-consuming. To address these challenges, a multi-objective self-adaptive particle swarm optimization (MOSaPSO) algorithm is proposed, combined with a rapid nondominated sorting approach. MOSaPSO employs a self-adaptive mechanism, along with five modified efficient CSGSs, to generate new solutions. Experiments were conducted on ten datasets, and the results demonstrate that the number of features is effectively reduced by MOSaPSO while lowering the classification error rate. Furthermore, superior performance is observed in comparison to its counterparts on both the training and test sets, with advantages becoming increasingly evident as the dimensionality increases.

A Tri-objective Method for Bi-objective Feature Selection in Classification.

Minimizing the number of selected features and maximizing the classification performance are two main objectives in feature selection, which can be formulated as a biobjective optimization problem. Due to the complex interactions between features, a solution (i.e., feature subset) with poor objective values does not mean that all the features it selects are useless, as some of them combined with other complementary features can greatly improve the classification performance. Thus, it is necessary to consider not only the performance of feature subsets in the objective space, but also their differences in the search space, to explore more promising feature combinations. To this end, this paper proposes a tri-objective method for bi-objective feature selection in classification, which solves a bi-objective feature selection problem as a triobjective problem by considering the diversity (differences) between feature subsets in the search space as the third objective. The selection based on the converted triobjective method can maintain a balance between minimizing the number of selected features, maximizing the classification performance, and exploring more promising feature subsets. Furthermore, a novel initialization strategy and an offspring reproduction operator are proposed to promote the diversity of feature subsets in the objective space and improve the search ability, respectively. The proposed algorithm is compared with five multi-objective-based feature selection methods, six typical feature selection methods, and two peer methods with diversity as a helper objective. Experimental results on 20 real-world classification datasets suggest that the proposed method outperforms the compared methods in most scenarios.

Blood cell image segmentation and classification: a systematic review.

Blood diseases such as leukemia, anemia, lymphoma, and thalassemia are hematological disorders that relate to abnormalities in the morphology and concentration of blood elements, specifically white blood cells (WBC) and red blood cells (RBC). Accurate and efficient diagnosis of these conditions significantly depends on the expertise of hematologists and pathologists. To assist the pathologist in the diagnostic process, there has been growing interest in utilizing computer-aided diagnostic (CAD) techniques, particularly those using medical image processing and machine learning algorithms. Previous surveys in this domain have been narrowly focused, often only addressing specific areas like segmentation or classification but lacking a holistic view like segmentation, classification, feature extraction, dataset utilization, evaluation matrices, etc. This survey aims to provide a comprehensive and systematic review of existing literature and research work in the field of blood image analysis using deep learning techniques. It particularly focuses on medical image processing techniques and deep learning algorithms that excel in the morphological characterization of WBCs and RBCs. The review is structured to cover four main areas: segmentation techniques, classification methodologies, descriptive feature selection, evaluation parameters, and dataset selection for the analysis of WBCs and RBCs. Our analysis reveals several interesting trends and preferences among researchers. Regarding dataset selection, approximately 50% of research related to WBC segmentation and 60% for RBC segmentation opted for manually obtaining images rather than using a predefined dataset. When it comes to classification, 45% of the previous work on WBCs chose the ALL-IDB dataset, while a significant 73% of researchers focused on RBC classification decided to manually obtain images from medical institutions instead of utilizing predefined datasets. In terms of feature selection for classification, morphological features were the most popular, being chosen in 55% and 80% of studies related to WBC and RBC classification, respectively. The diagnostic accuracy for blood-related diseases like leukemia, anemia, lymphoma, and thalassemia can be significantly enhanced through the effective use of CAD techniques, which have evolved considerably in recent years. This survey provides a broad and in-depth review of the techniques being employed, from image segmentation to classification, feature selection, utilization of evaluation matrices, and dataset selection. The inconsistency in dataset selection suggests a need for standardized, high-quality datasets to strengthen the diagnostic capabilities of these techniques further. Additionally, the popularity of morphological features indicates that future research could further explore and innovate in this direction.

An evolutionary multiobjective method based on dominance and decomposition for feature selection in classification

An evolutionary multiobjective method based on dominance and decomposition for feature selection in classification

Evaluating Effects of Resting-State Electroencephalography Data Pre-Processing on a Machine Learning Task for Parkinson's Disease.

Resting-state electroencephalography pre-processing methods in machine learning studies into Parkinson's disease classification vary widely. Here three separate data sets were pre-processed to four different stages to investigate the effects on evaluation metrics, using power features from six regions-of-interest, Random Forest Classifiers for feature selection, and Support Vector Machines for classification. This showed muscle artefact inflated evaluation metrics, and alpha and theta band features produced the best results when fully pre-processing data.

Filter method-based feature selection process for unattributed-identity multi-target regression problem

Unattributed-identity multi-target regression (UIMTR) is defined as a multi-target regression problem in which the identity of the target and predictor variables is not predefined. It is a problem that can be found in several real-world applications. For example, when historical data is available from a set of devices, but real-time data can only be requested from a subset of them (so called sentinels). For estimating real-time status of non-sentinels, it will be necessary to generate multi-target regression models. Therefore, attributing the identity of the real-time communicators (sentinels), i.e., the predictor variables, is a critical aspect. Moreover, unlike classical feature selection problems, the set of target variables is determined after applying the selection methods and not before, thus, some adaptations are necessary. We introduce three novel methods to solve the UIMTR and, after extensive evaluation, we demonstrate: (i) the feasibility of the methods, (ii) the usefulness of the approach, and (iii) the improvement over other classical techniques. The results have been evaluated from three perspectives: (i) the quality of the predictions, (ii) the stability of the methods and (iii) the execution time.