Abstract
In the paper, the accuracy of greedy algorithms for construction of partial covers, reducts and decision rules is considered. Bounds on the minimal complexity of partial covers, reducts and decision rules based on an information about greedy algorithm work are studied. The results of experiments with greedy algorithms are described.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Cheriyan, J., Ravi, R.: Lecture Notes on Approximation Algorithms for Network Problems (1998), http://www.math.uwaterloo.ca/~jcheriya/lecnotes.html
Feige, U.: A threshold of ln n for approximating set cover (Preliminary version). In: Proceedings of 28th Annual ACM Symposium on the Theory of Computing, pp. 314–318 (1996)
Johnson, D.S.: Approximation algorithms for combinatorial problems. J. Comput. System Sci. 9, 256–278 (1974)
Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R., Thatcher, J. (eds.) Complexity of Computer Computations, pp. 85–103. Plenum Press, New York (1972)
Kuzjurin, N.N.: Asymptotical investigation of set covering problem. In: Problems of Cybernetics, vol. 37, pp. 19–57. Nauka Publishers, Moscow (1980) (in Russian)
Lovász, L.: On the ratio of optimal integral and fractional covers. Discrete Math. 13, 383–390 (1975)
Moshkov, M.J.: Greedy algorithm for set cover in context of knowledge discovery problems. In: Proceedings of the International Workshop on Rough Sets in Knowledge Discovery and Soft Computing (ETAPS 2003 Satellite Event), Warsaw, Poland. Electronic Notes in Theoretical Computer Science, vol. 82 (2003)
Moshkov, M.J.: On greedy algorithm for partial cover construction. In: Proceedings of the Fourteenth International Workshop Design and Complexity of Control Systems, Nizhny Novgorod, Russia, p. 57 (2003) (in Russian)
Moshkov, M.J., Piliszczuk, M., Zielosko, B.: On partial covers, reducts and decision rules with weights. In: Peters, J.F., Skowron, A., Düntsch, I., Grzymała-Busse, J.W., Orłowska, E., Polkowski, L. (eds.) Transactions on Rough Sets VI. LNCS, vol. 4374, pp. 211–246. Springer, Heidelberg (2007)
Nguyen, H.S., Ślȩzak, D.: Approximate reducts and association rules – correspondence and complexity results. In: Zhong, N., Skowron, A., Ohsuga, S. (eds.) RSFDGrC 1999. LNCS (LNAI), vol. 1711, pp. 137–145. Springer, Heidelberg (1999)
Nigmatullin, R.G.: Method of steepest descent in problems on cover. In: Memoirs of Symposium Problems of Precision and Efficiency of Computing Algorithms, Kiev, USSR, vol. 5, pp. 116–126 (1969) (in Russian)
Pawlak, Z.: Rough Sets – Theoretical Aspects of Reasoning about Data. Kluwer Academic Publishers, Dordrecht (1991)
Pawlak, Z.: Rough set elements. In: Polkowski, L., Skowron, A. (eds.) Rough Sets in Knowledge Discovery 1. Methodology and Applications. Studies in Fuzziness and Soft Computing, vol. 18, pp. 10–30. Physica-Verlag, Heidelberg (1998)
Quafafou, M.: α-RST: a generalization of rough set theory. Information Sciences 124, 301–316 (2000)
Raz, R., Safra, S.: A sub-constant error-probability low-degree test, and sub-constant error-probability PCP characterization of NP. In: Proceedings of 29th Annual ACM Symposium on the Theory of Computing, pp. 475–484 (1997)
Skowron, A.: Rough sets in KDD. In: Proceedings of the 16-th World Computer Congress (IFIP 2000), Beijing, China, pp. 1–14 (2000)
Skowron, A., Rauszer, C.: The discernibility matrices and functions in information systems. In: Slowinski, R. (ed.) Intelligent Decision Support. Handbook of Applications and Advances of the Rough Set Theory, pp. 331–362. Kluwer Academic Publishers, Dordrecht (1992)
Slavík, P.: A tight analysis of the greedy algorithm for set cover (extended abstract). In: Proceedings of 28th Annual ACM Symposium on the Theory of Computing, pp. 435–441 (1996)
Slavík, P.: Approximation algorithms for set cover and related problems. Ph.D. thesis. University of New York, Buffalo (1998)
Ślȩzak, D.: Approximate reducts in decision tables. In: Proceedings of the Congress Information Processing and Management of Uncertainty in Knowledge-based Systems, Granada, Spain, vol. 3, pp. 1159–1164 (1996)
Ślȩzak, D.: Normalized decision functions and measures for inconsistent decision tables analysis. Fundamenta Informaticae 44, 291–319 (2000)
Ślȩzak, D.: Approximate decision reducts. Ph.D. thesis. Warsaw University (2001) (in Polish)
Ślȩzak, D.: Approximate entropy reducts. Fundamenta Informaticae 53, 365–390 (2002)
Vercellis, C.: A probabilistic analysis of the set covering problem. Annals of Oper. Res. 1, 255–271 (1984)
Wróblewski, J.: Ensembles of classifiers based on approximate reducts. Fundamenta Informaticae 47, 351–360 (2001)
Yablonskii, S.V.: Some problems of reliability and diagnosis in control systems. In: Mathematical Problems of Cybernetics, vol. 1, pp. 5–25. Nauka Publishers, Moscow (1988) (in Russian)
Ziarko, W.: Analysis of uncertain information in the framework of variable precision rough sets. Foundations of Computing and Decision Sciences 18, 381–396 (1993)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Moshkov, M.J., Piliszczuk, M., Zielosko, B. (2008). On Partial Covers, Reducts and Decision Rules. In: Peters, J.F., Skowron, A. (eds) Transactions on Rough Sets VIII. Lecture Notes in Computer Science, vol 5084. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-85064-9_12
Download citation
DOI: https://doi.org/10.1007/978-3-540-85064-9_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-85063-2
Online ISBN: 978-3-540-85064-9
eBook Packages: Computer ScienceComputer Science (R0)