Abstract
In the paper the accuracy of greedy algorithms with weights for construction of partial covers, reducts and decision rules is considered. Bounds on minimal weight of partial covers, reducts and decision rules based on an information on greedy algorithm work are studied. Results of experiments with software implementation of greedy algorithms are described.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
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
Chvátal, V.: A greedy heuristic for the set-covering problem. Mathematics of Operations Research 4, 233–235 (1979)
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. ACM Press, New York (1996)
Gavrilov, G.P., Sapozhenko, A.A.: Problems and Exercises in Discrete Mathematics (in Russian), 3rd edn. Fizmatlit, Moscow (2004)
Kearns, M.J.: The Computational Complexity of Machine Learning. MIT Press, Cambridge (1990)
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 82 (2003)
Moshkov, M.: Ju.: On greedy algorithm for partial cover construction (in Russian). In: Proceedings of the Fourteenth International Workshop Design and Complexity of Control Systems, Nizhny Novgorod, Russia, p. 57 (2003)
Moshkov, M.J., Piliszczuk, M., Zielosko, B.: Greedy algorithm for construction of partial covers (in Russian). In: Proceedings of the Fourteenth International Conference Problems of Theoretical Cybernetics, Penza, Russia, p. 103 (2005)
Moshkov, M.J., Piliszczuk, M., Zielosko, B.: On partial covers, reducts and decision rules. In: Transactions on Rough Sets VI. LNCS, vol. 4374, 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.) New Directions in Rough Sets, Data Mining, and Granular-Soft Computing. LNCS (LNAI), vol. 1711, pp. 137–145. Springer, Heidelberg (1999)
Pawlak, Z.: Rough Sets – Theoretical Aspects of Reasoning about Data. Kluwer Academic Publishers, Dordrecht, Boston, 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)
Piliszczuk, M.: On greedy algorithm for partial reduct construction. In: Proceedings of Concurrency, Specification and Programming Workshop 2, Ruciane-Nida, Poland, pp. 400–411 (2005)
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. ACM Press, New York (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.: Approximation algorithms for set cover and related problems. Ph.D. thesis. University of New York at 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 3, Granada, Spain, 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 (in Polish). Ph.D. thesis. Warsaw University (2001)
Ślȩzak, D.: Approximate entropy reducts. Fundamenta Informaticae 53, 365–390 (2002)
Ślȩzak, D., Wróblewski, J.: Order-based genetic algorithms for the search of approximate entropy reducts. In: Wang, G., et al. (eds.) RSFDGrC 2003. LNCS (LNAI), vol. 2639, pp. 308–311. Springer, Heidelberg (2003)
Wróblewski, J.: Ensembles of classifiers based on approximate reducts. Fundamenta Informaticae 47, 351–360 (2001)
Yablonskii, S.V.: Introduction into Discrete Mathematics (in Russian), 4th edn. Vishaya Shkola, Moscow (2003)
Ziarko, W.: Analysis of uncertain information in the framework of variable precision rough sets. Foundations of Computing and Decision Sciences 18, 381–396 (1993)
Zielosko, B.: On partial decision rules. In: Proceedings of Concurrency, Specification and Programming Workshop 2, Ruciane-Nida, Poland, pp. 598–609 (2005)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this chapter
Cite this chapter
Moshkov, M.J., Piliszczuk, M., Zielosko, B. (2007). On Partial Covers, Reducts and Decision Rules with Weights. In: Peters, J.F., Skowron, A., Düntsch, I., Grzymała-Busse, J., Orłowska, E., Polkowski, L. (eds) Transactions on Rough Sets VI. Lecture Notes in Computer Science, vol 4374. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-71200-8_13
Download citation
DOI: https://doi.org/10.1007/978-3-540-71200-8_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-71198-8
Online ISBN: 978-3-540-71200-8
eBook Packages: Computer ScienceComputer Science (R0)