20212021 IEEE International Conference on Power, Intelligent Computing and Systems (ICPICS)Requires access

Research on Attribute Reduction Algorithm of 0-1 Decision Information Table

Shuncheng Cai, Min Yue, Wenjie Li

Open publisher page 0 citations

Abstract

In order to study the attribute reduction of the decision information table, three different modes are adopted. The first mode performs attribute reduction under the premise that different attributes have the same weight, and performs attribute reduction on the given table by using a blindly deleted attribute reduction algorithm; the second mode is under the premise of considering different weights, Carry out attribute reduction, establish a mathematical model about the discernibility matrix through the information table, and perform attribute reduction on the information table according to the attribute reduction algorithm of the Skowron discernibility matrix; The third is to first calculate the total value of the attribute through the decision information table, and then consider the influence of each attribute on the total value of the attribute, establish a mathematical model according to the attribute reduction algorithm of Pawlak attribute importance, and perform attribute reduction according to the attribute importance. Theoretical analysis and simulation results show that the algorithm proposed in this paper is effective and feasible, improves the efficiency of attribute reduction, and provides a certain theoretical basis for attribute reduction.

About this research paper

What this paper is about

In order to study the attribute reduction of the decision information table, three different modes are adopted. The first mode performs attribute reduction under the premise that different attributes have the same weight, and performs attribute reduction on the given table by using a blindly deleted attribute reduction algorithm; the second mode is under the premise of considering different weights, Carry out attribute reduction, establish a mathematical model about the discernibility matrix through the information table, and perform attribute reduction on the information table according to the attribute reduction algorithm of the Skowron discernibility matrix; The third is to first calculate the total value of the attribute through the decision information table, and then consider the influence of each attribute on the total value of the attribute, establish a mathematical model according to the attribute reduction algorithm of Pawlak attribute importance, and perform attribute reduction according to the attribute importance. Theoretical analysis and simulation results show that the algorithm proposed in this paper is effective and feasible, improves the efficiency of attribute reduction, and provides a certain theoretical basis for attribute reduction.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

In order to study the attribute reduction of the decision information table, three different modes are adopted. The first mode performs attribute reduction under the premise that different attributes have the same weight, and performs attribute reduction on the given table by using a blindly deleted attribute reduction algorithm; the second mode is under the premise of considering different weights, Carry out attribute reduction, establish a mathematical model about the discernibility matrix through the information table, and perform attribute reduction on the information table according to the attribute reduction algorithm of the Skowron discernibility matrix; The third is to first calculate the total value of the attribute through the decision information table, and then consider the influence of each attribute on the total value of the attribute, establish a mathematical model according to the attribute reduction algorithm of Pawlak attribute importance, and perform attribute reduction according to the attribute importance. Theoretical analysis and simulation results show that the algorithm proposed in this paper is effective and feasible, improves the efficiency of attribute reduction, and provides a certain theoretical basis for attribute reduction.

Key concepts: Attribute domain, Decision table, Rough set, Reduction (mathematics), Premise, Data mining, Table (database), Computer science

Related papers

Back to paper searchBrowse research topicsOriginal source
Research on Attribute Reduction Algorithm of 0-1 Decision Information Table — Research Paper | ScholarLens