Palmprint Recognition Based on Neighborhood Rough Set

Neighborhood rough set based heterogeneous feature subset selection

Feature selection is the preliminary step in machine learning and data mining. It identifies the most important and relevant features within a dataset by eliminating the redundant or irrelevant features. The substantial benefits may include an improved performance in terms of high prediction accuracy, reduced computational complexity, and simply interpretable underlying models. In this paper, we present a novel framework to investigate and understand the importance of Monte Carlo tree search (MCTS) in feature selection for very high-dimensional datasets. We construct a binary feature selection tree where each node represents one of the two feature states: a feature is selected or not. The search starts with an empty root node reflecting that no feature is selected. Then, the search tree is expanded by adding nodes in an incremental fashion through MCTS-based simulations. Following tree and default policy, every iteration generates an initial feature subset, where a filter is used to select the top k features forming the candidate feature subset. The classification accuracy is used as the goodness or reward of the candidate feature subset and propagated backward up to the root node following the active path. Finally, the candidate subset with highest reward is selected as the best feature subset. Experiments are performed on 30 real-world datasets, including 14 very high-dimensional microarray datasets, and results are also compared with state-of-the-art methods in the literature, which proves the efficacy, validity, and significance of the proposed method.

Feature selection is a dimensionality reduction method known as a main step in data mining and machine learning. The aim of feature selection is to remove redundant and unrelated features. In recent years several feature selection methods based on graph theory and social networking techniques have been proposed .In this study, a feature selection approach based on multi objective PSO algorithm and social network techniques is presented. In the proposed method, Fisher score, node centrality and edge centrality are used to construct the fitness function in order to present a multi objective particle swarm optimization (PSO) approach. The proposed method run over a variety of datasets and the results are compared with the well-known filter-based feature selection methods. The results show that the proposed method is effective and the performance of the proposed method better than other methods in some cases.

Feature selection plays a central role in data analysis and is also a crucial step in machine learning, data mining and pattern recognition. Feature selection algorithm focuses mainly on the design of a criterion function and the selection of a search strategy. In this paper, a novel feature selection approach (NFSA) based on quantum genetic algorithm (QGA) and a good evaluation criterion is proposed to select the optimal feature subset from a large number of features extracted from radar emitter signals (RESs). The criterion function is given firstly. Then, detailed algorithm of QGA is described and its performances are analyzed. Finally, the best feature subset is selected from the original feature set (OFS) composed of 16 features of RESs. Experimental results show that the proposed approach reduces greatly the dimensions of OFS and heightens accurate recognition rate of RESs, which indicates that NFSA is feasible and effective.

Granular maximum decision entropy-based monotonic uncertainty measure for attribute reduction

A systematic study on attribute reduction with rough sets based on general binary relations

Feature selection is an important preprocessing step in machine learning and pattern recognition where in the former it is aimed at removing some irrelevant and/or redundant features from a given dataset. In this paper, a new graph theoretic based feature selection method is proposed. The proposed method uses the social network techniques to select the final feature set. In other word, the community detection algorithm with the node centrality measure are integrated for the feature selection problem. Furthermore, this method can be applied on both supervised and unsupervised modes. We also compared the performance of the proposed method with the well-known and state-of-the-art filter based feature selection methods. The results indicate that the efficiency and effectiveness of the proposed method as well as improvements over previous related methods can be seen.

Joint adaptive manifold and embedding learning for unsupervised feature selection

Data clustering is an important step in data mining and machine learning. It is especially crucial to analyze the data structures for further procedures. Recently a new clustering algorithm known as ‘neutrosophic c-means’ (NCM) was proposed in order to alleviate the limitations of the popular fuzzy c-means (FCM) clustering algorithm by introducing a new objective function which contains two types of rejection. The ambiguity rejection which concerned patterns lying near the cluster boundaries, and the distance rejection was dealing with patterns that are far away from the clusters. In this paper, we extend the idea of NCM for nonlinear-shaped data clustering by incorporating the kernel function into NCM. The new clustering algorithm is called Kernel Neutrosophic c-Means (KNCM), and has been evaluated through extensive experiments. Nonlinear-shaped toy datasets, real datasets and images were used in the experiments for demonstrating the efficiency of the proposed method. A comparison between Kernel FCM (KFCM) and KNCM was also accomplished in order to visualize the performance of both methods. According to the obtained results, the proposed KNCM produced better results than KFCM.

Neighborhood effective information ratio for hybrid feature subset evaluation and selection

MFeature: Towards high performance evolutionary tools for feature selection

