Abstract
Calculating reducts is a very important process. Unfortunately, the process of computing all reducts in NP-hard. There are a lot of heuristic solutions for computing reducts, but they do not guarantee achieving complete set of reducts. We propose here three versions of an exact algorithm, designed for parallel processing. We present here how to decompose the problem of calculating reducts, so that parallel calculations are efficient.
The research has been partially supported by grant No 3 T11C 002 29, received from Polish Ministry of Education and Science, and partially supported by grant received from rector of Warsaw University of Technology No 503/G/1032/4200/000.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Pawlak, Z.: Rough sets: Theoretical aspects of reasoning about data. Kluwer, Dordrecht (1991)
Bazan, J., Nguyen, H.S., Nguyen, S.H., Synak, P., Wróblewski, J.: Rough set algorithms in classification problem. In: Polkowski, L., Tsumoto, S., Lin, T. (eds.) Rough Set Methods and Applications, pp. 49–88. Springer, Physica-Verlag, Heidelberg (2000)
Wróblewski, J.: A parallel algorithm for knowledge discovery system. In: PARELEC 1998, pp. 228–230. The Press Syndicate of the Technical University of Bialystok (1998)
Wróblewski, J.: Adaptacyjne Metody Klasyfikacji Obiektów. Ph.D thesis, Uniwersytet Warszawski, Wydziaş Matematyki, Informatyki i Mechaniki (2001)
Bakar, A.A., Sulaiman, M., Othman, M., Selamat, M.: Finding minimal reduct with binary integer programming in datamining. In: Proc. of the IEEE TENCON 2000, vol. 3, pp. 141–146 (2000)
Skowron, A., Rauszer, C.: The discernibility matrices and functions in information systems. In: Slowinski, R. (ed.) Decision Support: Handbook of Applications and Advances of Rough Sets Theory, pp. 331–362. Kluwer, Dordrecht (1992)
Susmaga, R.: Parallel computation of reducts. In: Polkowski, L., Skowron, A. (eds.) Rough Sets and Current Trends in Computing, pp. 450–457. Springer, Heidelberg (1998)
Karbowski, A., Niewiadomska-Szymkiewicz, E. (eds.): Obliczenia równolegşe i rozproszone. Oficyna Wydawnicza Politechniki Warszawskiej (in Polish) (2001)
Asuncion, A., Newman, D.: UCI machine learning repository (2007), http://www.ics.uci.edu/~mlearn/MLRepository.html
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Stra̧kowski, T., Rybiński, H. (2008). A New Approach to Distributed Algorithms for Reduct Calculation. In: Peters, J.F., Skowron, A., Rybiński, H. (eds) Transactions on Rough Sets IX. Lecture Notes in Computer Science, vol 5390. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-89876-4_20
Download citation
DOI: https://doi.org/10.1007/978-3-540-89876-4_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-89875-7
Online ISBN: 978-3-540-89876-4
eBook Packages: Computer ScienceComputer Science (R0)