{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:33:26Z","timestamp":1725564806921},"publisher-location":"Berlin, Heidelberg","reference-count":31,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540223740"},{"type":"electronic","value":"9783540277941"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-27794-1_5","type":"book-chapter","created":{"date-parts":[[2010,9,5]],"date-time":"2010-09-05T20:57:51Z","timestamp":1283720271000},"page":"120-143","source":"Crossref","is-referenced-by-count":20,"title":["Towards Scalable Algorithms for Discovering Rough Set Reducts"],"prefix":"10.1007","author":[{"given":"Marzena","family":"Kryszkiewicz","sequence":"first","affiliation":[]},{"given":"Katarzyna","family":"Cicho\u0144","sequence":"additional","affiliation":[]}],"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","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":"5_CR3","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-Verlag, Heidelberg (2000)"},{"key":"5_CR4","unstructured":"Jelonek, J., Krawiec, K., Stefanowski, J.: Comparative Study of Feature Subset Selection Techniques for Machine Learning Tasks. In: Proc. of IIS 1998, Malbork, Poland, pp. 68\u201377 (1998)"},{"key":"5_CR5","first-page":"121","volume-title":"Machine Learning: Proc. of the Eleventh International Conference","author":"H.G. John","year":"1994","unstructured":"John, H.G., Kohavi, R., Pfleger, K.: Irrelevant Features and the Subset Selection Problem. In: Machine Learning: Proc. of the Eleventh International Conference, pp. 121\u2013129. Morgan Kaufmann Publishers, San Francisco (1994)"},{"key":"5_CR6","unstructured":"Kohavi, R., Frasca, B.: Useful Feature Subsets and Rough Set Reducts. In: Proc. of the Third International Workshop on Rough Sets and Soft Computing, San Jose, CA (1994)"},{"key":"5_CR7","doi-asserted-by":"crossref","unstructured":"Kryszkiewicz, M.: The Algorithms of Knowledge Reduction in Information Systems, Ph.D. Thesis, Warsaw University of Technology, Institute of Computer Science (1994)","DOI":"10.1007\/978-1-4471-3238-7_32"},{"issue":"2\u20133","key":"5_CR8","doi-asserted-by":"crossref","first-page":"183","DOI":"10.3233\/FI-1996-272306","volume":"27","author":"M. Kryszkiewicz","year":"1996","unstructured":"Kryszkiewicz, M., Rybinski, H.: Finding Reducts in Composed Information Systems. Fundamenta Informaticae\u00a027(2\u20133), 183\u2013196 (1996)","journal-title":"Fundamenta Informaticae"},{"key":"5_CR9","unstructured":"Kryszkiewicz, M.: Strong Rules in Large Databases. In: Proc. of IPMU 1998, Paris, France, vol.\u00a02, pp. 1520\u20131527 (1998)"},{"key":"5_CR10","unstructured":"Kryszkiewicz, M., Rybinski, H.: Knowledge Discovery from Large Databases using Rough Sets. In: Proc. of EUFIT 1998, Aachen, Germany, vol.\u00a01, pp. 85\u201389 (1998)"},{"issue":"1","key":"5_CR11","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. International Journal of Intelligent Systems\u00a016(1), 105\u2013120 (2001)","journal-title":"International Journal of Intelligent Systems"},{"key":"5_CR12","first-page":"319","volume-title":"The Encyclopedia of Computer Science and Technology","author":"M. Kryszkiewicz","year":"2001","unstructured":"Kryszkiewicz, M.: Rough Set Approach to Rules Generation from Incomplete Information Systems. In: The Encyclopedia of Computer Science and Technology, vol.\u00a044, pp. 319\u2013346. Marcel Dekker, Inc., New York (2001)"},{"key":"5_CR13","doi-asserted-by":"crossref","unstructured":"Kryszkiewicz, M., Cicho\u0144, K.: Scalable Methods of Discovering Rough Sets Reducts. ICS Research Report 28\/2003, Warsaw University of Technology (2003)","DOI":"10.1007\/978-3-540-39985-8_63"},{"key":"5_CR14","unstructured":"Lin, T.Y.: Rough Set Theory in Very Large Databases. In: Proc. of CESA IMACS 1996, Lille, France, vol.\u00a02, pp. 936\u2013941 (1996)"},{"key":"5_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1007\/3-540-56602-3_138","volume-title":"Machine Learning: ECML-93","author":"M. Modrzejewski","year":"1993","unstructured":"Modrzejewski, M.: Feature Selection using Rough Sets Theory. In: Brazdil, P.B. (ed.) ECML 1993. LNCS, vol.\u00a0667, pp. 213\u2013226. Springer, Heidelberg (1993)"},{"key":"5_CR16","unstructured":"Nguyen, S.H., Skowron, A., Synak, P., Wr\u00f3blewski, J.: Knowledge Discovery in Databases: Rough Set Approach. In: Proc. of IFSA 1997, vol.\u00a0II, pp. 204\u2013209. Prague (1997)"},{"key":"5_CR17","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, Dordrecht (1991)"},{"key":"5_CR18","unstructured":"Pawlak, Z., Skowron, A.: A Rough Set Approach to Decision Rules Generation, ICS Research Report 23\/93, Warsaw University of Technology (1993)"},{"key":"5_CR19","doi-asserted-by":"crossref","unstructured":"Romanski, S.: Operations on Families of Sets for Exhaustive Search, Given a Monotonic Boolean Function. In: Proc. of Intl\u2019 Conf. on Data and Knowledge Bases, Israel (1988)","DOI":"10.1016\/B978-1-4832-1313-2.50030-5"},{"key":"5_CR20","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1007\/978-94-015-7975-9_21","volume-title":"Intelligent Decision Support: Handbook of Applications and Advances of Rough Sets 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 Rough Sets Theory, pp. 331\u2013362. Kluwer Academic Publishers, Dordrecht (1992)"},{"key":"5_CR21","volume-title":"Rough-Neural Computing. Techniques for Computing with Words","author":"A. Skowron","year":"2004","unstructured":"Skowron, A., Swiniarski, R.W.: Information Granulation and Pattern Recognition. In: Pal, S.K., Polkowski, L., Skowron, A. (eds.) Rough-Neural Computing. Techniques for Computing with Words, Springer, Heidelberg (2004)"},{"key":"5_CR22","unstructured":"Slezak, D.: Approximate Reducts in Decision Tables. In: Proc. of IPMU 1996, Granada, Spain, vol.\u00a03, pp. 1159\u20131164 (1996)"},{"key":"5_CR23","series-title":"Lecture Notes in Artificial Intelligence","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 (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":"5_CR24","unstructured":"Slowi\u0144ski, R. (ed.): Intelligent Decision Support, Handbook of Applications and Advances of the Rough Sets Theory, vol.\u00a011. Kluwer Academic Publishers, Dordrecht (1992)"},{"key":"5_CR25","volume-title":"Rough Sets in Data Mining and Knowledge Discovery","author":"J. Stepaniuk","year":"1998","unstructured":"Stepaniuk, J.: Approximation Spaces, Reducts and Representatives. In: Skowron, A., Polkowski, L. (eds.) Rough Sets in Data Mining and Knowledge Discovery. Springer, Berlin (1998)"},{"key":"5_CR26","volume-title":"Rough Sets in Data Mining and Knowledge Discovery","author":"R. Susmaga","year":"1998","unstructured":"Susmaga, R.: Experiments in Incremental Computation of Reducts. In: Skowron, A., Polkowski, L. (eds.) Rough Sets in Data Mining and Knowledge Discovery. Springer, Berlin (1998)"},{"key":"5_CR27","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"450","DOI":"10.1007\/3-540-69115-4_62","volume-title":"Rough Sets and Current Trends in Computing","author":"R. Susmaga","year":"1998","unstructured":"Susmaga, R.: Parallel Computation of Reducts. In: Polkowski, L., Skowron, A. (eds.) RSCTC 1998. LNCS (LNAI), vol.\u00a01424, pp. 450\u2013457. Springer, Heidelberg (1998)"},{"key":"5_CR28","unstructured":": Computation of Shortest Reducts. Foundations of Computing and Decision Sciences, Poznan, Poland\u00a02(23) (1998)"},{"issue":"23","key":"5_CR29","first-page":"219","volume":"4","author":"R. Susmaga","year":"1998","unstructured":"Susmaga, R.: Effective Tests for Inclusion Minimality in Reduct Generation. Foundations of Computing and Decision Sciences\u00a04(23), 219\u2013240 (1998)","journal-title":"Foundations of Computing and Decision Sciences"},{"key":"5_CR30","unstructured":"Tannh\u00e4user, M.: Efficient Reduct Computation. M.Sc. Thesis, Institute of Mathematics, Warsaw University, Warsaw (1994)"},{"key":"5_CR31","unstructured":"Wroblewski, J.: Finding Minimal Reducts Using Genetic Algorithms. In: Proc. of the 2nd Annual Join Conference on Information Sc., Wrightsville Beach, NC, pp. 186\u2013189 (1995)"}],"container-title":["Lecture Notes in Computer Science","Transactions on Rough Sets I"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-27794-1_5.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T03:25:52Z","timestamp":1620012352000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-27794-1_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540223740","9783540277941"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-27794-1_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}