Abstract
The paper is related to one of the aspects of learning from examples, namely learning how to identify a class of objects a given object instance belongs to. In the paper a method of generating sequence of features allowing such identification is presented. In this approach examples are represented in the form of attribute-value table with binary values of attributes. The main assumption is that one feature sequence is determined for all possible object instances, that is next feature in the order does not depend on values of the previous features. The algorithm is given generating a sequence under these conditions. Theoretical background of the proposed method is rough sets theory. Some generalizations of this theory are introduced in the paper. Finally, a discussion of the presented approach is provided and results of functioning of the proposed algorithm are summarized. Direction of further research is also indicated.
Chapter PDF
Similar content being viewed by others
References
Hyafil L., Rivest R.L., Constructing optimal binary decision trees is NP-complete, Information Processing Letters, Vol. 5, No. 1,May 1976, pp. 15–17.
Hong J., Mozetic I., Michalski R.S., AQ-15: Incremental Learning of Attribute-Based Descriptions from Examples, The Method and User's Guide, Report ISG 86-5, UIUCDCS-F-86-949, Dept of Computer Science, University of Illinois, Urbana, 1986.
Michalski R.S., Inferential Learning Theory: A Conceptual Framework for Characterizing Learning Processes, Report P91-13 MLI 91-6, Center for Artificial Intelligence, George Mason University, Fairfax, 1991.
Pawlak Z., Rough Sets, International Journal of Computer and Information Sciences, Vol. 11, No. 5, 1982, pp. 341–356.
Pawlak Z., Rough Sets, Theoretical Aspects of Reasoning about Data, Kluwer Academic Publishers, 1991.
Quinlan R., Discovering rules from large collection of examples, in D. Mitchie (editor), Expert systems in the microelectronic age, Edinburgh University Press, Edinburgh 1979.
Skowron A., Rauszer C., The Discernibility Matrices and Functions in Information Systems, ICS WUT Research Report 1/91, Warsaw, 1991.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Modrzejewski, M. (1993). Feature selection using rough sets theory. In: Brazdil, P.B. (eds) Machine Learning: ECML-93. ECML 1993. Lecture Notes in Computer Science, vol 667. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56602-3_138
Download citation
DOI: https://doi.org/10.1007/3-540-56602-3_138
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56602-1
Online ISBN: 978-3-540-47597-2
eBook Packages: Springer Book Archive