Feature selection using rough sets theory

  • Maciej Modrzejewski
Research Papers Inductive Learning
Part of the Lecture Notes in Computer Science book series (LNCS, volume 667)


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.


  1. [HyRi76]
    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.Google Scholar
  2. [HoMM86]
    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.Google Scholar
  3. [Mich91]
    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.Google Scholar
  4. [Pawl82]
    Pawlak Z., Rough Sets, International Journal of Computer and Information Sciences, Vol. 11, No. 5, 1982, pp. 341–356.Google Scholar
  5. [Pawl91]
    Pawlak Z., Rough Sets, Theoretical Aspects of Reasoning about Data, Kluwer Academic Publishers, 1991.Google Scholar
  6. [Quin79]
    Quinlan R., Discovering rules from large collection of examples, in D. Mitchie (editor), Expert systems in the microelectronic age, Edinburgh University Press, Edinburgh 1979.Google Scholar
  7. [SkRa91]
    Skowron A., Rauszer C., The Discernibility Matrices and Functions in Information Systems, ICS WUT Research Report 1/91, Warsaw, 1991.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1993

Authors and Affiliations

  • Maciej Modrzejewski
    • 1
  1. 1.Institute of Computer ScienceWUTWarsawPoland

Personalised recommendations