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: set cover problem

Sortuj według:

Ogranicz wyniki do:

Dynamic Programming Approach for Construction of Association Rule Systems

Alsolami F., Amin T., Chikalov I., Moshkov M., Zielosko B.

Fundamenta Informaticae

2016

Vol. 147, nr 2/3

159--171

In the paper, an application of dynamic programming approach for optimization of association rules from the point of view of knowledge representation is considered. The association rule set is optimized in two stages, first for minimum cardinality and then for minimum length of rules. Experimental results present cardinality of the set of association rules constructed for information system and lower bound on minimum possible cardinality of rule set based on the information obtained during algorithm work as well as obtained results for length.

Greedy Algorithms for Construction of Approximate Tests for Decision Tables with Many-Valued Decisions

Azad M., Chikalov I., Moshkov M., Zielosko B.

Fundamenta Informaticae

2012

Vol. 120, nr 3/4

231-242

The paper is devoted to the study of a greedy algorithm for construction of approximate tests (super-reducts). This algorithm is applicable to decision tables with many-valued decisions where each row is labeled with a set of decisions. For a given row, we should find a decision from the set attached to this row. We consider bounds on the precision of this algorithm relative to the cardinality of tests.