Wyniki wyszukiwania - BazTech

Ograniczanie wyników

2 Fundamenta Informaticae

Znaleziono wyników: 2

Liczba wyników na stronie

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: partial reducts

Sortuj według:

Ogranicz wyniki do:

Greedy Algorithm for Attribute Reduction

Zielosko B., Piliszczuk M.

Fundamenta Informaticae

2008

Vol. 85, nr 1-4

549-561

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

On Construction of Partial Reducts and Irreducible Partial Decision Rules

Moshkov M.Ju., Piliszczuk M., Zielosko B.

Fundamenta Informaticae

2007

Vol. 75, nr 1-4

357-374

In the paper for the most part of binary decision tables upper and lower bounds on the cardinality of partial reducts and length of irreducible partial decision rules are obtained. The number of partial reducts and the number of irreducible partial decision rules are evaluated. Complexity of algorithms for construction of all partial reducts and all irreducible partial decision rules is studied on the basis of obtained bounds.