{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,5]],"date-time":"2025-01-05T05:20:26Z","timestamp":1736054426020,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540286530"},{"type":"electronic","value":"9783540318255"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11548669_16","type":"book-chapter","created":{"date-parts":[[2005,9,27]],"date-time":"2005-09-27T14:27:55Z","timestamp":1127831275000},"page":"149-155","source":"Crossref","is-referenced-by-count":1,"title":["On Partial Tests and Partial Reducts for Decision Tables"],"prefix":"10.1007","author":[{"given":"Mikhail Ju.","family":"Moshkov","sequence":"first","affiliation":[]},{"given":"Marcin","family":"Piliszczuk","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"16_CR1","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, vol.\u00a082(4) (2003)","DOI":"10.1016\/S1571-0661(04)80716-3"},{"key":"16_CR2","unstructured":"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, vol.\u00a057 (2003) (in Russian)"},{"key":"16_CR3","unstructured":"Moshkov, M.J., Piliszczuk, M.: On construction of partial reducts and bounds on their complexity. In: Proceedings of the Conference Decision Support Systems, Zakopane, Poland (2004) (to appear)"},{"key":"16_CR4","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":"16_CR5","first-page":"10","volume-title":"Rough Sets in Knowledge Discovery1. Methodology and Applications (Studies in Fuzziness and Soft Computing 18)","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 18), pp. 10\u201330. Phisica, Heidelberg (1998)"},{"key":"16_CR6","unstructured":"Skowron, A.: Rough sets in KDD. In: Proceedings of the 16-th World Computer Congress (IFIP 2000), Beijing, China, pp. 1\u201314."},{"key":"16_CR7","doi-asserted-by":"crossref","unstructured":"Slav\u00edk, P.: A tight analysis of the greedy algorithm for set cover. In: Proceedings of 28th Annual ACM Symposium on the Theory of Computing, pp. 435\u2013439 (1996)","DOI":"10.1145\/237814.237991"},{"key":"16_CR8","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":"16_CR9","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"}],"container-title":["Lecture Notes in Computer Science","Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11548669_16.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,4]],"date-time":"2025-01-04T15:51:42Z","timestamp":1736005902000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11548669_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540286530","9783540318255"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/11548669_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}