{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T21:47:24Z","timestamp":1761947244070,"version":"build-2065373602"},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540711988"},{"type":"electronic","value":"9783540712008"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-71200-8_13","type":"book-chapter","created":{"date-parts":[[2007,5,21]],"date-time":"2007-05-21T13:30:21Z","timestamp":1179754221000},"page":"211-246","source":"Crossref","is-referenced-by-count":9,"title":["On Partial Covers, Reducts and Decision Rules with Weights"],"prefix":"10.1007","author":[{"given":"Mikhail Ju.","family":"Moshkov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marcin","family":"Piliszczuk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Beata","family":"Zielosko","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"13_CR1","unstructured":"Cheriyan, J., Ravi, R.: Lecture Notes on Approximation Algorithms for Network Problems (1998), http:\/\/www.math.uwaterloo.ca\/~jcheriya\/lecnotes.html"},{"key":"13_CR2","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1287\/moor.4.3.233","volume":"4","author":"V. Chv\u00e1tal","year":"1979","unstructured":"Chv\u00e1tal, V.: A greedy heuristic for the set-covering problem. Mathematics of Operations Research\u00a04, 233\u2013235 (1979)","journal-title":"Mathematics of Operations Research"},{"key":"13_CR3","first-page":"314","volume-title":"Proceedings of 28th Annual ACM Symposium on the Theory of Computing","author":"U. Feige","year":"1996","unstructured":"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\u2013318. ACM Press, New York (1996)"},{"key":"13_CR4","volume-title":"Problems and Exercises in Discrete Mathematics","author":"G.P. Gavrilov","year":"2004","unstructured":"Gavrilov, G.P., Sapozhenko, A.A.: Problems and Exercises in Discrete Mathematics (in Russian), 3rd edn. Fizmatlit, Moscow (2004)","edition":"3"},{"key":"13_CR5","volume-title":"The Computational Complexity of Machine Learning","author":"M.J. Kearns","year":"1990","unstructured":"Kearns, M.J.: The Computational Complexity of Machine Learning. MIT Press, Cambridge (1990)"},{"key":"13_CR6","doi-asserted-by":"crossref","unstructured":"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)","DOI":"10.1016\/S1571-0661(04)80716-3"},{"key":"13_CR7","unstructured":"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)"},{"key":"13_CR8","unstructured":"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)"},{"key":"13_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-71200-8_13","volume-title":"Transactions on Rough Sets VI","author":"M.J. Moshkov","year":"2007","unstructured":"Moshkov, M.J., Piliszczuk, M., Zielosko, B.: On partial covers, reducts and decision rules. In: Transactions on Rough Sets VI. LNCS, vol.\u00a04374, Springer, Heidelberg (2007)"},{"key":"13_CR10","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1007\/978-3-540-48061-7_18","volume-title":"New Directions in Rough Sets, Data Mining, and Granular-Soft Computing","author":"H.S. Nguyen","year":"1999","unstructured":"Nguyen, H.S., \u015ale\u0327zak, 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.\u00a01711, pp. 137\u2013145. Springer, Heidelberg (1999)"},{"key":"13_CR11","volume-title":"Rough Sets \u2013 Theoretical Aspects of Reasoning about Data","author":"Z. Pawlak","year":"1991","unstructured":"Pawlak, Z.: Rough Sets \u2013 Theoretical Aspects of Reasoning about Data. Kluwer Academic Publishers, Dordrecht, Boston, Dordrecht (1991)"},{"key":"13_CR12","series-title":"Studies in Fuzziness and Soft Computing","first-page":"10","volume-title":"Rough Sets in Knowledge Discovery 1. Methodology and Applications","author":"Z. Pawlak","year":"1998","unstructured":"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.\u00a018, pp. 10\u201330. Physica-Verlag, Heidelberg (1998)"},{"key":"13_CR13","unstructured":"Piliszczuk, M.: On greedy algorithm for partial reduct construction. In: Proceedings of Concurrency, Specification and Programming Workshop 2, Ruciane-Nida, Poland, pp. 400\u2013411 (2005)"},{"key":"13_CR14","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1016\/S0020-0255(99)00075-4","volume":"124","author":"M. Quafafou","year":"2000","unstructured":"Quafafou, M.: \u03b1-RST: a generalization of rough set theory. Information Sciences\u00a0124, 301\u2013316 (2000)","journal-title":"Information Sciences"},{"key":"13_CR15","first-page":"475","volume-title":"Proceedings of 29th Annual ACM Symposium on the Theory of Computing","author":"R. Raz","year":"1997","unstructured":"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\u2013484. ACM Press, New York (1997)"},{"key":"13_CR16","unstructured":"Skowron, A.: Rough sets in KDD. In: Proceedings of the 16-th World Computer Congress (IFIP\u20192000), Beijing, China, pp. 1\u201314 (2000)"},{"key":"13_CR17","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1007\/978-94-015-7975-9_21","volume-title":"Intelligent Decision Support. Handbook of Applications and Advances of the Rough Set Theory","author":"A. Skowron","year":"1992","unstructured":"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\u2013362. Kluwer Academic Publishers, Dordrecht (1992)"},{"key":"13_CR18","unstructured":"Slav\u00edk, P.: Approximation algorithms for set cover and related problems. Ph.D. thesis. University of New York at Buffalo (1998)"},{"key":"13_CR19","unstructured":"\u015ale\u0327zak, 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\u20131164 (1996)"},{"key":"13_CR20","doi-asserted-by":"crossref","first-page":"291","DOI":"10.3233\/FUN-2000-44304","volume":"44","author":"D. \u015ale\u0327zak","year":"2000","unstructured":"\u015ale\u0327zak, D.: Normalized decision functions and measures for inconsistent decision tables analysis. Fundamenta Informaticae\u00a044, 291\u2013319 (2000)","journal-title":"Fundamenta Informaticae"},{"key":"13_CR21","unstructured":"\u015ale\u0327zak, D.: Approximate decision reducts (in Polish). Ph.D. thesis. Warsaw University (2001)"},{"key":"13_CR22","doi-asserted-by":"crossref","first-page":"365","DOI":"10.3233\/FUN-2002-533-409","volume":"53","author":"D. \u015ale\u0327zak","year":"2002","unstructured":"\u015ale\u0327zak, D.: Approximate entropy reducts. Fundamenta Informaticae\u00a053, 365\u2013390 (2002)","journal-title":"Fundamenta Informaticae"},{"key":"13_CR23","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1007\/3-540-39205-X_45","volume-title":"Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing","author":"D. \u015ale\u0327zak","year":"2003","unstructured":"\u015ale\u0327zak, D., Wr\u00f3blewski, J.: Order-based genetic algorithms for the search of approximate entropy reducts. In: Wang, G., et al. (eds.) RSFDGrC 2003. LNCS (LNAI), vol.\u00a02639, pp. 308\u2013311. Springer, Heidelberg (2003)"},{"key":"13_CR24","first-page":"351","volume":"47","author":"J. Wr\u00f3blewski","year":"2001","unstructured":"Wr\u00f3blewski, J.: Ensembles of classifiers based on approximate reducts. Fundamenta Informaticae\u00a047, 351\u2013360 (2001)","journal-title":"Fundamenta Informaticae"},{"key":"13_CR25","volume-title":"Introduction into Discrete Mathematics","author":"S.V. Yablonskii","year":"2003","unstructured":"Yablonskii, S.V.: Introduction into Discrete Mathematics (in Russian), 4th edn. Vishaya Shkola, Moscow (2003)","edition":"4"},{"key":"13_CR26","first-page":"381","volume":"18","author":"W. Ziarko","year":"1993","unstructured":"Ziarko, W.: Analysis of uncertain information in the framework of variable precision rough sets. Foundations of Computing and Decision Sciences\u00a018, 381\u2013396 (1993)","journal-title":"Foundations of Computing and Decision Sciences"},{"key":"13_CR27","unstructured":"Zielosko, B.: On partial decision rules. In: Proceedings of Concurrency, Specification and Programming Workshop 2, Ruciane-Nida, Poland, pp. 598\u2013609 (2005)"}],"container-title":["Lecture Notes in Computer Science","Transactions on Rough Sets VI"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-71200-8_13.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,16]],"date-time":"2025-01-16T14:36:08Z","timestamp":1737038168000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-71200-8_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540711988","9783540712008"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-71200-8_13","relation":{},"subject":[]}}