dimensionality reduction based on uncertain graph model

Classification in machine learning is done by many factors which called attributes. the higher the number of features, the more difficult it becomes to visualize the training set and then work on it. sometimes, most of these features are related to each other and are therefore considered redundant features. this is where dimensionality reduction (dr) algorithms come into play. in machine learning and statistics, dimensionality reduction is the process of reducing the number of supervised random variables by obtaining a set of main variables. dimensionality reduction can be divided into feature selection and feature extraction. this paper proposes a new dimensionality reduction algorithm in the feature selection category using pearson correlation of attributes and making uncertain graph models. the proposed model can be done for any number of features with increasing the classification performance compared with filter and wrapper strategies.