{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,6]],"date-time":"2025-02-06T08:10:02Z","timestamp":1738829402738,"version":"3.37.0"},"publisher-location":"Berlin, Heidelberg","reference-count":32,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540898757"},{"type":"electronic","value":"9783540898764"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-89876-4_11","type":"book-chapter","created":{"date-parts":[[2008,12,17]],"date-time":"2008-12-17T14:23:57Z","timestamp":1229523837000},"page":"187-199","source":"Crossref","is-referenced-by-count":0,"title":["Universal Problem of Attribute Reduction"],"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":"11_CR1","doi-asserted-by":"crossref","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 (1996)","DOI":"10.1145\/237814.237977"},{"key":"11_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1007\/978-3-540-27794-1_3","volume-title":"Transactions on Rough Sets I","author":"J.W. Grzymala-Busse","year":"2004","unstructured":"Grzymala-Busse, J.W.: Data with missing attribute values: Generalization of indiscernibility relation and rule induction. In: Peters, J.F., Skowron, A., Grzyma\u0142a-Busse, J.W., Kostek, B.z., \u015awiniarski, R.W., Szczuka, M.S. (eds.) Transactions on Rough Sets I. LNCS, vol.\u00a03100, pp. 78\u201395. Springer, Heidelberg (2004)"},{"key":"11_CR3","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1016\/S0022-0000(74)80044-9","volume":"9","author":"D.S. Johnson","year":"1974","unstructured":"Johnson, D.S.: Approximation algorithms for combinatorial problems. J. Comput. System Sci.\u00a09, 256\u2013278 (1974)","journal-title":"J. Comput. System Sci."},{"key":"11_CR4","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1016\/S0020-0255(98)10065-8","volume":"113","author":"M. Kryszkiewicz","year":"1999","unstructured":"Kryszkiewicz, M.: Rules in incomplete information systems. Information Sciences\u00a0113, 271\u2013292 (1999)","journal-title":"Information Sciences"},{"key":"11_CR5","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1016\/0012-365X(75)90058-8","volume":"13","author":"L. Lov\u00e1sz","year":"1975","unstructured":"Lov\u00e1sz, L.: On the ratio of optimal integral and fractional covers. Discrete Math.\u00a013, 383\u2013390 (1975)","journal-title":"Discrete Math."},{"issue":"1-4","key":"11_CR6","first-page":"357","volume":"75","author":"M.J. Moshkov","year":"2007","unstructured":"Moshkov, M.J., Piliszczuk, M., Zielosko, B.: On construction of partial reducts and irreducible partial decision rules. Fundamenta Informaticae\u00a075(1-4), 357\u2013374 (2007)","journal-title":"Fundamenta Informaticae"},{"key":"11_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"211","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 with weights. In: Peters, J.F., Skowron, A., D\u00fcntsch, I., Grzyma\u0142a-Busse, J.W., Or\u0142owska, E., Polkowski, L. (eds.) Transactions on Rough Sets VI. LNCS, vol.\u00a04374, pp. 211\u2013246. Springer, Heidelberg (2007)"},{"key":"11_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1007\/978-3-540-73451-2_44","volume-title":"Rough Sets and Intelligent Systems Paradigms","author":"M.J. Moshkov","year":"2007","unstructured":"Moshkov, M.J., Piliszczuk, M., Zielosko, B.: Universal attribute reduction problem. In: Kryszkiewicz, M., Peters, J.F., Rybinski, H., Skowron, A. (eds.) RSEISP 2007. LNCS, vol.\u00a04585, pp. 417\u2013426. Springer, Heidelberg (2007)"},{"key":"11_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1007\/978-3-540-85064-9_12","volume-title":"Transactions on Rough Sets VIII","author":"M.J. Moshkov","year":"2008","unstructured":"Moshkov, M.J., Piliszczuk, M., Zielosko, B.: On partial covers, reducts and decision rules. In: Peters, J.F., Skowron, A. (eds.) Transactions on Rough Sets VIII. LNCS, vol.\u00a05084, pp. 258\u2013296. Springer, Heidelberg (2008)"},{"key":"11_CR10","unstructured":"Newman, D.J., Hettich, S., Blake, C.L., Merz, C.J.: UCI Repository of machine learning databases. University of California, Irvine, Department of Information and Computer Sciences (1998), http:\/\/www.ics.uci.edu\/~mlearn\/MLRepository.html"},{"key":"11_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1007\/11847465_16","volume-title":"Transactions on Rough Sets V","author":"H.S. Nguyen","year":"2006","unstructured":"Nguyen, H.S.: Approximate Boolean reasoning: foundations and applications in data mining. In: Peters, J.F., Skowron, A. (eds.) Transactions on Rough Sets V. LNCS, vol.\u00a04100, pp. 344\u2013523. Springer, Heidelberg (2006)"},{"key":"11_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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.) RSFDGrC 1999. LNCS, vol.\u00a01711, pp. 137\u2013145. Springer, Heidelberg (1999)"},{"key":"11_CR13","unstructured":"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\u2013126 (1969) (in Russian)"},{"key":"11_CR14","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 (1991)"},{"key":"11_CR15","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 18), pp. 10\u201330. Phisica-Verlag, Springer-Verlag (1998)"},{"issue":"1","key":"11_CR16","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.ins.2006.06.003","volume":"177","author":"Z. Pawlak","year":"2007","unstructured":"Pawlak, Z., Skowron, A.: Rudiments of rough sets. Information Sciences\u00a0177(1), 3\u201327 (2007); Rough sets: Some extensions. Information Sciences 177(1), 28\u201340 (2007); Rough sets and boolean reasoning. Information Sciences 177(1), 41\u201373 (2007)","journal-title":"Information Sciences"},{"key":"11_CR17","unstructured":"Piliszczuk, M.: On greedy algorithm for partial reduct construction. In: Proceedings of Concurrency, Specification and Programming Workshop, Ruciane-Nida, Poland, vol. 2, pp. 400\u2013411 (2005)"},{"key":"11_CR18","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":"11_CR19","doi-asserted-by":"crossref","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 (1997)","DOI":"10.1145\/258533.258641"},{"key":"11_CR20","unstructured":"Skowron, A.: Rough sets in KDD. In: Proceedings of the 16th World Computer Congress (IFIP 2000), Beijing, China, pp. 1\u201314 (2000)"},{"key":"11_CR21","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":"11_CR22","doi-asserted-by":"crossref","unstructured":"Slav\u00edk, 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\u2013441 (1996)","DOI":"10.1145\/237814.237991"},{"key":"11_CR23","unstructured":"Slav\u00edk, P.: Approximation algorithms for set cover and related problems. Ph.D. thesis. University of New York, Buffalo (1998)"},{"key":"11_CR24","unstructured":"\u015ale\u0327zak, D.: Approximate reducts in decision tables. In: Proceedings of the Congress Information Processing and Management of Uncertainty in Knowledge-based Systems, Granada, Spain, vol.\u00a03, pp. 1159\u20131164 (1996)"},{"key":"11_CR25","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":"11_CR26","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1007\/978-3-7908-1840-6_6","volume-title":"Rough Set Methods and Applications","author":"D. \u015ale\u0327zak","year":"2000","unstructured":"\u015ale\u0327zak, D.: Various approaches to reasoning with frequency based decision reducts: a survey. In: Polkowski, L., Tsumoto, S., Lin, T.Y. (eds.) Rough Set Methods and Applications, pp. 235\u2013285. Physica-Verlag, Heidelberg (2000)"},{"key":"11_CR27","unstructured":"\u015ale\u0327zak, D.: Approximate decision reducts. Ph.D. thesis. Warsaw University (2001) (in Polish)"},{"key":"11_CR28","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":"11_CR29","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":"11_CR30","first-page":"431","volume-title":"Encyclopedia of Cybernetics (in Russian)","author":"S.V. Yablonskii","year":"1975","unstructured":"Yablonskii, S.V.: Tests. In: Glushkov, V.M. (ed.) Encyclopedia of Cybernetics (in Russian), pp. 431\u2013432. Main Editorial Board of Ukrainian Soviet Encyclopedia, Kiev (1975)"},{"key":"11_CR31","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":"11_CR32","unstructured":"Zielosko, B.: On partial decision rules. In: Proceedings of Concurrency, Specification and Programming Workshop, Ruciane-Nida, Poland, vol.\u00a02, pp. 598\u2013609 (2005)"}],"container-title":["Lecture Notes in Computer Science","Transactions on Rough Sets IX"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-89876-4_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,6]],"date-time":"2025-02-06T07:04:14Z","timestamp":1738825454000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-89876-4_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540898757","9783540898764"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-89876-4_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}