Wyniki wyszukiwania - BazTech

Ograniczanie wyników

4 Fundamenta Informaticae

Powiadomienia systemowe

Sesja wygasła!
Sesja wygasła!
Sesja wygasła!
Sesja wygasła!

Znaleziono wyników: 4

Liczba wyników na stronie

Wyniki wyszukiwania

Sortuj według:

Ogranicz wyniki do:

Greedy Algorithms with Weights for Construction of Partial Association Rules

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

Fundamenta Informaticae

2009

Vol. 94, nr 1

101-120

This paper is devoted to the study of approximate algorithms for minimization of the total weight of attributes occurring in partial association rules. We consider mainly greedy algorithms with weights for construction of rules. The paper contains bounds on precision of these algorithms and bounds on the minimal weight of partial association rules based on an information obtained during the greedy algorithm run.

Greedy Algorithm for Construction of Partial Association Rules

Moshkov M.Ju., Piliszczuk M.

Fundamenta Informaticae

2009

Vol. 92, nr 3

259-277

Partial association rules can be used for representation of knowledge, for inference in expert systems, for construction of classifiers, and for filling missing values of attributes. This paper is devoted to the study of approximate algorithms for minimization of partial association rule length. It is shown that under some natural assumptions on the class NP, a greedy algorithm is close to the best polynomial approximate algorithms for solving of this NP-hard problem. The paper contains various bounds on precision of the greedy algorithm, bounds on minimal length of rules based on an information obtained during the greedy algorithm work, and results of theoretical and experimental study of association rules for the most part of binary information systems.

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.