RHSOFS: Feature Selection Using the Rock Hyrax Swarm Optimization Algorithm for Credit Card Fraud Detection System

The goal of the feature selection process is, given a dataset described by n attributes (features), to find the minimum number m of relevant attributes which describe the data as well as the original set of attributes do. Genetic algorithms have been used to implement feature selection algorithms. Previous algorithms presented in the literature used the predictive accuracy of a specific learning algorithm as the fitness function to maximize over the space of possible feature subsets. Such an approach to feature selection requires a large amount of CPU time to reach a good solution on large datasets. This paper presents a genetic algorithm for feature selection which improves previous results presented in the literature for genetic-based feature selection. It is independent of a specific learning algorithm and requires less CPU time to reach a relevant subset of features. Reported experiments show that the proposed algorithm is at least ten times faster than a standard genetic algorithm for feature selection without a loss of predictive accuracy when a learning algorithm is applied to reduced data.

One of the important practical applications of computer vision techniques is computer-aided diagnosis (CAD) in medical imaging. It has been shown that CAD can improve the accuracy of breast cancer detection and characterization by radiologists on mammograms. In this chapter, we discuss an important step — feature selection — in classifier design for CAD algorithms. Feature selection reduces the dimensionality of an available feature space and is therefore often used to prevent over-parameterization of a classifier. Many feature selection techniques have been proposed in the literature. We will illustrate the usefulness of genetic algorithms (GAs) for feature selection by comparing GA with a commonly used sequential selection method. A brief introduction to the GA is given and several examples using GA feature selection for the characterization of mammographic lesions are discussed. The examples illustrate the design of a fitness function for optimizing classification accuracy in terms of the receiver operating characteristics of the classifier, the dependence of GA performance on its evolution parameters, and the design of a fitness function tailored to a specific classification task.

The explosive expansion of E-Commerce has led to a corresponding surge in credit card fraud as more people use their cards to make transactions online. Credit card fraud is on the rise as credit cards become the preferred method of payment for both online and in-store purchases. In practice, fraudulent and legitimate transactions coexist, and basic pattern-matching approaches are typically insufficient to identify fraud effectively. While Artificial Neural Networks (ANNs) offer several advantages, it's important to note that they require careful tuning, validation, and ongoing monitoring to ensure optimal performance. Additionally, the interpretability of ANNs can be a challenge, and efforts are being made to enhance model interpretability in the context of fraud detection. Identifying fraudulent transactions while avoiding false positives is the main objective of a credit card fraud detection system that uses ANNs effectively and correctly. Therefore, for credit card issues to reduce their loss, it is crucial that they implement reliable fraud detection systems. Various forms of credit card fraud may now be detected using cutting-edge methods based on Artificial Intelligence (AI), Data mining, Fuzzy logic, Machine learning (ML), sequence alignments, Genetics Programming, etc. An effective system for detecting credit card fraud requires a thorough grasp of all these methods. Using a set of predetermined criteria, this study examines the various neural network techniques currently in use for credit card fraud detection and provides an overall rating for each. The result shows 98% accuracy and 96% recall for the credit card fraud detection system.

Feature selection is the process of choosing, or removing, features to obtain the most informative feature subset of minimal size. Such subsets are used to improve performance of machine learning algorithms and enable human understanding of the results. Approaches to feature selection in literature exploit several optimization algorithms. Multi-objective methods also have been proposed, minimizing at the same time the number of features and the error. While most approaches assess error resorting to the average of a stochastic K-fold cross-validation, comparing averages might be misleading. In this paper, we show how feature subsets with different average error might in fact be non-separable when compared using a statistical test. Following this idea, clusters of non-separable optimal feature subsets are identified. The performance in feature selection can thus be evaluated by verifying how many of these optimal feature subsets an algorithm is able to identify. We thus propose a multi-objective optimization approach to feature selection, EvoFS, with the objectives to i. minimize feature subset size, ii. minimize test error on a 10-fold cross-validation using a specific classifier, iii. maximize the analysis of variance value of the lowest-performing feature in the set. Experiments on classification datasets whose feature subsets can be exhaustively evaluated show that our approach is able to always find the best feature subsets. Further experiments on a high-dimensional classification dataset, that cannot be exhaustively analyzed, show that our approach is able to find more optimal feature subsets than state-of-the-art feature selection algorithms.

Effective pixel classification of Mars images based on ant colony optimization feature selection and extreme learning machine

Landslides are a significant natural disaster threat in Indonesia, including Samarinda City. This study aims to evaluate the classification accuracy of landslides using the Naïve Bayes algorithm, combined with the Synthetic Minority Oversampling Technique (SMOTE) for class imbalance and Particle Swarm Optimization (PSO) for feature Selection and parameter optimization. Data were obtained from BPBD and BMKG Samarinda for 2022-2024, evaluated using 10-Fold Cross Validation and Confusion Matrix. The results show that SMOTE did not always improve model accuracy. Naïve Bayes without SMOTE achieved an average accuracy of 87.18%, while with SMOTE, it decreased to 70.55%. This indicates that SMOTE’s impact depends on the dataset. PSO, used for feature Selection and parameter optimization, gave mixed results. Naïve Bayes + PSO Feature Selection achieved an average accuracy of 68.25%, lower than the base model with SMOTE. Naïve Bayes + PSO Optimization achieved the best accuracy at 71.03%, though the improvement was minimal. The combination of Naïve Bayes + PSO Feature Selection + PSO Optimization had the lowest accuracy at 68.08%. This study emphasizes that the use of PSO for feature Selection and optimization needs careful consideration, especially when combined with SMOTE, as its effect on model performance is not always optimal.

