An Binary Discernibility Matrix Attribute Reduction Algorithm on Attribute Importance Heuristic Message

Abstract:

Article Preview

A binary discernibility matrix attribute reduction algorithm of incomplete decision table is introduced in this paper, which takes the importance of attribute as the heuristic message. To obtain better attribute reduction, this paper constructs a metric formula of attribute importance and gives a binary discernibility matrix to present incomplete decision table. Based on the formula and matrix an attribute reduction algorithm of incomplete decision table is introduced. This algorithm solves the problem of the attribute selection when the frequencies of attributes are equal. The result shows that this method is simple and effective.

Info:

Periodical:

Key Engineering Materials (Volumes 480-481)

Edited by:

Yanwen Wu

Pages:

1613-1617

DOI:

10.4028/www.scientific.net/KEM.480-481.1613

Citation:

Y. He and D. He, "An Binary Discernibility Matrix Attribute Reduction Algorithm on Attribute Importance Heuristic Message", Key Engineering Materials, Vols. 480-481, pp. 1613-1617, 2011

Online since:

June 2011

Authors:

Export:

Price:

$35.00

In order to see related information, you need to Login.

In order to see related information, you need to Login.