Skip to main content

Induction of classification rules from imperfect data

  • Communications Session 1B Learning and Discovery Systems
  • Conference paper
  • First Online:
Book cover 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 present a method for inducing classification rules from imperfect data using an extended version of the rough set model. The salient feature of our method is that it makes use of the statistical information inherent in the information system. Our framework describes the overall induction task in terms of two key subtasks: approximate classification and rule generation.

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. Katzberg, J. and Ziarko, W., “Variable Precision Rough Sets with Asymmetric Bounds,” in Ziarko, W. (ed.), Rough Sets, Fuzzy Sets and Knowledge Discovery, Springer-Verlag, 1994, pp. 167–177.

    Google Scholar 

  2. Michalski, R.S., Carbonell J.G., and Mitchell, T.M. (eds.), Machine Learning: An Artificial Intelligence Approach, vols 1–2. Morgan Kaufmann, San Mateo, California, 1983 and 1986.

    Google Scholar 

  3. Pawlak, Z., Rough Sets: Theoretical Aspects of Reasoning About Data. Kluwer Academic, 1991.

    Google Scholar 

  4. Pawlak Z., and Wong, S.K.M., and Ziarko, W., “Rough Sets: Probabilistic Versus Deterministic Approaches,” International Journal of Man-Machine Studies, 29(1):81–95, 1988.

    Google Scholar 

  5. Quinlan, J. R., “Induction of Decision Trees”, Machine Learning, 1(1):81–106, 1986.

    Google Scholar 

  6. Quinlan, J. R., C4.5 Programs for Machine Learning, Morgan Kaufmann, San Mateo, California, 1992.

    Google Scholar 

  7. Shan, N., Hu, X., Ziarko, W., and Gercone, N., “A Generalized Rough Sets Model,” Proc. of the 3rd Pacific Rim International Conference on Artificial Intelligence, Beijing, China. 1994, pp. 437–443.

    Google Scholar 

  8. Shan, N., Rule Discovery From Data Using Decision Matrices, M.Sc. Thesis, Dept. of Computer Science, University of Regina, 1995.

    Google Scholar 

  9. Wong, S.K.M. and Ziarko, W., A Probabilistic Model of Approximate Classification in Inductive Learning, University of Regina, Technical Report CS-88-01, 1988.

    Google Scholar 

  10. Zhang, J., “Selecting Typical Instances in Instance-Based Learning,” Proc. of the 9th International Workshop on Machine Learning, pp. 474–479, 1992.

    Google Scholar 

  11. Ziarko, W. and Shan, N., “A method for computing all maximally general rules in attribute-value systems,” Computational Intelligence, in press.

    Google Scholar 

  12. Ziarko, W., “Variable Precision Rough Set Model,” Journal of Computer and System Sciences, 46(1):39–59, 1993.

    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

Shan, N., Hamilton, H.J., Cercone, N. (1996). Induction of classification rules from imperfect data. 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_137

Download citation

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

  • 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