an evolutionary multi-objective discretization based on normalized cut

Learning models and related results depend on the quality of the input data. if raw data is not properly cleaned and structured, the results are tending to be incorrect. therefore, discretization as one of the preprocessing techniques plays an important role in learning processes. the most important challenge in the discretization process is to reduce the number of features’ values. this operation should be applied in a way that relationships between the features are maintained and accuracy of the classification algorithms would increase. in this paper, a new evolutionary multiobjective algorithm is presented. the proposed algorithm uses three objective functions to achieve highquality discretization. the first and second objectives minimize the number of selected cut points and classification error, respectively. the third objective introduces a new criterion called the normalized cut, which uses the relationships between their features’ values to maintain the nature of the data. the performance of the proposed algorithm was tested using 20 benchmark datasets. according to the comparisons and the results of nonparametric statistical tests, the proposed algorithm has a better performance than other existing major methods.