{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T08:14:45Z","timestamp":1760170485769},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540898757"},{"type":"electronic","value":"9783540898764"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"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":[[2008]]},"DOI":"10.1007\/978-3-540-89876-4_5","type":"book-chapter","created":{"date-parts":[[2008,12,17]],"date-time":"2008-12-17T09:23:57Z","timestamp":1229505837000},"page":"76-95","source":"Crossref","is-referenced-by-count":10,"title":["FUN: Fast Discovery of Minimal Sets of Attributes Functionally Determining a Decision Attribute"],"prefix":"10.1007","author":[{"given":"Marzena","family":"Kryszkiewicz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Piotr","family":"Lasek","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5_CR1","first-page":"307","volume-title":"Advances in KDD","author":"R. Agrawal","year":"1996","unstructured":"Agrawal, R., Mannila, H., Srikant, R., Toivonen, H., Verkamo, A.I.: Fast Discovery of Association Rules. In: Advances in KDD, pp. 307\u2013328. AAAI, Menlo Park (1996)"},{"key":"5_CR2","doi-asserted-by":"crossref","unstructured":"Armstrong, W.W.: Dependency Structures of Data Based Relationships. In: Proceedings of IFIP Congress, Geneva, Switzerland, pp. 580\u2013583 (1974)","DOI":"10.1515\/9783110840308-026"},{"key":"5_CR3","series-title":"LNAI","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1007\/3-540-58495-1_35","volume-title":"Methodologies for Intelligent Systems","author":"J. Bazan","year":"1994","unstructured":"Bazan, J., Skowron, A., Synak, P.: Dynamic Reducts as a Tool for Extracting Laws from Decision Tables. In: Ra\u015b, Z.W., Zemankova, M. (eds.) ISMIS 1994. LNCS (LNAI), vol.\u00a0869, pp. 346\u2013355. Springer, Heidelberg (1994)"},{"key":"5_CR4","doi-asserted-by":"publisher","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., Wroblewski, J.: Rough Set Algorithms in Classification Problem. In: Rough Set Methods and Applications, pp. 49\u201388. Physica-Verlag, Heidelberg (2000)"},{"key":"5_CR5","doi-asserted-by":"crossref","unstructured":"Bazan, J.G., Szczuka, M.S.: RSES and RSESlib - A Collection of Tools for Rough Set Computations. In: Rough Sets and Current Trends in Computing, pp. 106\u2013113 (2000)","DOI":"10.1007\/3-540-45554-X_12"},{"issue":"2","key":"5_CR6","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1093\/comjnl\/42.2.100","volume":"42","author":"Y. Huhtala","year":"1999","unstructured":"Huhtala, Y., Karkkainen, J., Porkka, P., Toivonen, H.: TANE: An Efficient Algorithm for Discovering Functional and Approximate Dependencies. The Computer Journal\u00a042(2), 100\u2013111 (1999)","journal-title":"The Computer Journal"},{"key":"5_CR7","unstructured":"Jelonek, J., Krawiec, K., Stefanowski, J.: Comparative study of feature subset selection techniques for machine learning tasks. In: Proceedings of IIS, Malbork, Poland, pp. 68\u201377 (1998)"},{"key":"5_CR8","unstructured":"Kryszkiewicz, M.: Algorytmy Redukcji Wiedzy w Systemach Informacyjnych, Ph.D. Thesis, Warsaw University of Technology (1994)"},{"issue":"1","key":"5_CR9","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1002\/1098-111X(200101)16:1<105::AID-INT8>3.0.CO;2-S","volume":"16","author":"M. Kryszkiewicz","year":"2001","unstructured":"Kryszkiewicz, M.: Comparative Study of Alternative Types of Knowledge Reduction in Inconsistent Systems. Intl. Journal of Intelligent Systems\u00a016(1), 105\u2013120 (2001)","journal-title":"Intl. Journal of Intelligent Systems"},{"key":"5_CR10","series-title":"LNAI","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1007\/978-3-540-73451-2_18","volume-title":"Rough Sets and Intelligent Systems Paradigms","author":"M. Kryszkiewicz","year":"2007","unstructured":"Kryszkiewicz, M.: Certain, Generalized Decision, and Membership Distribution Reducts versus Functional Dependencies in Incomplete Systems. In: Kryszkiewicz, M., Peters, J.F., Rybinski, H., Skowron, A. (eds.) RSEISP 2007. LNCS (LNAI), vol.\u00a04585, pp. 162\u2013174. Springer, Heidelberg (2007)"},{"key":"5_CR11","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":"5_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1007\/978-3-540-73451-2_34","volume-title":"Rough Sets and Intelligent Systems Paradigms","author":"M. Kryszkiewicz","year":"2007","unstructured":"Kryszkiewicz, M., Lasek, P.: Fast Discovery of Minimal Sets of Attributes Functionally Determining a Decision Attribute. In: Kryszkiewicz, M., Peters, J.F., Rybinski, H., Skowron, A. (eds.) RSEISP 2007. LNCS, vol.\u00a04585, pp. 320\u2013331. Springer, Heidelberg (2007)"},{"key":"5_CR13","unstructured":"Lin, T.Y.: Rough Set Theory in Very Large Databases. In: Proceedings of CESA IMACS, Lille, France, vol.\u00a02, pp. 936\u2013941 (1996)"},{"key":"5_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1007\/3-540-46439-5_24","volume-title":"Advances in Database Technology - EDBT 2000","author":"S. Lopes","year":"2000","unstructured":"Lopes, S., Petit, J.-M., Lakhal, L.: Efficient Discovery of Functional Dependencies and Armstrong Relations. In: Zaniolo, C., Grust, T., Scholl, M.H., Lockemann, P.C. (eds.) EDBT 2000. LNCS, vol.\u00a01777, pp. 350\u2013364. Springer, Heidelberg (2000)"},{"key":"5_CR15","unstructured":"Nguyen, S.H., Skowron, A., Synak, P., Wroblewski, J.: Knowledge Discovery in Databases: Rough Set Approach. In: Proceedings of IFSA, Prague, vol.\u00a02, pp. 204\u2013209 (1997)"},{"key":"5_CR16","unstructured":"Ohrn, A.: Discernibility and Rough Sets in Medicine: Tools and Applications, PhD thesis, Department of Computer and Information Science, Norwegian University of Science and Technology, Trondheim, Norway. NTNU report 1999:133, IDI report 1999:14"},{"key":"5_CR17","doi-asserted-by":"crossref","unstructured":"Pancerz, K., Suraj, Z.: Rough sets for discovering concurrent system models from data tables. In: Rough Computing: Theories, Technologies and Applications, pp. 239\u2013268. Idea Group, Inc. (2007)","DOI":"10.4018\/978-1-59904-552-8.ch012"},{"key":"5_CR18","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-011-3534-4","volume-title":"Rough Sets: Theoretical Aspects of Reasoning about Data","author":"Z. Pawlak","year":"1991","unstructured":"Pawlak, Z.: Rough Sets: Theoretical Aspects of Reasoning about Data, vol.\u00a09. Kluwer Academic Publishers, Dordrecht (1991)"},{"key":"5_CR19","first-page":"178","volume":"48","author":"Z. Pawlak","year":"1992","unstructured":"Pawlak, Z.: Concurrent versus sequential the rough sets perspective. Bulletin of the EATCS\u00a048, 178\u2013190 (1992)","journal-title":"Bulletin of the EATCS"},{"key":"5_CR20","unstructured":"Shan, N., Ziarko, W., Hamilton, H.J., Cercone, N.: Discovering Classification Knowledge in Databases Using Rough Sets. In: Proceedings of KDD, pp. 271\u2013274 (1996)"},{"key":"5_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/3-540-56804-2_28","volume-title":"Methodologies for Intelligent Systems","author":"A. Skowron","year":"1993","unstructured":"Skowron, A.: Boolean Reasoning for Decision Rules Generation. In: Komorowski, J., Ra\u015b, Z.W. (eds.) ISMIS 1993. LNCS, vol.\u00a0689, pp. 295\u2013305. Springer, Heidelberg (1993)"},{"key":"5_CR22","unstructured":"Skowron, A., Suraj, Z.: Discovery of Concurrent Data Models from Experimental Tables: A Rough Set Approach. In: Proceedings of KDD, Montreal, Canada, pp. 288\u2013293 (1995)"},{"key":"5_CR23","unstructured":"Slezak, D.: Approximate Reducts in Decision Tables. In: Proceedings of IPMU, Granada, Spain, vol.\u00a03, pp. 1159\u20131164 (1996)"},{"key":"5_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/3-540-69115-4_8","volume-title":"Rough Sets and Current Trends in Computing","author":"D. Slezak","year":"1998","unstructured":"Slezak, D.: Searching for Frequential Reducts in Decision Tables with Uncertain Objects. In: Polkowski, L., Skowron, A. (eds.) RSCTC 1998. LNCS, vol.\u00a01424, pp. 52\u201359. Springer, Heidelberg (1998)"},{"key":"5_CR25","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. Slezak","year":"2006","unstructured":"Slezak, 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)"},{"volume-title":"Intelligent Decision Support, Handbook of Applications and Advances of the Rough Sets Theory","year":"1992","key":"5_CR26","unstructured":"Slowinski, R. (ed.): Intelligent Decision Support, Handbook of Applications and Advances of the Rough Sets Theory, vol.\u00a011. Kluwer Academic Publishers, Dordrecht (1992)"},{"key":"5_CR27","volume-title":"Rough Sets in Data Mining and Knowledge Discovery","author":"J. Stepaniuk","year":"1998","unstructured":"Stepaniuk, J.: Approximation Spaces, Reducts and Representatives. In: Rough Sets in Data Mining and Knowledge Discovery. Springer, Berlin (1998)"},{"key":"5_CR28","first-page":"379","volume-title":"Rough set methods and applications. New developments in knowledge discovery in information systems (Studies in fuzziness and soft computing)","author":"Z. Suraj","year":"2000","unstructured":"Suraj, Z.: Rough Set Methods for the 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), pp. 379\u2013488. Physica-Verlag, Heidelberg (2000)"},{"key":"5_CR29","unstructured":"Wroblewski, J.: Finding Minimal Reducts Using Genetic Algorithms. In: Proceedings of JCIS, Wrightsville Beach, NC, September\/October 1995, pp. 186\u2013189 (1995)"}],"container-title":["Lecture Notes in Computer Science","Transactions on Rough Sets IX"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-89876-4_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T07:18:50Z","timestamp":1557991130000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-89876-4_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540898757","9783540898764"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-89876-4_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}