ScholarLens Back to search
2009•Unpublished venueRequires access

Rule Extraction from Incomplete Decision Tables

Renpu Li, Dedong Zhang, Yongsheng Zhao, Fuzeng Zhang

Open publisher page 1 citations

Abstract

Rule extraction is an important issue of data mining and many efficient algorithms based on rough sets have been presented for obtaining rules from decision tables. However, little work has been focused on extracting rules from the incomplete decision tables. In this paper based on an improved discernibility matrix an efficient method for obtaining all optimal credible decision rules from an incomplete decision table is proposed. Through uniting the objects of a maximal tolerance class into a new object the scale of discernibility matrix used to produce the disjunction of rules is greatly reduced, and then the computation efficiency of the rule extraction gets an obvious improvement. Theoretical analysis and experiments indicate that the improved method is more efficient for obtaining optimal credible decision rules from an incomplete decision tables.

About this research paper

What this paper is about

Rule extraction is an important issue of data mining and many efficient algorithms based on rough sets have been presented for obtaining rules from decision tables. However, little work has been focused on extracting rules from the incomplete decision tables. In this paper based on an improved discernibility matrix an efficient method for obtaining all optimal credible decision rules from an incomplete decision table is proposed. Through uniting the objects of a maximal tolerance class into a new object the scale of discernibility matrix used to produce the disjunction of rules is greatly reduced, and then the computation efficiency of the rule extraction gets an obvious improvement. Theoretical analysis and experiments indicate that the improved method is more efficient for obtaining optimal credible decision rules from an incomplete decision tables.

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

Rule extraction is an important issue of data mining and many efficient algorithms based on rough sets have been presented for obtaining rules from decision tables. However, little work has been focused on extracting rules from the incomplete decision tables. In this paper based on an improved discernibility matrix an efficient method for obtaining all optimal credible decision rules from an incomplete decision table is proposed. Through uniting the objects of a maximal tolerance class into a new object the scale of discernibility matrix used to produce the disjunction of rules is greatly reduced, and then the computation efficiency of the rule extraction gets an obvious improvement. Theoretical analysis and experiments indicate that the improved method is more efficient for obtaining optimal credible decision rules from an incomplete decision tables.

Key concepts: Decision table, Decision rule, Computer science, Data mining, Rough set, Admissible decision rule, Computation, Table (database)

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
Rule Extraction from Incomplete Decision Tables — Research Paper | ScholarLens