Abstract

Aiming at the shortcomings of high feature reduction using traditional rough sets, such as insensitivity with noise data and easy loss of potentially useful information, combining with genetic algorithm, in this paper, a VPRS-GA (Variable Precision Rough Set--Genetic Algorithm) model for high-dimensional feature reduction of medical image is proposed. Firstly, rigid inclusion of the lower approximation is extended to partial inclusion by classification error rate β in the traditional rough set model, and the ability dealing with noise data is improved. Secondly, some factors of feature reduction are considered, such as attribute dependency, attributes reduction length, and gene coding weight. A general framework of fitness function is put forward, and different fitness functions are constructed by using different factors such as weight and classification error rate β. Finally, 98 dimensional features of PET/CT lung tumor ROI are extracted to build decision information table of lung tumor patients. Three kinds of experiments in high-dimensional feature reduction are carried out, using support vector machine to verify the influence of recognition accuracy in different fitness function parameters and classification error rate. Experimental results show that classification accuracy is affected deeply by different weight values under the invariable classification error rate condition and by increasing classification error rate under the invariable weigh value condition. Hence, in order to achieve better recognition accuracy, different problems use suitable parameter combination.

Highlights

  • Rough set theory was developed by Pawlak in 1982 [1], and it is a mathematical tool to deal with vagueness and uncertainty. e classification ability unchanged in its main idea, decision or classification rules of problem are derived by knowledge reduction [2]. e Variable Precision Rough Set (VPRS) theory, proposed by Ziarko, and is an extension of original rough set model

  • When β 0, Pawlak rough set model is a special case of variable precision rough set model. e main task of variable precision rough set model is to solve the problem of data classification with no function or uncertainty. e hierarchical model of attribute reduction for variable precision rough set is studied by Xiaowei [4]. ere is abnormal phenomenon in existing attribute reduction models; a variable precision rough set attribute reduction algorithm with the property of interval is proposed, and the reduction abnormal problem is transformed into a hierarchical model representation, and the reduction anomaly is gradually eliminated by the layer-by-layer reduction model; Jie and Jiayang [5] puts forward that there may be a reduction

  • Mathematical Problems in Engineering jump phenomenon in variable precision rough set feature reduction, which affects the quality of reduction and brings the problem of attribute reduction of variable precision rough set; Pei and Qinghua [6] proposes an FCM clustering algorithm based on variable precision rough set; according to the threshold characteristics of the variable precision rough set model, the algorithm divides the objects in the edge of the cluster into the positive, negative, and boundary regions, to improve the accuracy of clustering

Read more

Summary

Introduction

Rough set theory was developed by Pawlak in 1982 [1], and it is a mathematical tool to deal with vagueness and uncertainty. e classification ability unchanged in its main idea, decision or classification rules of problem are derived by knowledge reduction [2]. e Variable Precision Rough Set (VPRS) theory, proposed by Ziarko, and is an extension of original rough set model. Feature reduction is one of the core contents of rough set theory; in the condition of keeping the classification ability for knowledge base unchanged, we delete irrelevant or unimportant knowledge, which can reduce the dimension of the decision system, reduce the time complexity, and improve the efficiency of the algorithm [8]. Genetic algorithm is a computational model which is based on the natural selection and evolution mechanism; its core idea is inspired by the natural selection rule of the survival of the fittest, can achieve a highly parallel, random, and adaptive search, is not easy to fall into local optimal [10], can find the global optimal solution with high probability, and has great advantage in solving the NP-Hard problem

Materials and Methods
Attribute Dependency
Attribute Importance
Results and Discussion
Experimental Environment and Data
Conclusions
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call