A belt conveyor roller defect detection method based on genetic algorithm feature selection and stacking learning was proposed. Roller defect data from 1620 samples of three types of roller defects was first collected. To improve the detection efficiency of roller defects, a feature selection method based on a genetic algorithm for selecting roller defect features was proposed. The model classification efficiency of roller features after feature selection by the genetic algorithm was found to be higher. The feature subset with the highest fitness had a feature number of 35. A stacking learning model for detecting roller defects was also constructed. The stacking method enhanced the comprehensive performance of the base learner model for detecting roller defects. The stacking learning model finally achieved a classification accuracy of 94.86% on the roller defect dataset. The classification performance of the stacking learning model was better than that of its base learning model. The results showed that the stacking learning model was preferred for detecting roller defects. The proposed conveyor belt roller defect detection method, while achieving high accuracy, may be limited by potential overfitting and sensitivity to environmental conditions. The next steps in refining the conveyor belt roller defect detection method will focus on dataset expansion, algorithm parameter tuning, and environmental robustness testing.

A new hybrid filter/wrapper algorithm for feature selection in classification

This paper presents a new hybrid genetic algorithm (HGA) for feature selection (FS) called as HGAFS. HGAFS incorporates a new local search operation that is devised and embedded in HGA to fine-tune the search in FS. The proposed local search operation works on basis of the distinct and informative nature of input features that is computed by their correlation information. The aim of using correlation information is to encourage the local search strategy for selecting less correlated (distinct) features. Such an encouragement reduces the redundancy of information in the generated subset of salient features. We have tested our methods on several real-world datasets and have compared the performances with the results of other existing algorithms. It is found that HGAFS produces consistently better performances.

DBFS: An effective Density Based Feature Selection scheme for small sample size and high dimensional imbalanced data sets

Computer-aided diagnosis has the potential of increasing diagnostic accuracy by providing a second reading to radiologists. In many computerized schemes, numerous features can be extracted to describe suspect image regions. A subset of these features is then employed in a data classifier to determine whether the suspect region is abnormal or normal. Different subsets of features will, in general, result in different classification performances. A feature selection method is often used to determine an "optimal" subset of features to use with a particular classifier. A classifier performance measure (such as the area under the receiver operating characteristic curve) must be incorporated into this feature selection process. With limited datasets, however, there is a distribution in the classifier performance measure for a given classifier and subset of features. In this paper, we investigate the variation in the selected subset of "optimal" features as compared with the true optimal subset of features caused by this distribution of classifier performance. We consider examples in which the probability that the optimal subset of features is selected can be analytically computed. We show the dependence of this probability on the dataset sample size, the total number of features from which to select, the number of features selected, and the performance of the true optimal subset. Once a subset of features has been selected, the parameters of the data classifier must be determined. We show that, with limited datasets and/or a large number of features from which to choose, bias is introduced if the classifier parameters are determined using the same data that were employed to select the "optimal" subset of features.

Dynamic Adaboost learning with feature selection based on parallel genetic algorithm for image annotation

A feature selection approach combining genetic algorithm (GA) with mutual information (FSGM) is proposed. In fact, FSGM is a genetic algorithm applied to feature selection. For feature selection task, an individual of GA represents a feature subset, and the fitness function is the evaluation of the feature subset. With elaborating design, the global searching and completely evaluation can be realized in FSGM. The experimental results confirm the effectiveness of the proposed algorithm in improving the generalization and reducing the over fitting of selected feature subset.

With the rapid development of the mobile Internet, financial technology, especially artificial intelligence and blockchain technology, has profoundly changed our consumer behavior and the development model of the traditional financial industry. However, the accompanying risks are also being transmitted with unprecedented speed and complexity. Credit card fraud, as an important form of financial fraud, has caused huge economic losses and a crisis of trust for both financial institutions and consumers. Therefore, the establishment of an efficient and secure credit card fraud detection system has become an inevitable requirement for the continuous development of financial technology in the new era. The purpose of this paper is to study and develop a credit card fraud detection system based on federated learning, which can balance the positive and negative samples in credit card transaction data, protect the privacy of bank data, and effectively improve the accuracy and efficiency of fraud detection.

Credit card fraud is a significant problem for financial institutions and cardholders and can result in significant financial losses and damage to reputation. Detecting and preventing fraud in credit card transactions is critical to minimizing losses and maintaining customer trust. The main objective of this project is to build a model (a web-based system) that can effectively identify fraudulent transactions. This involves collecting and processing large datasets of credit card transactions, including both legitimate and fraudulent transactions, and using machine learning algorithms like decision trees and random forests to train a model to recognize patterns and anomalies. In addition, the system will have strong user authentication protocols that must be in place to prevent unauthorized access to the system.