On Construction of Partial Reducts and Irreducible Partial Decision Rules

• Autorzy: Moshkov M.Ju. , Piliszczuk M. , Zielosko B.
• Języki publikacji: EN

Abstrakty

EN

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.

Słowa kluczowe

EN

partial reducts; irreducible partial decision rules; algorithm for construction; complexity

• Wydawca: IOS Press
• Czasopismo: Fundamenta Informaticae
• Rocznik: 2007
• Tom: Vol. 75, nr 1-4
• Strony: 357--374
• Opis fizyczny: bibliogr. 15 poz., wykr.

Twórcy

autor

Moshkov M.Ju.

autor

Piliszczuk M.

autor

Zielosko B.

• Institute of Computer Science University of Silesia, 39, Będzińska St. 41-200 Sosnowiec, Poland,

Bibliografia

• [1] Moshkov, M. Ju.: On the set of partial reducts for the most part of binary decision tables, Proc. Concurrency Specification and Programming Workshop, Ruciane-Nida, Poland, 2005.
• [2] Moshkov, M. Ju., Piliszczuk, M.: On partial tests and partial reducts for decision tables, Proc. 10th Conference Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing, LNCS 3641, Springer-Verlag, Berlin, 2005.
• [3] Nguyen, H. S., Ślęzak, D.: Approximate reducts and association rules - correspondence and complexity results, Proc. 7th Workshop on Rough Sets, Fuzzy Sets, Data Mining, and Granular-Soft Computing, LNAI 1711, Springer-Verlag, Berlin, 1999.
• [4] Pawlak, Z.: Rough set elements, in: Rough Sets in Knowledge Discovery 1. Methodology and Applications (L. Polkowski, A. Skowron, Eds.), Phisica-Verlag, 1998, 10-30.
• [5] Piliszczuk, M.: On greedy algorithm for partial reduct construction, Proc. Concurrency Specification and Programming Workshop, Ruciane-Nida, Poland, 2005.
• [6] Quafafou, M.: α-RST: a generalization of rough set theory, Information Sciences, 124, 2000, 301-316.
• [7] Skowron, A.: Rough sets in KDD, Proc. 16th World Computer Congress, Beijing, China, 2000.
• [8] Ślęzak, D.: Approximate reducts in decision tables, Proc. Congress Information Processing andManagement of Uncertainty in Knowledge-based Systems, Granada, Spain, 1996.
• [9] Ślęzak, D.: Normalized decision functions and measures for inconsistent decision tables analysis, Fundamenta Informaticae, 44(3), 2000, 291-319.
• [10] Ślęzak, D.: Approximate decision reducts, Ph.D. Thesis, Warsaw University, 2001 (in Polish).
• [11] Ślęzak, D.: Approximate entropy reducts, Fundamenta Informaticae, 53, 2002, 365-390.
• [12] Ślęzak, D., Wróblewski, J.: Order-based genetic algorithms for the search of approximate entropy reducts, Proc. Conference Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing, LNAI 2639, Springer-Verlag, Berlin, 2003.
• [13] Wróblewski, J.: Ensembles of classifiers based on approximate reducts, Fundamenta Informaticae, 47(3-4), 2001, 351-360.
• [14] Ziarko,W.: Analysis of uncertain information in the framework of variable precision rough sets, Foundations of Computing and Decision Sciences, 18(3-4), 1993, 381-396.
• [15] Zielosko, B.: On partial decision rules, Proc. Concurrency Specification and Programming Workshop, Ruciane-Nida, Poland, 2005.