Abstract
The paper addresses the problem of parallel computing in reduct/construct generation. The reducts are subsets of attributes that may be successfully applied in information/decision table analysis. Constructs, defined in a similar way, represent a notion that is a kind of generalization of the reduct. They ensure both discernibility between pairs of objects belonging to different classes (in which they follow the reducts) as well as similarity between pairs of objects belonging to the same class (which is not the case with reducts). Unfortunately, exhaustive sets of minimal constructs, similarly to sets of minimal reducts, are NP-hard to generate. To speed up the computations, decomposing the original task into multiple subtasks and executing these in parallel is employed. The paper presents a so-called constrained tree-like model of parallelization of this task and illustrates practical behaviour of this algorithm in a computational experiment.
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
Akl, S.G.: The Design and Analysis of Parallel Algorithms. Prentice Hall International, Inc., Eaglewood Cliffs (1989)
Bazan, J., Skowron, A., Synak, P.: Dynamic Reducts as a Tool for Extracting Laws from Decision Tables. In: Raś, Z.W., Zemankova, M. (eds.) ISMIS 1994. LNCS, vol. 869, pp. 346–355. Springer, Heidelberg (1994)
Dash, M., Liu, H.: Feature Selection for Classification. Intelligent Data Analysis (on-line journal)Â 1(3) (1997), http://www-east.elsevier.com/ida
Flinkman, M., Michalowski, W., Nilsson, S., Słowiński, R., Susmaga, R., Wilk, S.: Use of rough sets analysis to classify Siberian forest ecosystem according to net primary production of phytomass. INFOR 38(3), 145–161 (2000)
Kohavi, R., Frasca, B.: Useful Feature Subsets and Rough Set Reducts. In: Proceedings of the Third International Workshop on Rough Sets and Soft Computing, San Jose State University, San Jose (1994)
Murphy, P.M., Aha, D.W.: UCI Repository of Machine Learning Databases. Department of Information and Computer Science, University of California, Irvine (1992), WWW http://www.ics.uci.edu/~mlearn e-mail: ml-repository@ics.uci.edu
Pawlak, Z.: Rough Sets. Theoretical Aspects of Reasoning About Data. Kluwer Academic Publishers, Dordrecht (1991)
Skowron, A., Rauszer, C.: The Discernibility Functions Matrices and Functions in Information Systems. In: Slowinski, R. (ed.) Intelligent Decision Support. Handbook of Applications and Advances of the Rough Set Theory, pp. 331–362. Kluwer Academic Publishers, Dordrecht (1992)
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)
Susmaga, R.: Parallel Computation of Reducts. In: Polkowski, L., Skowron, A. (eds.) Proceedings of the First International Conference on Rough Sets and Current Trends in Computing, Warsaw, pp. 450–457. Springer, Berlin (1998)
Susmaga, R.: Effective Tests for Inclusion Minimality in Reduct Generation. Foundations of Computing and Decision Sciences 23(4), 219–240 (1998)
Susmaga, R.: Tree-Like Parallelization of Reduct and Construct Computation, Research Report RA-009/03, Poznań University of Technology, Poznań (2003)
Tannhäuser, M.: Efficient Reduct Computation (in Polish), M. Sc. Thesis, Institute of Mathematics, Warsaw University, Warsaw (1994)
Wroblewski, J.: Covering with Reducts – A Fast Algorithm for Rule Generation. In: Polkowski, L., Skowron, A. (eds.) Proceedings of the First International Conference on Rough Sets and Current Trends in Computing, Warsaw, pp. 402–407. Springer, Berlin (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Susmaga, R. (2004). Tree-Like Parallelization of Reduct and Construct Computation. In: Tsumoto, S., Słowiński, R., Komorowski, J., Grzymała-Busse, J.W. (eds) Rough Sets and Current Trends in Computing. RSCTC 2004. Lecture Notes in Computer Science(), vol 3066. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-25929-9_54
Download citation
DOI: https://doi.org/10.1007/978-3-540-25929-9_54
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22117-3
Online ISBN: 978-3-540-25929-9
eBook Packages: Springer Book Archive