{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,17]],"date-time":"2026-01-17T20:13:59Z","timestamp":1768680839987,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642271410","type":"print"},{"value":"9783642271427","type":"electronic"}],"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-27142-7_9","type":"book-chapter","created":{"date-parts":[[2011,12,3]],"date-time":"2011-12-03T10:31:32Z","timestamp":1322908292000},"page":"64-77","source":"Crossref","is-referenced-by-count":25,"title":["Ensembles of Bireducts: Towards Robust Classification and Simple Representation"],"prefix":"10.1007","author":[{"given":"Dominik","family":"\u015al\u0119zak","sequence":"first","affiliation":[]},{"given":"Andrzej","family":"Janusz","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"9_CR1","doi-asserted-by":"crossref","unstructured":"Bazan, J., Nguyen, H., Nguyen, S., Synak, P., Wr\u00f3blewski, J.: Rough Set Algorithms in Classification Problem. In: Polkowski, L., Tsumoto, S., Lin, T. (eds.) Rough Set Methods and Applications. STUDFUZZ, vol. 56, pp. 49\u201388. Physica Verlag (2000)","DOI":"10.1007\/978-3-7908-1840-6_3"},{"issue":"2","key":"9_CR2","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1023\/A:1007607513941","volume":"40","author":"T.G. Dietterich","year":"2000","unstructured":"Dietterich, T.G.: An Experimental Comparison of Three Methods for Constructing Ensembles of Decision Trees: Bagging, Boosting, and Randomization. Machine Learning\u00a040(2), 139\u2013157 (2000)","journal-title":"Machine Learning"},{"key":"9_CR3","unstructured":"Frank, A., Asuncion, A.: UCI Machine Learning Repository. University of California, School of Information and Computer Science, Irvine, CA (2010)"},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"Frank, E., Kramer, S.: Ensembles of Nested Dichotomies for Multi-class Problems. In: Proc. of Int. Conf. on Machine Learning (ICML). ACM International Conference Proceeding Series, vol. 69 (2004)","DOI":"10.1145\/1015330.1015363"},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"Ganter, B., Wille, R.: Formal Concept Analysis: Mathematical Foundations. Springer (1998)","DOI":"10.1007\/978-3-642-59830-2"},{"key":"9_CR6","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/978-3-540-88425-5_22","volume-title":"Rough Sets and Current Trends in Computing","author":"A. Janusz","year":"2008","unstructured":"Janusz, A.: Similarity Relation in Classification Problems. In: Chan, C.-C., Grzymala-Busse, J.W., Ziarko, W.P. (eds.) RSCTC 2008. LNCS (LNAI), vol.\u00a05306, pp. 211\u2013222. Springer, Heidelberg (2008)"},{"key":"9_CR7","unstructured":"Janusz, A., \u015al\u0119zak, D.: An Unsupervised Model for Rule-based Similarity Learning from Textual Data: A General Idea. In: Proc. of Int. Workshop on Concurrency, Specification, and Programming (CS&P), pp. 229\u2013237 (2011)"},{"issue":"2","key":"9_CR8","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/S0933-3657(01)00082-3","volume":"23","author":"\u0141.A. Kurgan","year":"2001","unstructured":"Kurgan, \u0141.A., Cios, K.J., Tadeusiewicz, R., Ogiela, M.R., Goodenday, L.S.: Knowledge Discovery Approach to Automated Cardiac SPECT Diagnosis. Artificial Intelligence in Medicine\u00a023(2), 149\u2013169 (2001)","journal-title":"Artificial Intelligence in Medicine"},{"key":"9_CR9","doi-asserted-by":"crossref","unstructured":"Liu, H., Motoda, H. (eds.): Computational Methods of Feature Selection. Chapman & Hall\/CRC (2008)","DOI":"10.1201\/9781584888796"},{"key":"9_CR10","doi-asserted-by":"crossref","unstructured":"Mirkin, B.: Mathematical Classification and Clustering. Kluwer (1996)","DOI":"10.1007\/978-1-4613-0457-9"},{"key":"9_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1007\/11847465_16","volume-title":"Transactions on Rough Sets V","author":"H.S. Nguyen","year":"2006","unstructured":"Nguyen, H.S.: Approximate Boolean Reasoning: Foundations and Applications in Data Mining. In: Peters, J.F., Skowron, A. (eds.) Transactions on Rough Sets V. LNCS, vol.\u00a04100, pp. 334\u2013506. Springer, Heidelberg (2006)"},{"issue":"1","key":"9_CR12","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"},{"key":"9_CR13","unstructured":"R Development Core Team: R: A Language and Environment for Statistical Computing. R Foundation for Statistical Computing, Vienna, Austria (2008), http:\/\/www.R-project.org"},{"key":"9_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1007\/978-3-642-02097-1_10","volume-title":"Transactions on Computational Science V","author":"D. \u015al\u0119zak","year":"2009","unstructured":"\u015al\u0119zak, D.: Rough Sets and Functional Dependencies in Data: Foundations of Association Reducts. In: Gavrilova, M.L., Tan, C.J.K., Wang, Y., Chan, K.C.C. (eds.) Transactions on Computational Science V. LNCS, vol.\u00a05540, pp. 182\u2013205. Springer, Heidelberg (2009)"},{"key":"9_CR15","series-title":"Lecture Notes in Artificial Intelligence","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 (LNAI), vol.\u00a06086, pp. 187\u2013196. Springer, Heidelberg (2010)"},{"key":"9_CR16","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1007\/978-3-642-13529-3_3","volume-title":"Rough Sets and Current Trends in Computing","author":"M. Wojnarski","year":"2010","unstructured":"Wojnarski, M., Janusz, A., Nguyen, H.S., Bazan, J., Luo, C., Chen, Z., Hu, F., Wang, G., Guan, L., Luo, H., Gao, J., Shen, Y., Nikulin, V., Huang, T.-H., McLachlan, G.J., Bo\u0161njak, M., Gamberger, D.: RSCTC\u20192010 Discovery Challenge: Mining DNA Microarray Data for Medical Diagnosis and Treatment. In: Szczuka, M., Kryszkiewicz, M., Ramanna, S., Jensen, R., Hu, Q. (eds.) RSCTC 2010. LNCS (LNAI), vol.\u00a06086, pp. 4\u201319. Springer, Heidelberg (2010)"}],"container-title":["Lecture Notes in Computer Science","Future Generation Information Technology"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-27142-7_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,20]],"date-time":"2019-06-20T03:17:25Z","timestamp":1561000645000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-27142-7_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642271410","9783642271427"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-27142-7_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011]]}}}