{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,6]],"date-time":"2025-06-06T14:48:40Z","timestamp":1749221320970},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540442745"},{"type":"electronic","value":"9783540458135"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45813-1_52","type":"book-chapter","created":{"date-parts":[[2007,8,11]],"date-time":"2007-08-11T15:05:07Z","timestamp":1186844707000},"page":"397-404","source":"Crossref","is-referenced-by-count":62,"title":["A New Version of Rough Set Exploration System"],"prefix":"10.1007","author":[{"given":"Jan G.","family":"Bazan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marcin S.","family":"Szczuka","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jakub","family":"Wr\u00f3blewski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,9,20]]},"reference":[{"key":"52_CR1","volume-title":"Proc. of 15 ICML","author":"S.D. Bay","year":"1998","unstructured":"Bay, S.D.: Combining Nearest Neighbor Classifiers Through Multiple Feature Subsets. In: Proc. of 15 ICML, Morgan Kaufmann, Madison, 1998"},{"key":"52_CR2","first-page":"321","volume-title":"Rough Sets in Knowledge Discovery","author":"J. Bazan","year":"1998","unstructured":"Bazan J., A Comparison of Dynamic and non-Dynamic Rough Set Methods for Extracting Laws from Decision Tables, In Polkowski L.(ed.), Rough Sets in Knowledge Discovery, Physica Verlag, Heidelberg, 1998 [10], vol. 1, pp. 321\u2013365"},{"key":"52_CR3","unstructured":"Bazan, J.G., Nguyen, H.S., Nguyen, S.H, Synak, P., Wr\u00f3blewski, J.: Rough Set Algorithms in Classification Problem. In: Polkowski, L., Tsumoto, S., Lin, T.Y. (eds), Rough Set Methods and Applications, Physica-Verlag, 2000 pp. 49\u201388."},{"key":"52_CR4","series-title":"LNAI","volume-title":"Proc. of RSCTC\u20192000","author":"J. Bazan","year":"2001","unstructured":"Bazan J., Szczuka M. RSES and RSESlib-A Collection of Tools for Rough Set Computations, Proc. of RSCTC\u20192000, LNAI 2005, Springer Verlag, Berlin, 2001"},{"key":"52_CR5","volume-title":"Computers and Intarctability: A Guide to the Theory of NP-completness","author":"M. Garey","year":"1998","unstructured":"Garey M., Johnson D., Computers and Intarctability: A Guide to the Theory of NP-completness, W.H. Freeman&Co., San Francisco, 1998, (twentieth print)"},{"issue":"1","key":"52_CR6","first-page":"27","volume":"31","author":"J. GrzymaIla-Busse","year":"1997","unstructured":"GrzymaIla-Busse J., A New Version of the Rule Induction System LERS Fundamenta Informaticae, Vol. 31(1), 1997, pp. 27\u201339","journal-title":"A New Version of the Rule Induction System LERS Fundamenta Informaticae"},{"key":"52_CR7","first-page":"451","volume-title":"Rough Sets in Knowledge Discovery","author":"H. Nguyen Sinh","year":"1998","unstructured":"Nguyen Sinh Hoa, Nguyen Hung Son, Discretization Methods in Data Mining, In Polkowski L.(ed.), Rough Sets in Knowledge Discovery, Physica Verlag, Heidelberg, 1998 [10] vol. 1, pp. 451\u2013482"},{"key":"52_CR8","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1007\/978-3-7908-1883-3_4","volume-title":"Rough Sets in Knowledge Discovery","author":"H. S. Nguyen","year":"1998","unstructured":"Hoa S. Nguyen, A. Skowron and P. Synak, Discovery of Data Patterns with Applications to Decomposition and Classfification Problems. In Polkowski L.(ed.), Rough Sets in Knowledge Discovery, Physica Verlag, Heidelberg, 1998 [10] vol. 2, pp. 55\u201397."},{"key":"52_CR9","volume-title":"Machine Learning, Neural and Statistical Classification","author":"D. Michie","year":"1994","unstructured":"Michie D., Spiegelhalter D. J., Taylor C. C., Machine Learning, Neural and Statistical Classification, Ellis Horwood, London, 1994"},{"volume-title":"Rough Sets in Knowledge Discovery","year":"1998","key":"52_CR10","unstructured":"Skowron A., Polkowski L. (ed.), Rough Sets in Knowledge Discovery vol. 1 and 2, Physica Verlag, Heidelberg, 1998"},{"key":"52_CR11","series-title":"LNAI","first-page":"548","volume-title":"Proc. of PKDD\u201999","author":"D. \u015al\u0119zak","year":"1999","unstructured":"\u015al\u0119zak D., Wr\u00f3blewski J., Classification Algorithms Based on Linear Combinations of Features. In: Proc. of PKDD\u201999. LNAI 1704, Springer Verlag, Berlin, 1999, pp. 548\u2013553."},{"key":"52_CR12","series-title":"LNAI","first-page":"402","volume-title":"Proceeding of RSCTC\u201998","author":"J. Wr\u00f3blewski","year":"1998","unstructured":"Wr\u00f3blewski J., Covering with Reducts-A Fast Algorithm for Rule Generation, Proceeding of RSCTC\u201998, LNAI 1424, Springer Verlag, Berlin, 1998, pp. 402\u2013407"},{"issue":"34","key":"52_CR13","first-page":"351","volume":"47","author":"J. Wr\u00f3blewski","year":"2001","unstructured":"Wr\u00f3blewski J.: Ensembles of classifiers based on approximate reducts, Fundamenta Informaticae 47(3,4), IOS Press (2001) 351\u2013360.","journal-title":"Fundamenta Informaticae"},{"key":"52_CR14","unstructured":"Bazan J., Szczuka M., The RSES Homepage, \n                    http:\/\/alfa.mimuw.edu.pl\/~rses"},{"key":"52_CR15","unstructured":"\u00d8rn A., The ROSETTA Homepage, \n                    http:\/\/www.idi.ntnu.no\/~aleks\/rosetta"},{"key":"52_CR16","volume-title":"UCI Repository of machine learning databases","author":"C.L. Blake","year":"1998","unstructured":"Blake C.L., Merz C.J., UCI Repository of machine learning databases, Irvine, CA: University of California, 1998, \n                    http:\/\/www.ics.uci.edu\/~mlearn"}],"container-title":["Lecture Notes in Computer Science","Rough Sets and Current Trends in Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45813-1_52","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,21]],"date-time":"2019-02-21T12:32:07Z","timestamp":1550752327000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45813-1_52"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540442745","9783540458135"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-45813-1_52","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}