Multi-label feature selection, which is an efficient and effective pre-processing step in machine learning and data mining, can select a feature subset that contains more contributions for multi-label classification while improving the performance of the classifiers. In real-world applications, an instance may be associated with multiple related labels with different relative importances, and the process of obtaining different features usually requires different costs, containing money, and time, etc. However, most existing works with regard to multi-label feature selection do not take into consideration the above two critical issues simultaneously. Therefore, in this paper, we exploit the idea of neighborhood granularity to enhance the traditional logical labels into label distribution forms to excavate the deeper supervised information hidden in multi-label data, and further consider the effect of the test cost under three different distributions, simultaneously. Motivated by these issues, a novel test cost multi-label feature selection algorithm with label enhancement and neighborhood granularity is designed. Moreover, the proposed algorithm is tested upon ten publicly available benchmark multi-label datasets with six widely-used metrics from two different aspects. Finally, two groups of experimental results demonstrate that the proposed algorithm achieves the satisfactory and superior performance over other four state-of-the-art comparing algorithms, and it is effective for improving the learning performance and decreasing the total test costs of the selected feature subset.

Today data's are stored in relation structures.In usual approach to mine these data, we often use to join several relations to form a single relation using foreign key links, which is known as flatten.Flatten may cause troubles such as time consuming, data redundancy and statistical skew on data.Hence, the critical issues arise that how to mine data directly on numerous relations.The solution of the given issue is the approach called multi-relational data mining (MRDM).Other issues are irrelevant or redundant attributes in a relation may not make contribution to classification accuracy.Thus, feature selection is an essential data pre-processing step in multi-relational data mining.By filtering out irrelevant or redundant features from relations for data mining, we improve classification accuracy, achieve good time performance, and improve comprehensibility of the models.We had proposed the entropy based feature selection method for Multi-relational Naïve Bayesian Classifier.We have use method InfoDist and Pearson's Correlation parameters, which will be used to filter out irrelevant and redundant features from the multi-relational database and will enhance classification accuracy.We analyzed our algorithm over PKDD financial dataset and achieved the better accuracy compare to the existing features selection methods.

Neighborhood rough sets are an effective model for handling numerical and categorical data entangled with vagueness, imprecision, or uncertainty. However, existing neighborhood rough set models and their feature selection methods treat each sample equally, whereas different types of samples inherently play different roles in constructing neighborhood granules and evaluating the goodness of features. In this study, the sample weight information is first introduced into neighborhood rough sets, and a novel weighted neighborhood rough set model is consequently constructed. Then, considering the lack of sample weight information in practical data, a margin-based weight optimization function is designed, based on which a gradient descent algorithm is provided to adaptively learn sample weights through maximizing sample margins. Finally, an average granule margin measure is put forward for feature selection, and a forward-adding heuristic algorithm is developed to generate an optimal feature subset. The proposed method constructs the weighted neighborhood rough sets using sample weights for the first time and is able to yield compact feature subsets with a large margin. Extensive experiments and statistical analysis on UCI datasets show that the proposed method achieves highly competitive performance in terms of feature reduction rate and classification accuracy when compared with other state-of-the-art methods.

Heart disease is still one of the top causes of death globally, demanding early and effective prediction tools. Traditional predictive models frequently have limitations because they rely on single‐source statistics, which may not represent the entire scenario of a patient's complex health profile. Feature selection is an essential preprocessing step in machine learning that improves model efficiency by eliminating irrelevant or redundant features. This study evaluates the impact of feature selection on six classification modelsNaïve Bayes, Logistic Regression, Decision Tree, K‐Nearest Neighbors (KNN), Support Vector Machine (SVM), and Random Forestacross four datasets. Performance was assessed using accuracy, precision, recall, F1‐score, and area under the curve (AUC) before and after feature selection. The results indicate that feature selection had varying effects across different models and datasets. In Dataset‐01, Random Forest maintained its strong performance (98.70% accuracy) even after feature selection, while SVM and KNN saw noticeable drops, with accuracy decreasing from 88.96% to 79.87% and 87.01% to 81.17% respectively. For Dataset‐02, SVM showed improvement, increasing from 80.00% to 85.00%, while Naïve Bayes and KNN also improved, reaching 82.50% and 82.50% accuracy, respectively. In Dataset‐03, Logistic Regression and KNN experienced declines, with accuracy dropping from 88.76% to 83.71% and 91.57% to 87.08%, respectively, while Random Forest fell from 97.75% to 91.57%. Dataset‐04 showed mixed results, with Logistic Regression improving from 86.67% to 91.11%, but KNN and Random Forest dropping from 97.78% to 84.44% and 91.11% to 82.22%, respectively. These findings suggest that while feature selection enhances performance for some models, it can negatively impact others, particularly those reliant on a larger feature set. Future research should explore adaptive feature selection techniques to optimize model performance across diverse datasets.