Skip to main content
Springer Nature Link
Log in

Structured Features from Concept Lattices for Unsupervised Learning and Classification

  • Conference paper
  • First Online:
AI 2002: Advances in Artificial Intelligence (AI 2002)

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

Included in the following conference series:

  • 1200 Accesses

Abstract

We present a method for identifying potentially interesting and useful concepts in a concept lattice and revising the underlying formal context and the lattice it generates to invent new descriptors and extract their definitions. This allows the re-use of concepts in an incremental way. The approach is developed using formal concept analysis and inverse resolution operators for both a theory and its lattice. A consequence of using the concept lattice to represent the concept space is that both unsupervised and supervised approaches are enabled by using different concept evaluation measures. Results are given from experiments in two standard domains with a system called Conduce which implements the method.

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

Access this chapter

Log in via an institution

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.L. Blake and C.J. Merz. UCI repository of machine learning databases, 1998.

    Google Scholar 

  2. C. Carpineto and G. Romano. GALOIS: An order-theoretic approach to conceptual clustering. In Proc. 10th Intl. Conf. on Machine Learning, pages 33–40, Los Altos, CA, 1993. Morgan Kaufmann.

    Google Scholar 

  3. B. Ganter and R Wille. Formal Concept Analysis: Mathematical Foundations. Springer, Berlin, 1999.

    MATH  Google Scholar 

  4. R. Godin and R. Missaoui. An incremental concept formation approach for learning from databases. Theoretical Computer Science, 133:387–419, 1994.

    Article  MATH  MathSciNet  Google Scholar 

  5. J. Hereth, G. Stumme, R. Wille, and U. Wille. Conceptual Knowledge Discovery and Data Analysis. In B. Ganter and G. Mineau, editors, ICCS2000: Proc. of the Eighth Intl. Conference on Conceptual Structures, volume LNCS 1867, pages 421–437, Berlin, 2000. Springer.

    Google Scholar 

  6. T. Mitchell. Machine Learning. McGraw-Hill, New York, 1997.

    MATH  Google Scholar 

  7. S. Muggleton. Duce, an oracle-based approach to constructive induction. In IJCAI-87, pages 287–292. Kaufmann, 1987.

    Google Scholar 

  8. S. Muggleton. Inverse Entailment and Progol. New Generation Computing, 13:245–286, 1995.

    Article  Google Scholar 

  9. J. A. Robinson. A machine-oriented logic based on the resolution principle. JACM, 12(1):23–41, January 1965.

    Article  MATH  Google Scholar 

  10. A. D. Shapiro. Structured Induction in Expert Systems. Turing Institute Press with Addison Wesley, Wokingham, UK, 1987.

    MATH  Google Scholar 

  11. Z. Zheng. Constructing New Attributes for Decision Tree Learning. PhD thesis, University of Sydney, Sydney, Australia, 1996.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computer Science and Engineering, University of New South Wales, 2052, Sydney, Australia

    Michael Bain

Authors
  1. Michael Bain
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Australian Defence Force Academy, University of New South Wales, ACT 2600, Canberra, Australia

    Bob McKay

  2. Computer Science Laboratory, Australian National University, RSISE Building, ACT 0200, Canberra, Australia

    John Slaney

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bain, M. (2002). Structured Features from Concept Lattices for Unsupervised Learning and Classification. In: McKay, B., Slaney, J. (eds) AI 2002: Advances in Artificial Intelligence. AI 2002. Lecture Notes in Computer Science(), vol 2557. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36187-1_49

Download citation

  • DOI: https://doi.org/10.1007/3-540-36187-1_49

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-00197-3

  • Online ISBN: 978-3-540-36187-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation