{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T09:44:39Z","timestamp":1725615879761},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642244247"},{"type":"electronic","value":"9783642244254"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-24425-4_13","type":"book-chapter","created":{"date-parts":[[2011,9,30]],"date-time":"2011-09-30T11:16:31Z","timestamp":1317381391000},"page":"81-88","source":"Crossref","is-referenced-by-count":6,"title":["Rough-Set-Inspired Feature Subset Selection, Classifier Construction, and Rule Aggregation"],"prefix":"10.1007","author":[{"given":"Dominik","family":"\u015al\u0119zak","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sebastian","family":"Widz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"13_CR1","doi-asserted-by":"crossref","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.) New Developments in Knowledge Discovery in Information Systems, pp. 49\u201388. Physica Verlag, Heidelberg (2000)","DOI":"10.1007\/978-3-7908-1840-6_3"},{"key":"13_CR2","volume-title":"UCI Machine Learning Repository","author":"A. Frank","year":"2010","unstructured":"Frank, A., Asuncion, A.: UCI Machine Learning Repository. University of California, School of Information and Computer Science, Irvine, CA (2010)"},{"issue":"1","key":"13_CR3","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1023\/A:1006524209794","volume":"13","author":"J. F\u00fcrnkranz","year":"1999","unstructured":"F\u00fcrnkranz, J.: Separate-and-Conquer Rule Learning. Artif. Intell. Rev.\u00a013(1), 3\u201354 (1999)","journal-title":"Artif. Intell. Rev."},{"key":"13_CR4","doi-asserted-by":"crossref","unstructured":"Grzyma\u0142a-Busse, J.W., Ziarko, W.: Data mining based on rough sets. In: Wang, J. (ed.) Data Mining Opportunities and Challenges, pp. 142\u2013173. IGI Publishing (2003)","DOI":"10.4018\/978-1-59140-051-6.ch006"},{"key":"13_CR5","doi-asserted-by":"publisher","DOI":"10.1002\/0471660264","volume-title":"Combining Pattern Classifiers: Methods and Algorithms","author":"L.I. Kuncheva","year":"2004","unstructured":"Kuncheva, L.I.: Combining Pattern Classifiers: Methods and Algorithms. Wiley, Chichester (2004)"},{"volume-title":"Computational Methods of Feature Selection","year":"2008","key":"13_CR6","unstructured":"Liu, H., Motoda, H. (eds.): Computational Methods of Feature Selection. Chapman & Hall\/CRC, Boca Raton (2008)"},{"issue":"1","key":"13_CR7","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. Inf. Sci.\u00a0177(1), 3\u201327 (2007)","journal-title":"Inf. Sci."},{"key":"13_CR8","first-page":"182","volume":"5","author":"D. \u015al\u0119zak","year":"2009","unstructured":"\u015al\u0119zak, D.: Rough Sets and Functional Dependencies in Data: Foundations of Association Reducts. T. Computational Science\u00a05, 182\u2013205 (2009)","journal-title":"T. Computational Science"},{"key":"13_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/978-3-642-13529-3_21","volume-title":"Rough Sets and Current Trends in Computing","author":"D. \u015al\u0119zak","year":"2010","unstructured":"\u015al\u0119zak, D., Widz, S.: Is it important which rough-set-based classifier extraction and voting criteria are applied together? In: Szczuka, M., Kryszkiewicz, M., Ramanna, S., Jensen, R., Hu, Q. (eds.) RSCTC 2010. LNCS, vol.\u00a06086, pp. 187\u2013196. Springer, Heidelberg (2010)"},{"key":"13_CR10","doi-asserted-by":"crossref","unstructured":"\u015al\u0119zak, D., Widz, S.: Evolutionary Inspired Optimization of Feature Subset Ensembles. In: Proc. of NaBIC, pp. 444\u2013449 (2010)","DOI":"10.1109\/NABIC.2010.5716365"},{"issue":"1-3","key":"13_CR11","first-page":"393","volume":"72","author":"Z. Suraj","year":"2006","unstructured":"Suraj, Z., Gayar Neamat, E., Delimata, P.: A Rough Set Approach to Multiple Classifier Systems. Fundamenta Informaticae\u00a072(1-3), 393\u2013406 (2006)","journal-title":"Fundamenta Informaticae"},{"key":"13_CR12","doi-asserted-by":"crossref","unstructured":"Wr\u00f3blewski, J.: Genetic Algorithms in Decomposition and Classification Problems. In: Polkowski, L., Skowron, A. (eds.) Rough Sets in Knowledge Discovery, vol.\u00a02, pp. 471\u2013487. Physica-Verlag, Heidelberg (1998)","DOI":"10.1007\/978-3-7908-1883-3"}],"container-title":["Lecture Notes in Computer Science","Rough Sets and Knowledge Technology"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-24425-4_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,16]],"date-time":"2019-06-16T19:42:25Z","timestamp":1560714145000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-24425-4_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642244247","9783642244254"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-24425-4_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}