Skip to main content
SpringerLink
Log in
Book cover

International Symposium on Methodologies for Intelligent Systems

ISMIS 1997: Foundations of Intelligent Systems pp 117–126Cite as

Boolean reasoning for feature extraction problems

  • Communications Session 1B Learning and Discovery Systems
  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 1325))

Abstract

We recall several applications of Boolean reasoning for feature extraction and we propose an approach based on Boolean reasoning for new feature extraction from data tables with symbolic (nominal, qualitative) attributes. New features are of the form a E V, where V ⊆ V a and V a is the set of values of attribute a. We emphasize that Boolean reasoning is also a good framework for complexity analysis of the approximate solutions of the discussed problems.

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Almuallim H., Dietterich T.G. (1994). Learning Boolean Concepts in The Presence of Many Irrelevant Features. Artificial Intelligence, 69(1-2), pp. 279–305.

    Google Scholar 

  2. Brown F.M., Boolean reasoning, Kluwer, Dordrecht 1990.

    Google Scholar 

  3. Catlett J. (1991). On changing continuos attributes into ordered discrete attributes. In Y. Kodratoff, (ed.), Machine Learning-EWSL-91, Proc. of the European Working Session on Learning, Porto, Portugal, March 1991, LNAI, pp. 164–178.

    Google Scholar 

  4. Chmielewski M. R., Grzymala-Busse J. W. (1994). Global Discretization of Attributes as Preprocessing for Machine Learning. Proc. of the III International Workshop on RSSC94 November 1994, pp. 294–301.

    Google Scholar 

  5. Dougherty J., Kohavi R., Sahami M. (1995). Supervised and Unsupervised Discretization of Continuous Features, Proceedings of the Twelfth International Conference on Machine Learning, Morgan Kaufmann, San Francisco, CA, pp. 194–202.

    Google Scholar 

  6. Fayyad U. M., Irani K.B. (1992). The attribute selection problem in decision tree generation. Proc. of AAAI-92, July 1992, San Jose, CAMIT Press, pp. 104–110.

    Google Scholar 

  7. Heath D., Kasif S., Salzberg S. (1993). Induction of Oblique Decision Trees. Proc. 13th International Joint Conf, on AI. Chambery, France, pp. 1002–1007.

    Google Scholar 

  8. Holt R.C. (1993), Very simple classification rules perform well on most commonly used datasets, Machine Learning 11, pp. 63–90.

    Google Scholar 

  9. John G., Kohavi R., Pfleger K. (1994). Irrelevant features and subset selection problem. Proceedings of the Twelfth International Conference on Machine Learning, Morgan Kaufmann, pp. 121–129.

    Google Scholar 

  10. Kerber R. (1992), Chimerge: Discretization of numeric attributes. Proc. of the Tenth National Conference on Artificial Intelligence, MIT Press, pp. 123–128.

    Google Scholar 

  11. Kodratoff Y., Michalski R.(1990): Machine learning: An Artificial Intelligence approach, vol.3, Morgan Kaufmann, 1990.

    Google Scholar 

  12. Nguyen H.S., Skowron A. (1995). Quantization of real values attributes, Rough set and Boolean Reasoning Approaches. Proc. of the Second Joint Annual Conference on Information Sciences, Wrightsville Beach, NC, 1995, USA, pp.34–37.

    Google Scholar 

  13. Nguyen H.S., Nguyen S.H., Skowron A. (1996). Searching for Features defined by Hyperplanes. in: Z. W. Rás, M. Michalewicz (eds.), Proc. of the IX International Symposium on Methodologies for Information Systems ISMIS'96, June 1996, Zakopane, Poland. Lecture Notes in AI 1079, Berlin, Springer Verlag, pp.366–375.

    Google Scholar 

  14. Nguyen S. H., Nguyen H. S.(1996), Some Efficient Algorithms for Rough Set Methods. Proc. of the Conference of Information Processing and Management of Uncertainty in Ifnowledge-Based Systems, 1996, Granada, Spain, pp. 1451–1456.

    Google Scholar 

  15. Pawlak Z. (1991): Rough sets: Theoretical aspects of reasoning about data, Kluwer Dordrecht.

    Google Scholar 

  16. Skowron A., Rauszer C. (1992), The Discernibility Matrices and Functions in Information Systems. In: Intelligent Decision Support-Handbook of Applications and Advances of the Rough Sets Theory, Slowiński R.(ed.), Kluwer Dordrecht 1992, 331–362.

    Google Scholar 

  17. Skowron A., Polkowski L., Synthesis of Decision Systems from Data Tables. In T.Y Lin & N. Cercone(eds.), Rough Sets and Data Mining, Analysis of Imprecise Data. Kluwer, Dordrecht, pp. 259–300.

    Google Scholar 

  18. Wegener I. (1987). The Complexity of Boolean Functions. Stuttgart: John Wiley & Sons.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Mathematics, Warsaw University, Banacha 2, Poland, Warsaw

    Hung Son Nguyen & Andrzej Skowron

Authors
  1. Hung Son Nguyen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Andrzej Skowron
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Zbigniew W. Raś Andrzej Skowron

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Nguyen, H.S., Skowron, A. (1997). Boolean reasoning for feature extraction problems. In: Raś, Z.W., Skowron, A. (eds) Foundations of Intelligent Systems. ISMIS 1997. Lecture Notes in Computer Science, vol 1325. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63614-5_11

Download citation

  • DOI: https://doi.org/10.1007/3-540-63614-5_11

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63614-4

  • Online ISBN: 978-3-540-69612-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation