Skip to main content

Part of the book series: Workshops in Computing ((WORKSHOPS COMP.))

Abstract

A Concept lattice is a special kind of lattice, the explicit representation of which can be viewed as a semantic network with special properties. Concept lattices have been applied to Machine Learning as well as to the uncovering of the underlying structure in discrete-valued data. They also embody the cladistic approach to classification. This paper describes how the use of a concept lattice as representation model is related to the rough set approach to data analysis and how operations of rough set theory can be implemented using a concept lattice.

On leave from the University of Pretoria, Pretoria, 0001, South Africa.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. C. Carpineto, G. Romano: GALOIS: An order-theoretic approach to conceptual clustering. Proceedings of the International Machine Learning Conference, Amherst, 1993, pp. 33–40.

    Google Scholar 

  2. R. Godin, R. Missauoui, A. Hassan: Learning Algorithms using a Galois Lattice Structure. Proceedings of 1991 IEEE International Conference on Tools for AI, San Jose, pp.22–29.

    Google Scholar 

  3. J.W. Grzymala-Busse: ESEP An Epert System for Environmental Protection. In this volume.

    Google Scholar 

  4. D.M. Grzymala-Busse, J.W. Grzymala-Busse: Comparison of Machine Learning and Knowledge Acquisition Methods of Rule Induction Based on Rough Sets. In this volume.

    Google Scholar 

  5. H.M. Hoenigswald, L.F. Wiener: Biological Metaphor and Cladistic Classification: An Interdisciplinary Perspective. University of Pensylvania Press, Philadelphia, 1987.

    Google Scholar 

  6. R.E. Kent: Rough Concept Analysis. In this volume.

    Google Scholar 

  7. G.D. Oosthuizen: The Use of a Lattice in Knowledge Processing. Unpublished Ph.D. dissertation, Strathclyde University, Glasgow, 1988.

    Google Scholar 

  8. G.D. Oosthuizen: Lattice-Based Knowledge Discovery. In Proceedings of AAAI-91 Knowledge Discovery in Databases Workshop, Anaheim, 1991, pp. 221–235.

    Google Scholar 

  9. G.D. Oosthuizen, D.R. McGregor: Induction through Knowledge Base Normalisation. In Proceedings of ECAI-88, Pitman Publishing, 1988, pp. 396401.

    Google Scholar 

  10. G.D. Oosthuizen, F.J. Venter: Using A Lattice for Visual Analysis of Categorical Data. In: G. Grinstein, H. Levkowitz (Eds.) Proceedings of IFIP WG5. 10 Workshop on Perceptual Issues in Visualization, Springer-Verlag, 1994.

    Google Scholar 

  11. Z. Pawlak: Rough Sets: Theoretical aspects of Reasoning about Data. Kluwer Academic Publishers, 1991.

    Google Scholar 

  12. J. Pearl: Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan Kaufmann, 1988.

    Google Scholar 

  13. N. Shan, W. Ziarko: An Incremental Learning Algorithm for Constructing Decision Rules, Proceedings of International Conference on Rough Sets and Knowledge discovery Bannf, 1993 ( This volume).

    Google Scholar 

  14. J.F. Sowa: Conceptual Structures: Information Processing in Mind and Machine. Addison-Wesley, 1984.

    Google Scholar 

  15. R. Wille: Restructuring Lattice Theory: An Approach Based on Hierarchies of Concepts. In I.Rival (Ed.) Ordered Sets. Reidel, Dordrecht–Boston, 1982, p. 445–470.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1994 British Computer Society

About this paper

Cite this paper

Oosthuizen, G.D. (1994). Rough Sets and Concept Lattices. In: Ziarko, W.P. (eds) Rough Sets, Fuzzy Sets and Knowledge Discovery. Workshops in Computing. Springer, London. https://doi.org/10.1007/978-1-4471-3238-7_4

Download citation

  • DOI: https://doi.org/10.1007/978-1-4471-3238-7_4

  • Publisher Name: Springer, London

  • Print ISBN: 978-3-540-19885-7

  • Online ISBN: 978-1-4471-3238-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics