{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T08:15:15Z","timestamp":1760170515116,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":42,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642020964"},{"type":"electronic","value":"9783642020971"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-02097-1_10","type":"book-chapter","created":{"date-parts":[[2009,6,11]],"date-time":"2009-06-11T10:32:35Z","timestamp":1244716355000},"page":"182-205","source":"Crossref","is-referenced-by-count":19,"title":["Rough Sets and Functional Dependencies in Data: Foundations of Association Reducts"],"prefix":"10.1007","author":[{"given":"Dominik","family":"\u015al\u0119zak","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"10_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Imieli\u0144ski, T., Swami, A.N.: Mining Association Rules between Sets of Items in Large Databases. In: Proc. of SIGMOD 1993, Washington, DC, May 26\u201328, pp. 207\u2013216 (1993)","DOI":"10.1145\/170036.170072"},{"key":"10_CR2","first-page":"580","volume":"74","author":"W.W. Armstrong","year":"1974","unstructured":"Armstrong, W.W.: Dependency Structures of Database Relationships. Inform. Process.\u00a074, 580\u2013583 (1974)","journal-title":"Inform. Process."},{"key":"10_CR3","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: Rough Set Methods and Applications. New Developments in Knowledge Discovery in Information Systems. Studies in Fuzziness and Soft Computing, vol.\u00a056, pp. 49\u201388. Physica Verlag (2000)","DOI":"10.1007\/978-3-7908-1840-6_3"},{"key":"10_CR4","doi-asserted-by":"crossref","unstructured":"Bertet, K., Monjardet, B.: The multiple facets of the canonical direct unit implicational basis. Theoretical Computer Science (2009) (to appear)","DOI":"10.1016\/j.tcs.2009.12.021"},{"key":"10_CR5","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-2078-5","volume-title":"Boolean reasoning","author":"E.M. Brown","year":"1990","unstructured":"Brown, E.M.: Boolean reasoning. Kluwer, Dordrecht (1990)"},{"key":"10_CR6","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-8130-3","volume-title":"A Course in Universal Algebra","author":"S.N. Burris","year":"1981","unstructured":"Burris, S.N., Sankappanavar, H.P.: A Course in Universal Algebra. Springer, Heidelberg (1981)"},{"key":"10_CR7","doi-asserted-by":"crossref","unstructured":"Ceglar, A., Roddick, J.F.: Association mining. ACM Comput. Surv.\u00a038(2) (2006)","DOI":"10.1145\/1132956.1132958"},{"key":"10_CR8","unstructured":"Davis, L. (ed.): Handbook of Genetic Algorithms. Van Nostrand Reinhold (1991)"},{"issue":"1","key":"10_CR9","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/S0004-3702(98)00091-5","volume":"106","author":"I. Duentsch","year":"1998","unstructured":"Duentsch, I., Gediga, G.: Uncertainty Measures of Rough Set Prediction. Artif. Intell.\u00a0106(1), 109\u2013137 (1998)","journal-title":"Artif. Intell."},{"key":"10_CR10","volume-title":"Information Theory and Reliable Communication","author":"R.G. Gallager","year":"1968","unstructured":"Gallager, R.G.: Information Theory and Reliable Communication. Wiley, Chichester (1968)"},{"key":"10_CR11","volume-title":"Formal Concept Analysis: Mathematical Foundations","author":"B. Ganter","year":"1998","unstructured":"Ganter, B., Wille, R.: Formal Concept Analysis: Mathematical Foundations. Springer, Heidelberg (1998)"},{"key":"10_CR12","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. Freeman and Company, New York (1979)"},{"issue":"1","key":"10_CR13","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/s10796-005-6100-x","volume":"8","author":"A. Gru\u017cd\u017a","year":"2006","unstructured":"Gru\u017cd\u017a, A., Ihnatowicz, A., \u015al\u0119zak, D.: Interactive Gene Clustering \u2013 A Case Study of Breast Cancer Microarray Data. Information Systems Frontiers\u00a08(1), 21\u201327 (2006)","journal-title":"Information Systems Frontiers"},{"key":"10_CR14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-66943-9","volume-title":"Mechanizing Hypothesis Formation: Mathematical Foundations for a General Theory","author":"P. Hajek","year":"1978","unstructured":"Hajek, P., Havranek, T.: Mechanizing Hypothesis Formation: Mathematical Foundations for a General Theory. Springer, Heidelberg (1978)"},{"volume-title":"Handbook of Data Mining and Knowledge Discovery","year":"2002","key":"10_CR15","unstructured":"Kloesgen, W., \u017bytkow, J.M. (eds.): Handbook of Data Mining and Knowledge Discovery. Oxford University Press, Oxford (2002)"},{"key":"10_CR16","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":"10_CR17","unstructured":"Liu, H., Motoda, H. (eds.): Computational Methods of Feature Selection. Chapman & Hall, Boca Raton (2008)"},{"issue":"2","key":"10_CR18","doi-asserted-by":"publisher","first-page":"77","DOI":"10.2165\/00822942-200605020-00002","volume":"5","author":"B.A. McKinney","year":"2006","unstructured":"McKinney, B.A., Reif, D.M., Ritchie, M.D., Moore, J.H.: Machine Learning for Detecting Gene-Gene Interactions: A Review. Applied Bioinformatics\u00a05(2), 77\u201388 (2006)","journal-title":"Applied Bioinformatics"},{"issue":"1\u20134","key":"10_CR19","first-page":"357","volume":"75","author":"M. Moshkov","year":"2007","unstructured":"Moshkov, M., Piliszczuk, M., Zielosko, B.: On Construction of Partial Reducts and Irreducible Partial Decision Rules. Fundam. Inform.\u00a075(1\u20134), 357\u2013374 (2007)","journal-title":"Fundam. Inform."},{"key":"10_CR20","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":"4","key":"10_CR21","doi-asserted-by":"crossref","first-page":"310","DOI":"10.3233\/FI-1999-40403","volume":"40","author":"H.S. Nguyen","year":"1999","unstructured":"Nguyen, H.S., Nguyen, S.H.: Rough Sets and Association Rule Generation. Fundamenta Informaticae\u00a040(4), 310\u2013318 (1999)","journal-title":"Fundamenta Informaticae"},{"issue":"3","key":"10_CR22","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/0306-4379(81)90023-5","volume":"6","author":"Z. Pawlak","year":"1981","unstructured":"Pawlak, Z.: Information systems theoretical foundations. Inf. Syst.\u00a06(3), 205\u2013218 (1981)","journal-title":"Inf. Syst."},{"key":"10_CR23","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, Dordrecht (1991)"},{"key":"10_CR24","unstructured":"Pawlak, Z.: Rough set elements. In: Rough Sets in Knowledge Discovery 1 \u2013 Methodology and Applications. Studies in Fuzziness and Soft Computing, vol.\u00a018, pp. 10\u201330. Physica Verlag (1998)"},{"issue":"1","key":"10_CR25","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":"10_CR26","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: Intelligent Decision Support. Handbook of Applications and Advances of the Rough Set Theory, pp. 311\u2013362. Kluwer, Dordrecht (1992)"},{"key":"10_CR27","unstructured":"\u015al\u0119zak, D.: Approximate reducts in decision tables. In: Proc. of IPMU 1996, Granada, Spain, July 1\u20135, vol.\u00a03, pp. 1159\u20131164 (1996)"},{"key":"10_CR28","doi-asserted-by":"crossref","unstructured":"\u015al\u0119zak, D.: Various Approaches to Reasoning with Frequency Based Decision Reducts. In: Rough Set Methods and Applications. New Developments in Knowledge Discovery in Information Systems. Studies in Fuzziness and Soft Computing, vol.\u00a056, pp. 235\u2013288. Physica Verlag (2000)","DOI":"10.1007\/978-3-7908-1840-6_6"},{"issue":"3\u20134","key":"10_CR29","doi-asserted-by":"crossref","first-page":"365","DOI":"10.3233\/FUN-2002-533-409","volume":"53","author":"D. \u015al\u0119zak","year":"2002","unstructured":"\u015al\u0119zak, D.: Approximate Entropy Reducts. Fundamenta Informaticae\u00a053(3\u20134), 365\u2013390 (2002)","journal-title":"Fundamenta Informaticae"},{"key":"10_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1007\/11425274_37","volume-title":"Foundations of Intelligent Systems","author":"D. \u015al\u0119zak","year":"2005","unstructured":"\u015al\u0119zak, D.: Association Reducts: A Framework for Mining Multi-Attribute Dependencies. In: Hacid, M.-S., Murray, N.V., Ra\u015b, Z.W., Tsumoto, S. (eds.) ISMIS 2005. LNCS, vol.\u00a03488, pp. 354\u2013363. Springer, Heidelberg (2005)"},{"key":"10_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/11795131_44","volume-title":"Rough Sets and Knowledge Technology","author":"D. \u015al\u0119zak","year":"2006","unstructured":"\u015al\u0119zak, D.: Association Reducts: Boolean Representation. In: Wang, G.-Y., Peters, J.F., Skowron, A., Yao, Y. (eds.) RSKT 2006. LNCS, vol.\u00a04062, pp. 305\u2013312. Springer, Heidelberg (2006)"},{"key":"10_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/11908029_18","volume-title":"Rough Sets and Current Trends in Computing","author":"D. \u015al\u0119zak","year":"2006","unstructured":"\u015al\u0119zak, D.: Association Reducts: Complexity and Heuristics. In: Greco, S., Hata, Y., Hirano, S., Inuiguchi, M., Miyamoto, S., Nguyen, H.S., S\u0142owi\u0144ski, R. (eds.) RSCTC 2006. LNCS, vol.\u00a04259, pp. 157\u2013164. Springer, Heidelberg (2006)"},{"key":"10_CR33","doi-asserted-by":"crossref","unstructured":"\u015al\u0119zak, D.: Rough Sets and Few-Objects-Many-Attributes Problem \u2013 The Case Study of Analysis of Gene Expression Data Sets. In: Proc. of FBIT 2007, Jeju, Korea, October 11\u201313, pp. 437\u2013440 (2007)","DOI":"10.1109\/FBIT.2007.160"},{"issue":"3","key":"10_CR34","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/j.ins.2008.09.007","volume":"179","author":"D. \u015al\u0119zak","year":"2009","unstructured":"\u015al\u0119zak, D.: Degrees of conditional (in)dependence: A framework for approximate Bayesian networks and examples related to the rough set-based feature selection. Information Sciences\u00a0179(3), 197\u2013209 (2009)","journal-title":"Information Sciences"},{"issue":"2","key":"10_CR35","first-page":"1337","volume":"1","author":"D. \u015al\u0119zak","year":"2008","unstructured":"\u015al\u0119zak, D., Wr\u00f3blewski, J., Eastwood, V., Synak, P.: Brighthouse: an analytic data warehouse for ad-hoc queries. PVLDB\u00a01(2), 1337\u20131345 (2008)","journal-title":"PVLDB"},{"issue":"3\u20134","key":"10_CR36","doi-asserted-by":"crossref","first-page":"353","DOI":"10.3233\/FI-1996-283411","volume":"28","author":"Z. Suraj","year":"1996","unstructured":"Suraj, Z.: Discovery of Concurrent Data Models from Experimental Tables: A Rough Set Approach. Fundam. Inform.\u00a028(3\u20134), 353\u2013376, 379\u2013490 (1996)","journal-title":"Fundam. Inform."},{"key":"10_CR37","doi-asserted-by":"crossref","unstructured":"Suraj, Z.: Rough Set Method for Synthesis and Analysis of Concurrent Processes. In: Rough Set Methods and Applications. New Developments in Knowledge Discovery in Information Systems. Studies in Fuzziness and Soft Computing, vol.\u00a056. Physica Verlag (2000)","DOI":"10.1007\/978-3-7908-1840-6_8"},{"issue":"6","key":"10_CR38","doi-asserted-by":"publisher","first-page":"833","DOI":"10.1016\/S0167-8655(02)00196-4","volume":"24","author":"R.W. \u015awiniarski","year":"2003","unstructured":"\u015awiniarski, R.W., Skowron, A.: Rough set methods in feature selection and recognition. Pattern Recognition Letters\u00a024(6), 833\u2013849 (2003)","journal-title":"Pattern Recognition Letters"},{"key":"10_CR39","volume-title":"Database Systems: The Complete Book","author":"J.D. Ullman","year":"2001","unstructured":"Ullman, J.D., Garcia-Molina, H., Widom, J.: Database Systems: The Complete Book. Prentice Hall, Englewood Cliffs (2001)"},{"issue":"3\u20134","key":"10_CR40","doi-asserted-by":"crossref","first-page":"423","DOI":"10.3233\/FI-1996-283414","volume":"28","author":"J. Wr\u00f3blewski","year":"1996","unstructured":"Wr\u00f3blewski, J.: Theoretical Foundations of Order-Based Genetic Algorithms. Fundamenta Informaticae\u00a028(3\u20134), 423\u2013430 (1996)","journal-title":"Fundamenta Informaticae"},{"issue":"3\u20134","key":"10_CR41","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\u20134), 351\u2013360 (2001)","journal-title":"Fundamenta Informaticae"},{"key":"10_CR42","first-page":"100","volume":"2","author":"Y.Y. Yao","year":"2008","unstructured":"Yao, Y.Y., Zhao, Y., Wang, J.: On Reduct Construction Algorithms. Transactions on Computational Science\u00a02, 100\u2013117 (2008)","journal-title":"Transactions on Computational Science"}],"container-title":["Lecture Notes in Computer Science","Transactions on Computational Science V"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02097-1_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,10]],"date-time":"2025-02-10T02:56:03Z","timestamp":1739156163000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02097-1_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642020964","9783642020971"],"references-count":42,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02097-1_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}