2007•Acta Scientiarum Naturalium Universitatis SunyatseniRequires access

Knowledge Reduction Based on Decision Attribute Support Degree under Incomplete Information System

Weimin Li

Open publisher page 0 citations

Abstract

A kind of attribute relative reduction for decision attribute support degree was proposed.States the significance of attributes in the incomplete decision table by introducing decision attribute support degree,which is then used as heuristic information for selecting attributes,this algorithm has a polynomial time complexity.Seeking the minimal relative reduction in a decision table is typically a NP-hard problem,and its complexity can be reduced by using the algorithm provided in this paper.An example shows this algorithm can achieve the minimal relative reduction of incomplete decision table.

About this research paper

What this paper is about

A kind of attribute relative reduction for decision attribute support degree was proposed.States the significance of attributes in the incomplete decision table by introducing decision attribute support degree,which is then used as heuristic information for selecting attributes,this algorithm has a polynomial time complexity.Seeking the minimal relative reduction in a decision table is typically a NP-hard problem,and its complexity can be reduced by using the algorithm provided in this paper.An example shows this algorithm can achieve the minimal relative reduction of incomplete decision table.

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

A kind of attribute relative reduction for decision attribute support degree was proposed.States the significance of attributes in the incomplete decision table by introducing decision attribute support degree,which is then used as heuristic information for selecting attributes,this algorithm has a polynomial time complexity.Seeking the minimal relative reduction in a decision table is typically a NP-hard problem,and its complexity can be reduced by using the algorithm provided in this paper.An example shows this algorithm can achieve the minimal relative reduction of incomplete decision table.

Key concepts: Decision table, Reduction (mathematics), Degree (music), Data mining, Heuristic, Computer science, Decision support system, Decision rule

Related papers

Back to paper searchBrowse research topicsOriginal source
Knowledge Reduction Based on Decision Attribute Support Degree under Incomplete Information System — Research Paper | ScholarLens