{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T08:08:24Z","timestamp":1759133304122},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540566021"},{"type":"electronic","value":"9783540475972"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-56602-3_138","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T11:19:19Z","timestamp":1330255159000},"page":"213-226","source":"Crossref","is-referenced-by-count":88,"title":["Feature selection using rough sets theory"],"prefix":"10.1007","author":[{"given":"Maciej","family":"Modrzejewski","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"issue":"No.1","key":"15_CR1","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/0020-0190(76)90095-8","volume":"5","author":"L. Hyafil","year":"1976","unstructured":"Hyafil L., Rivest R.L., Constructing optimal binary decision trees is NP-complete, Information Processing Letters, Vol. 5, No. 1,May 1976, pp. 15\u201317.","journal-title":"Information Processing Letters"},{"key":"15_CR2","volume-title":"Report ISG 86-5, UIUCDCS-F-86-949","author":"J. Hong","year":"1986","unstructured":"Hong J., Mozetic I., Michalski R.S., AQ-15: Incremental Learning of Attribute-Based Descriptions from Examples, The Method and User's Guide, Report ISG 86-5, UIUCDCS-F-86-949, Dept of Computer Science, University of Illinois, Urbana, 1986."},{"key":"15_CR3","volume-title":"Report P91-13 MLI 91-6","author":"R.S. Michalski","year":"1991","unstructured":"Michalski R.S., Inferential Learning Theory: A Conceptual Framework for Characterizing Learning Processes, Report P91-13 MLI 91-6, Center for Artificial Intelligence, George Mason University, Fairfax, 1991."},{"issue":"No.5","key":"15_CR4","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1007\/BF01001956","volume":"11","author":"Z. Pawlak","year":"1982","unstructured":"Pawlak Z., Rough Sets, International Journal of Computer and Information Sciences, Vol. 11, No. 5, 1982, pp. 341\u2013356.","journal-title":"International Journal of Computer and Information Sciences"},{"key":"15_CR5","doi-asserted-by":"crossref","unstructured":"Pawlak Z., Rough Sets, Theoretical Aspects of Reasoning about Data, Kluwer Academic Publishers, 1991.","DOI":"10.1007\/978-94-011-3534-4"},{"key":"15_CR6","volume-title":"Expert systems in the microelectronic age","author":"R. Quinlan","year":"1979","unstructured":"Quinlan R., Discovering rules from large collection of examples, in D. Mitchie (editor), Expert systems in the microelectronic age, Edinburgh University Press, Edinburgh 1979."},{"key":"15_CR7","doi-asserted-by":"crossref","unstructured":"Skowron A., Rauszer C., The Discernibility Matrices and Functions in Information Systems, ICS WUT Research Report 1\/91, Warsaw, 1991.","DOI":"10.1007\/978-94-015-7975-9_21"}],"container-title":["Lecture Notes in Computer Science","Machine Learning: ECML-93"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-56602-3_138.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,31]],"date-time":"2021-12-31T04:51:41Z","timestamp":1640926301000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-56602-3_138"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540566021","9783540475972"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/3-540-56602-3_138","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]}}}