A Quick Algorithm for Attribute Reduction Based on Divide and Conquer Method

Abstract:

Article Preview

Knowledge reduction is one of the most important contributions of rough set theory. High efficient algorithm is necessary for attribute reduction. In this paper, combining given attribute order and quick sort method, a heuristic algorithm for attribute reduction is developed. In this method, the objects in universe are divided into many small parts on the attributes by divide and conquer method, and different granules in different granular levels are obtained. The small ones can be processed quickly, so a fast heuristic algorithm for attribute reduction is proposed. Simulation experiment results illustrate the high efficiency of the improved knowledge reduction algorithm.

Info:

Periodical:

Edited by:

Yanwen Wu

Pages:

92-97

DOI:

10.4028/www.scientific.net/AMR.267.92

Citation:

F. Hu et al., "A Quick Algorithm for Attribute Reduction Based on Divide and Conquer Method", Advanced Materials Research, Vol. 267, pp. 92-97, 2011

Online since:

June 2011

Export:

Price:

$35.00

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

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