Skip to main content

Searching for features defined by hyperplanes

  • Communications Session 4B Evolutionary Computation
  • Conference paper
  • First Online:
Foundations of Intelligent Systems (ISMIS 1996)

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

Included in the following conference series:

Abstract

We consider decision tables with real value conditional attributes and we present a method for extraction of features defined by hyperplanes in a multi-dimensional affine space. These new features are often more relevant for object classification than the features defined by hyperplanes parallel to axes. The method generalizes an approach presented in [18] in case of hyperplanes not necessarily parallel to the axes. We propose genetic strategies searching for hyperplanes discerning between objects from different decision classes.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Brown, F.M. (1990). Boolean reasoning, Dordrecht: Kluwer.

    Google Scholar 

  2. Bazan, J., Skowron, A., Synak, P. (1994). Dynamic reducts as tool for extracting laws from decision table, Proc. of the Symp. on Methodologies for Intelligent System, Charllotte, NC, October 16–19, 1994, Lecture Notes in Artificial Intelligence 869, Berlin: Springer-Verlag 1994, 346–355.

    Google Scholar 

  3. Breiman, L., Friedman, J.H., Olshel, R.A. & Stone, C.J. (1984). Classification and Regression Trees. Wadsworth International Group.

    Google Scholar 

  4. 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, Lecture Notes in Artificial Intelligence, Berlin: Springer-Verlag 1991, 164–178.

    Google Scholar 

  5. Chan, C.-C., Bartur, C., & Srinivasasn, A. (1991). Determination of quantization intervals in rule based model for dynamic systems. Proc. of the IEEE Conference on System, Man, and Cybernetics, Charlottesville, VA, October 13–16, 1719–1723.

    Google Scholar 

  6. 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, San Jose, CA, November 1994, 294–301.

    Google Scholar 

  7. Dougherty, J., Kohavi R. & Sahami, M. (1995). Supervised and Unsupervised Discretization of Continuos Features. Proc. of the Twelfth International Conference on Machine Learning, San Francisco: Morgan Kaufmann.

    Google Scholar 

  8. Fayyad, U. M. & Irani, K.B. (1992). On the handling of continuos-valued attributes in decision tree generation. Machine Learning 8, 87–102.

    Google Scholar 

  9. Holland, J.H., Adaptation in Natural and Artificial Systems, (1975) University of MIchigan Press, Ann Arbor.

    Google Scholar 

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

    Google Scholar 

  11. Lenarcik, A. & Piasta, Z. (1994). Deterministic Rough Classifiers. Proc. of the III International Workshop on RSSC94, November 1994, San Jose, CA, 434–441.

    Google Scholar 

  12. Murthy, S., Kasif, S., Saltzberg, S. & Beigel, R. (1993). OC1: Randomized Induction of Oblique Decision Trees. Proc. of the Eleventh National Conference on AI, July 1993,322–327.

    Google Scholar 

  13. Michalewicz, Z. (1992). Genetic Algorithms + Data Structures = Evolution Programs. Berlin: Springer-Verlag.

    Google Scholar 

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

    Google Scholar 

  15. Pao, Y.-H. & Bozma, I. (1986). Quantization of numerical sensor data for inductive learning. In J. S. Kowalik (ed.), Coupling Symbolic and Numerical Computing in Expert System. Amsterdam, The Netherlands: Elsevier Science Publ., 69–81.

    Google Scholar 

  16. Quinlan, J. R. (1993). C4.5: Programs for Machine Learning. San Mateo: Morgan Kaufmann Publishers.

    Google Scholar 

  17. 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, ed. R.Slowiski, Dordrecht: Kluwer 1992, 331–362.

    Google Scholar 

  18. Skowron, A. & Nguyen, H.S. (1995). Quantization of real values attributes. In: Proc. of the Second Joint Annual Conference on Information Sciences, Wrightsville Beach, North Carolina, September 28–October 1 1995, USA.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Zbigniew W. RaÅ› Maciek Michalewicz

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Son, N.H., Hoa, N.S., Skowron, A. (1996). Searching for features defined by hyperplanes. In: RaÅ›, Z.W., Michalewicz, M. (eds) Foundations of Intelligent Systems. ISMIS 1996. Lecture Notes in Computer Science, vol 1079. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61286-6_161

Download citation

  • DOI: https://doi.org/10.1007/3-540-61286-6_161

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-61286-5

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics