{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,11]],"date-time":"2025-01-11T01:10:03Z","timestamp":1736557803556,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540362975"},{"type":"electronic","value":"9783540362999"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11795131_42","type":"book-chapter","created":{"date-parts":[[2006,9,26]],"date-time":"2006-09-26T15:48:02Z","timestamp":1159285682000},"page":"290-296","source":"Crossref","is-referenced-by-count":0,"title":["Lower Bounds on Minimal Weight of Partial Reducts and Partial Decision Rules"],"prefix":"10.1007","author":[{"given":"Mikhail Ju.","family":"Moshkov","sequence":"first","affiliation":[]},{"given":"Marcin","family":"Piliszczuk","sequence":"additional","affiliation":[]},{"given":"Beata","family":"Zielosko","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"42_CR1","unstructured":"Pawlak, Z.: Rough set elements. In: Polkowski, L., Skowron, A. (eds.) Rough Sets in Knowledge Discovery, vol. 1. Methodology and Applications, Studies in Fuzziness and Soft Computing vol. 18, pp. 10\u201330. Phisica-Verlag, Springer (1998)"},{"key":"42_CR2","unstructured":"Skowron, A.: Rough sets in KDD. In: Proceedings of the 16-th World Computer Congress (IFIP 2000), Beijing, China, pp. 1\u201314 (2000)"},{"key":"42_CR3","series-title":"Lecture Notes in Artificial Intelligence","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 (LNAI), vol.\u00a01711, pp. 137\u2013145. Springer, Heidelberg (1999)"},{"key":"42_CR4","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":"42_CR5","doi-asserted-by":"crossref","first-page":"291","DOI":"10.3233\/FUN-2000-44304","volume":"3","author":"D. \u015ale\u0327zak","year":"2000","unstructured":"\u015ale\u0327zak, D.: Normalized decision functions and measures for inconsistent decision tables analysis. Fundamenta Informaticae\u00a03, 291\u2013319 (2000)","journal-title":"Fundamenta Informaticae"},{"key":"42_CR6","unstructured":"\u015ale\u0327zak, D.: Approximate decision reducts. Ph.D. thesis. Warsaw University (in Polish) (2001)"},{"key":"42_CR7","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":"42_CR8","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","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., Liu, Q., Yao, Y., Skowron, A. (eds.) RSFDGrC 2003. LNCS (LNAI), vol.\u00a02639, pp. 308\u2013311. Springer, Heidelberg (2003)"},{"key":"42_CR9","first-page":"351","volume":"3,4","author":"J. Wr\u00f3blewski","year":"2001","unstructured":"Wr\u00f3blewski, J.: Ensembles of classifiers based on approximate reducts. Fundamenta Informaticae\u00a03,4, 351\u2013360 (2001)","journal-title":"Fundamenta Informaticae"},{"key":"42_CR10","unstructured":"Slav\u00edk, P.: Approximation algorithms for set cover and related problems. Ph.D. thesis. University of New York at Buffalo (1998)"},{"key":"42_CR11","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1287\/moor.4.3.233","volume":"3","author":"V. Chv\u00e1tal","year":"1979","unstructured":"Chv\u00e1tal, V.: A greedy heuristic for the set-covering problem. Mathematics of Operations Research\u00a03, 233\u2013235 (1979)","journal-title":"Mathematics of Operations Research"},{"key":"42_CR12","unstructured":"Moshkov, M., Ju., P.M., Zielosko, B.: On partial covers, reducts and decision rules. In: LNCS Transactions on Rough Sets, Springer, Heidelberg (submitted)"},{"key":"42_CR13","unstructured":"Piliszczuk, M.: On greedy algorithm for partial reduct construction. In: Proceedings of Concurrency, Specification and Programming Workshop, Ruciane-Nida, Poland, vol.\u00a02, pp. 400\u2013411 (2005)"},{"key":"42_CR14","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","Rough Sets and Knowledge Technology"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11795131_42.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,11]],"date-time":"2025-01-11T00:56:53Z","timestamp":1736557013000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11795131_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540362975","9783540362999"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/11795131_42","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}