{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,7]],"date-time":"2025-02-07T05:07:57Z","timestamp":1738904877495,"version":"3.37.0"},"publisher-location":"Berlin, Heidelberg","reference-count":9,"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_12","type":"book-chapter","created":{"date-parts":[[2008,12,17]],"date-time":"2008-12-17T14:23:57Z","timestamp":1229523837000},"page":"200-211","source":"Crossref","is-referenced-by-count":2,"title":["Extracting Relevant Information about Reduct Sets from Data Tables"],"prefix":"10.1007","author":[{"given":"Mikhail Ju.","family":"Moshkov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrzej","family":"Skowron","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zbigniew","family":"Suraj","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"12_CR1","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1080\/10556789808805708","volume":"10","author":"E. Boros","year":"1998","unstructured":"Boros, E., Gurvich, V., Hammer, P.L.: Dual subimplicants of positive Boolean functions. Optimization Methods and Software\u00a010, 147\u2013156 (1998)","journal-title":"Optimization Methods and Software"},{"key":"12_CR2","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1007\/978-3-540-72458-2_46","volume-title":"Rough Sets and Knowledge Technology","author":"M. Moshkov","year":"2007","unstructured":"Moshkov, M., Piliszczuk, M.: Graphical representation of information on the set of reducts. In: Yao, J., Lingras, P., Wu, W.-Z., Szczuka, M.S., Cercone, N.J., \u015ale\u0327zak, D. (eds.) RSKT 2007. LNCS (LNAI), vol.\u00a04481, pp. 372\u2013378. Springer, Heidelberg (2007)"},{"key":"12_CR3","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/978-3-540-73451-2_19","volume-title":"Rough Sets and Intelligent Systems Paradigms","author":"M. Moshkov","year":"2007","unstructured":"Moshkov, M., Skowron, A., Suraj, Z.: On covering attribute sets by reducts. In: Kryszkiewicz, M., Peters, J.F., Rybinski, H., Skowron, A. (eds.) RSEISP 2007. LNCS (LNAI), vol.\u00a04585, pp. 175\u2013180. Springer, Heidelberg (2007)"},{"key":"12_CR4","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":"12_CR5","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)"},{"issue":"1","key":"12_CR6","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)","journal-title":"Information Sciences"},{"issue":"1","key":"12_CR7","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/j.ins.2006.06.007","volume":"177","author":"Z. Pawlak","year":"2007","unstructured":"Pawlak, Z., Skowron, A.: Rough sets and Boolean reasoning. Information Sciences\u00a0177(1), 41\u201373 (2007)","journal-title":"Information Sciences"},{"key":"12_CR8","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\u2013387 (2002)","journal-title":"Fundamenta Informaticae"},{"key":"12_CR9","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1007\/11548669_18","volume-title":"Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing","author":"J. Wr\u00f3blewski","year":"2005","unstructured":"Wr\u00f3blewski, J.: Pairwise cores in information systems. In: \u015al\u0119zak, D., Wang, G., Szczuka, M.S., D\u00fcntsch, I., Yao, Y. (eds.) RSFDGrC 2005. LNCS (LNAI), vol.\u00a03641, pp. 166\u2013175. Springer, Heidelberg (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_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,6]],"date-time":"2025-02-06T07:03:52Z","timestamp":1738825432000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-89876-4_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540898757","9783540898764"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-89876-4_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}