Skip to main content

The Cruncher: Automatic Concept Formation Using Minimum Description Length

  • Conference paper

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

Abstract

We present The Cruncher, a simple representation framework and algorithm based on minimum description length for automatically forming an ontology of concepts from attribute-value data sets. Although unsupervised, when The Cruncher is applied to an animal data set, it produces a nearly zoologically accurate categorization. We demonstrate The Cruncher’s utility for finding useful macro-actions in Reinforcement Learning, and for learning models from uninterpreted sensor data. We discuss advantages The Cruncher has over concept lattices and hierarchical clustering.

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

Buying options

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Blake, C.L., Merz, C.J.: UCI repository of machine learning databases (1998)

    Google Scholar 

  2. Cohen, P.R., Heeringa, B., Adams, N.: An Unsupervised Algorithm for Segmenting Categorical Time Series into Episodes. In: Proceedings of the 2002 IEEE International Conference on Data Mining (ICDM 2002), pp. 99–106 (2002), icdm2002.pdf

  3. Cole, R.: Automated layout of concept lattices using layered diagrams and additive diagrams. In: ACSC 2001: Proceedings of the 24th Australasian conference on Computer science, pp. 47–53. IEEE Computer Society, Los Alamitos (2001)

    Chapter  Google Scholar 

  4. Fasulo, D.: An analysis of recent work on clustering algorithms (1999)

    Google Scholar 

  5. Ganter, B., Wille, R.: Formal Concept Analysis: Mathematical Foundations. Springer, New York (1999)

    MATH  Google Scholar 

  6. Gruber, T.R.: Towards Principles for the Design of Ontologies Used for Knowledge Sharing. In: Guarino, N., Poli, R. (eds.) Formal Ontology in Conceptual Analysis and Knowledge Representation, Deventer, The Netherlands. Kluwer Academic Publishers, Dordrecht (1993)

    Google Scholar 

  7. Pickett, M., Barto, A.: Policyblocks: An algorithm for creating useful macro-actions in reinforcement learning. In: Proceedings of the International Conference on Machine Learning (2002)

    Google Scholar 

  8. Pierce, D., Kuipers, B.: Map learning with uninterpreted sensors and effectors. Artificial Intelligence 92, 169–229 (1997)

    Article  MATH  Google Scholar 

  9. Wolff, J.G.: Information compression by multiple alignment, unification and search as a unifying principle in computing and cognition. Artif. Intell. Rev. 19(3), 193–230 (2003)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Pickett, M., Oates, T. (2005). The Cruncher: Automatic Concept Formation Using Minimum Description Length. In: Zucker, JD., Saitta, L. (eds) Abstraction, Reformulation and Approximation. SARA 2005. Lecture Notes in Computer Science(), vol 3607. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11527862_21

Download citation

  • DOI: https://doi.org/10.1007/11527862_21

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-27872-6

  • Online ISBN: 978-3-540-31882-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics