Greedy Algorithm for Attribute Reduction

Issue title: Concurrency Specification and Programming (CS&P)

Article type: Research Article

Authors: Zielosko, Beata | Piliszczuk, Marcin

Affiliations: Institute of Computer Science, University of Silesia, 39, B�dzińska St., Sosnowiec, 41-200, Poland. beata.zielosko@us.edu.pl | ING Bank Śl�ski S.A., 34, Sokolska St., Katowice, 40-086, Poland. marcin.piliszczuk@ingbank.pl

Note: [] Address for correspondence: Institute of Computer Science, University of Silesia, 39, B�dzińska St., Sosnowiec, 41-200, Poland

Abstract: In the paper the accuracy of greedy algorithmfor construction of partial tests (superreducts) and partial decision rules is considered. Results of experiments with greedy algorithm are described.

Keywords: Partial tests, partial reducts, partial decision rules, greedy algorithm

Journal: Fundamenta Informaticae, vol. 85, no. 1-4, pp. 549-561, 2008