{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:18:49Z","timestamp":1725560329853},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540286530"},{"type":"electronic","value":"9783540318255"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11548669_18","type":"book-chapter","created":{"date-parts":[[2005,9,27]],"date-time":"2005-09-27T14:27:55Z","timestamp":1127831275000},"page":"166-175","source":"Crossref","is-referenced-by-count":6,"title":["Pairwise Cores in Information Systems"],"prefix":"10.1007","author":[{"given":"Jakub","family":"Wr\u00f3blewski","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"18_CR1","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/978-3-7908-1840-6_3","volume-title":"Rough Set Methods and Applications","author":"J. Bazan","year":"2000","unstructured":"Bazan, J., 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, pp. 49\u201388. Physica, Heidelberg (2000)"},{"key":"18_CR2","volume-title":"Computers and Intractability, a Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability, a Guide to the Theory of NP-Completeness. W.H. Freeman and Company, San Francisco (1979)"},{"issue":"2,3","key":"18_CR3","first-page":"135","volume":"59","author":"X. Hu","year":"2004","unstructured":"Hu, X., Lin, T.Y., Han, J.: A New Rough Sets Model Based on Database Systems. Fundamenta Informaticae\u00a059(2,3), 135\u2013152 (2004)","journal-title":"Fundamenta Informaticae"},{"key":"18_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1007\/978-3-540-27794-1_5","volume-title":"Transactions on Rough Sets I","author":"M. Kryszkiewicz","year":"2004","unstructured":"Kryszkiewicz, M., Cichon, K.: Towards Scalable Algorithms for Discovering Rough Set Reducts. In: Peters, J.F., Skowron, A., Grzyma\u0142a-Busse, J.W., Kostek, B.z., \u015awiniarski, R.W., Szczuka, M.S. (eds.) Transactions on Rough Sets I. LNCS, vol.\u00a03100, pp. 120\u2013143. Springer, Heidelberg (2004)"},{"key":"18_CR5","unstructured":"UCI Machine Learning Rep.: \n                    \n                      http:\/\/www.ics.uci.edu\/~mlearn\/MLRepository.html"},{"key":"18_CR6","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1007\/3-540-39205-X_18","volume-title":"Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing","author":"D. Miao","year":"2003","unstructured":"Miao, D., Hou, L.: An Application of Rough Sets to Monk\u2019s Problems Solving. In: Wang, G., Liu, Q., Yao, Y., Skowron, A. (eds.) RSFDGrC 2003. LNCS (LNAI), vol.\u00a02639, pp. 138\u2013145. Springer, Heidelberg (2003)"},{"key":"18_CR7","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)"},{"key":"18_CR8","unstructured":"RSES \u2013 Rough Set Exploration System, \n                    \n                      http:\/\/logic.mimuw.edu.pl\/~rses\/"},{"key":"18_CR9","first-page":"311","volume-title":"Intelligent Decision Support. Handbook of Applications and Advances of the Rough Set Theory","author":"A. Skowron","year":"1992","unstructured":"Skowron, A., Rauszer, C.: The discernibility matrices and functions in information systems. In: Slowinski, W.R. (ed.) Intelligent Decision Support. Handbook of Applications and Advances of the Rough Set Theory, pp. 311\u2013362. Kluwer, Dordrecht (1992)"},{"key":"18_CR10","unstructured":"Wr\u00f3blewski, J.: Finding minimal reducts using genetic algorithms. Proc. of the Second Annual Join Conference on Information Sciences, Wrightsville Beach, NC, 186\u2013189 (1995), \n                    \n                      http:\/\/www.mimuw.edu.pl\/~jakubw\/bib\/"},{"key":"18_CR11","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"402","DOI":"10.1007\/3-540-69115-4_55","volume-title":"Rough Sets and Current Trends in Computing","author":"J. Wr\u00f3blewski","year":"1998","unstructured":"Wr\u00f3blewski, J.: Covering with reducts \u2013 a fast algorithm for rule generation. In: Polkowski, L., Skowron, A. (eds.) RSCTC 1998. LNCS (LNAI), vol.\u00a01424, pp. 402\u2013407. Springer, Heidelberg (1998)"},{"issue":"3,4","key":"18_CR12","first-page":"351","volume":"47","author":"J. Wr\u00f3blewski","year":"2001","unstructured":"Wr\u00f3blewski, J.: Ensembles of classifiers based on approximate reducts. Fundamenta Informaticae\u00a047(3,4), 351\u2013360 (2001)","journal-title":"Fundamenta Informaticae"}],"container-title":["Lecture Notes in Computer Science","Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11548669_18.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:58:03Z","timestamp":1619506683000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11548669_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540286530","9783540318255"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/11548669_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}