{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:59:11Z","timestamp":1725487151450},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540734505"},{"type":"electronic","value":"9783540734512"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-73451-2_34","type":"book-chapter","created":{"date-parts":[[2007,7,16]],"date-time":"2007-07-16T16:12:14Z","timestamp":1184602334000},"page":"320-331","source":"Crossref","is-referenced-by-count":4,"title":["Fast Discovery of Minimal Sets of Attributes Functionally Determining a Decision Attribute"],"prefix":"10.1007","author":[{"given":"Marzena","family":"Kryszkiewicz","sequence":"first","affiliation":[]},{"given":"Piotr","family":"Lasek","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"34_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 Press, Menlo Park, California (1996)"},{"key":"34_CR2","doi-asserted-by":"crossref","unstructured":"Armstrong, W.W.: Dependency Structures of Data Based Relationships. In: Proc. of IFIP Congress. Geneva, Switzerland, pp. 580\u2013583 (1974)","DOI":"10.1515\/9783110840308-026"},{"key":"34_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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, vol.\u00a0869, pp. 346\u2013355. Springer, Heidelberg (1994)"},{"key":"34_CR4","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., Wroblewski, J.: Rough Set Algorithms in Classification Problem. In: Rough Set Methods and Applications, pp. 49\u201388. Physica- Verlag, Heidelberg (2000)"},{"issue":"2","key":"34_CR5","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":"34_CR6","unstructured":"Jelonek, J., Krawiec, K., Stefanowski, J.: Comparative study of feature subset selection techniques for machine learning tasks. In: Proc. of IIS, Malbork, Poland, pp. 68\u201377 (1998)"},{"key":"34_CR7","first-page":"105","volume-title":"Intl. Journal of Intelligent Systems","author":"M. Kryszkiewicz","year":"2001","unstructured":"Kryszkiewicz, M.: Comparative Study of Alternative Types of Knowledge Reduction in Inconsistent Systems. In: Intl. Journal of Intelligent Systems, vol.\u00a016(1), pp. 105\u2013120. Wiley, Chichester (2001)"},{"key":"34_CR8","unstructured":"Kryszkiewicz, M.: Certain, Generalized Decision, and Membership Distribution Reducts versus Functional Dependencies in Incomplete Systems. RSEISP, LNAI (2007)"},{"key":"34_CR9","doi-asserted-by":"crossref","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., \u015awiniarski, R.W., Szczuka, M. (eds.) Transactions on Rough Sets I. LNCS, vol.\u00a03100, Springer, Heidelberg (2004)","DOI":"10.1007\/978-3-540-27794-1_5"},{"key":"34_CR10","unstructured":"Lin, T.Y.: Rough Set Theory in Very Large Databases. In: Proc. of CESA IMACS, Lille, France, vol. 2, pp. 936\u2013941 (1996)"},{"key":"34_CR11","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":"34_CR12","unstructured":"Nguyen, S.H., Skowron, A., Synak, P., Wroblewski, J.: Knowledge Discovery in Databases: Rough Set Approach. In: Proc. of IFSA, Prague, vol.\u00a02, pp. 204\u2013209 (1997)"},{"key":"34_CR13","doi-asserted-by":"crossref","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, Boston (1991)"},{"key":"34_CR14","unstructured":"Shan, N., Ziarko, W., Hamilton, H.J., Cercone, N.: Discovering Classification Knowledge in Databases Using Rough Sets. In: Proc. of KDD, pp. 271\u2013274 (1996)"},{"key":"34_CR15","doi-asserted-by":"crossref","unstructured":"Skowron, A.: Boolean Reasoning for Decision Rules Generation. ISMIS, 295\u2013305 (1993)","DOI":"10.1007\/3-540-56804-2_28"},{"key":"34_CR16","unstructured":"Slezak, D.: Approximate Reducts in Decision Tables. In: Proc. of IPMU, Granada, Spain, vol. 3, pp. 1159\u20131164 (1996)"},{"key":"34_CR17","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"crossref","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 (LNAI), vol.\u00a01424, pp. 52\u201359. Springer, Heidelberg (1998)"},{"volume-title":"Intelligent Decision Support, Handbook of Applications and Advances of the Rough Sets Theory","year":"1992","key":"34_CR18","unstructured":"Slowinski, R. (ed.): Intelligent Decision Support, Handbook of Applications and Advances of the Rough Sets Theory, vol.\u00a011. Kluwer Academic Publishers, Boston (1992)"},{"key":"34_CR19","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":"34_CR20","unstructured":"Wroblewski, J.: Finding Minimal Reducts Using Genetic Algorithms. In: Proc. of JCIS, Wrightsville Beach, NC, September\/October 1995, pp. 186\u2013189 (1995)"}],"container-title":["Lecture Notes in Computer Science","Rough Sets and Intelligent Systems Paradigms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73451-2_34.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T05:15:02Z","timestamp":1605762902000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73451-2_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540734505","9783540734512"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73451-2_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}