2013•Journal of University of Science and Technology BeijingRequires access

Efficient algorithm for dynamic attribute reduction based on a matrix

Wenbin Qian

Open publisher page 1 citations

Abstract

Objects in actual decision tables are often changed dynamically.Aiming at this problem,the concept of a simplified decision table is introduced firstly,and a large number of repeated objects are deleted.A simplified matrix based on the positive region is constructed,which can reduce the searching space.What's more,it is theoretically analyzed that the definition of attribute reduction based on the simplified matrix is equal to that based on the unsimplified matrix.The proposed method scans only once the simplified matrix and it can be effectively utilized to the old attribute reduction.On this condition,an efficient algorithm for dynamic attribute reduction based on a matrix was designed.Finally,an example and its experimental comparison were employed to illustrate the efficiency and feasibility of the proposed algorithm.

About this research paper

What this paper is about

Objects in actual decision tables are often changed dynamically.Aiming at this problem,the concept of a simplified decision table is introduced firstly,and a large number of repeated objects are deleted.A simplified matrix based on the positive region is constructed,which can reduce the searching space.What's more,it is theoretically analyzed that the definition of attribute reduction based on the simplified matrix is equal to that based on the unsimplified matrix.The proposed method scans only once the simplified matrix and it can be effectively utilized to the old attribute reduction.On this condition,an efficient algorithm for dynamic attribute reduction based on a matrix was designed.Finally,an example and its experimental comparison were employed to illustrate the efficiency and feasibility of the proposed algorithm.

Why it matters

OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.

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

Objects in actual decision tables are often changed dynamically.Aiming at this problem,the concept of a simplified decision table is introduced firstly,and a large number of repeated objects are deleted.A simplified matrix based on the positive region is constructed,which can reduce the searching space.What's more,it is theoretically analyzed that the definition of attribute reduction based on the simplified matrix is equal to that based on the unsimplified matrix.The proposed method scans only once the simplified matrix and it can be effectively utilized to the old attribute reduction.On this condition,an efficient algorithm for dynamic attribute reduction based on a matrix was designed.Finally,an example and its experimental comparison were employed to illustrate the efficiency and feasibility of the proposed algorithm.

Key concepts: Reduction (mathematics), Matrix (chemical analysis), Decision table, Algorithm, Computer science, Table (database), Data mining, Mathematical optimization

Related papers

Back to paper searchBrowse research topicsOriginal source
Efficient algorithm for dynamic attribute reduction based on a matrix — Research Paper | ScholarLens