Attribute discovery and rough sets

  • Jaroslaw Stepaniuk
Parallel Session 3a
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1263)


Most knowledge discovery methods assume that the original representation space is adequate, that is, the initial attributes are sufficiently relevant to the problem at hand. In real-world applications discovery of new attributes and selection of relevant attributes are applied frequently in data pre-processing. In the paper we discuss rough set based approach to attribute discovery. We consider discovery of adequate attributes for structural objects. We present two algorithms for extracting new attributes.


  1. [1]
    J.G. Bazan, H.S. Nguyen, T.T. Nguyen, A. Skowron, J. Stepaniuk (1995) Application of Modal Logics and Rough Sets for Classifying Objects, Proceedings of the Second World Conference on Fundamentals of Artificial Intelligence (eds.) M. de Glas, Z.Pawlak, Paris, July 3–7 1995, pp. 15–26.Google Scholar
  2. [2]
    I. Düntsch, G. Gediga (1996) Statistical Evaluation of Rough Set Dependency Analysis, International Journal of Human-Computer Studies, to appear.Google Scholar
  3. [3]
    J. van Leeuwen (ed.) (1990) Handbook of Theoretical Computer Science, Elsevier Science Publishers B.V. 1990.Google Scholar
  4. [4]
    C.J. Matheus, L.A. Randell (1989) Constructive Induction on Decision Trees, Proceedings of the Eleventh International Joint Conference on Artificial Intelligence, 1989, pp. 645–650.Google Scholar
  5. [5]
    R.S. Michalski (1983) A Theory and Methodology of Inductive Learning: Developing Foundations for Multistrategy Learning, in Machine Learning: An Artificial Intelligence Approach, vol. 1 (eds.) R.S. Michalski, J.G. Carbonell, T.M. Mitchell, Palo Alto, CA: Morgan Kaufmann, 1983.Google Scholar
  6. [6]
    R.S. Michalski, J. Wnek (1993) Constructive Induction: An Automated Improvement of Knowledge Representation Spaces for Machine Learning, Proceedings of the Second International Workshop on Intelligent Information Systems, Augustow, Poland, 7–11 June, 1993, pp. 188–236.Google Scholar
  7. [7]
    G. L. Miller (1979) Graph Isomorphism, General Remarks, Journal of Computer and System Sciences 18, 1979, pp. 128–142.CrossRefGoogle Scholar
  8. [8]
    D. Monk (1976) Mathematical Logic, Springer Verlag, 1976.Google Scholar
  9. [9]
    S. Muggleton (1987) DUCE, an Oracle-Based Approach to Constructive Induction, Proceedings of the Tenth International Joint Conference on Artificial Intelligence, Morgan Kaufmann, 1987, pp. 287–292.Google Scholar
  10. [10]
    Z. Pawlak (1991) Rough Sets. Theoretical Aspects of Reasoning about Data, Kluwer, Dordrecht, 1991.Google Scholar
  11. [11]
    A. Skowron, L. Polkowski, J. Komorowski (1996) Learning Tolerance Relations by Boolean Descriptors: Feature Extraction from Data Tables, Proceedings of the Fourth International Workshop on Rough Sets, Fuzzy Sets, and Machine Discovery, November 6–8, 1996, pp. 11–17.Google Scholar
  12. [12]
    A. Skowron, J. Stepaniuk (1991) Searching for Classifiers, Proceedings of the First World Conference on Foundations of Artificial Intelligence (eds.) M. de Glas, D. Gabbay, Paris, July 1–5 1991, pp. 447–460.Google Scholar
  13. [13]
    A. Skowron, J. Stepaniuk (1991a) Towards an Approximation Theory of Discrete Problems, Fundamenta Informaticae 15(2), 1991, pp. 187–208.Google Scholar
  14. [14]
    R. Slowinski (1992) (ed.) Intelligent Decision Support Handbook of Applications and Advances of the Rough Sets Theory, Kluwer Academic Publishers, 1992.Google Scholar
  15. [15]
    J. Stepaniuk (1996) Similarity Based Rough Sets and Learning, Proceedings of the Fourth International Workshop on Rough Sets, Fuzzy Sets, and Machine Discovery, November 6–8, 1996, Tokyo, Japan, pp. 18–22.Google Scholar
  16. [16]
    J. Zhang, H.H. Lu (1994) A Data-Driven Approach to Feature Construction, Proceedings of the Eighth International Symposium on Methodologies for Intelligent Systems, Lecture Notes in Artificial Intelligence 869, Springer Verlag 1994, pp. 448–457.Google Scholar
  17. [17]
    W. Ziarko (1994) (ed.) Rough Sets, Fuzzy Sets and Knowledge Discovery, Springer-Verlag 1994.Google Scholar
  18. [18]
    J.M. Zytkow (1996) Automated Discovery of Empirical Laws, Fundamenta Informaticae, 27(2–3), 1996, pp. 299–318.MathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1997

Authors and Affiliations

  • Jaroslaw Stepaniuk
    • 1
  1. 1.Institute of Computer ScienceBialystok University of TechnologyBialystokPoland

Personalised recommendations