Skip to main content

Automatic Classification with Classifying Automata

  • Chapter
  • 979 Accesses

Abstract

Traditionally, finite automata are used to transform their input or to recognize regular languages. In the second case the automaton decides whether a given input word belongs to the language recognized by this automaton. In the following, we will present an extended automata model, which we developed to construct and efficiently handle representations of dialog-controlled rule systems and to discover inconsistencies within their knowledge bases. Theseclassifying automatado not only accept one language but, instead, deal with a set of regular languages.

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   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.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

  • BOCK, H.H. (1974):Automatische Klassifikation. Vandenhoeck & Ruprecht, Göttingen.

    Google Scholar 

  • GAUL, W. and SCHADER, M. (Eds.) (1994):Wissensbasierte Marketing-Datenanalyse. Peter Lang, Frankfurt am Main.

    Google Scholar 

  • GROSCHE, G. and ZIEGLER, V. (Eds.) (1979):Ergänzende Kapitel zu Taschenbuch der Mathematik. BSB B.G. Teubner, Leipzig.

    Google Scholar 

  • HOPCROFT, J.E. and ULLMAN, J.D. (1979):Introduction to Automata Theory Languages and Computation. Addison-Wesley, Reading, Massachusetts.

    Google Scholar 

  • KIEL, R. (1994): Die Erzeugung von Analysevorschlägen durch die wissensbasierte Systemkomponente. In: W. Gaul and M. Sehader (Eds.):Wissensbasierte Marketing-DatenanalysePeter Lang, Frankfut am Main, 157–186.

    Google Scholar 

  • KIEL, R. (2000a):Dialog-gesteuerte Regelsysteme-Definition, Eigenschaften und Anwendungen. Verlag Dr. Kovac, Hamburg.

    Google Scholar 

  • KIEL, R. (2000b):Klassifizierende Automaten. Diskussionspapier 4/2000, Lehrstuhl für Wirtschaftsinformatik III, Universität Mannheim.

    Google Scholar 

  • KIEL, R. and SCHADER, M. (1991)Detecting Inconsistencies in Dialog-Controlled Rule Systems. In: G.H. Schildt and J. Retti (Eds.):Dependability of Artificial Intelligence Systems. North Holland, Amsterdam, 141–152.

    Google Scholar 

  • KIEL, R. and SCHADER, M. (1995): The Design of an Interpreter for Dialog-Controlled Rrule Systems. In: H.H. Bock and W. Polasek (Eds.):Data Analysis and Information Systems. Springer, Heidelberg.

    Google Scholar 

  • KIEL, R. and SCHADER, M. (1997): Consistent Completion of Incomplete Data Objects. In: R. Klar and O. Opitz (Eds.):Classification and Knowledge Organization. Springer, Heidelberg, 280–288.

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin · Heidelberg

About this chapter

Cite this chapter

Kiel, R., Schader, M. (2000). Automatic Classification with Classifying Automata. In: Gaul, W., Opitz, O., Schader, M. (eds) Data Analysis. Studies in Classification, Data Analysis, and Knowledge Organization. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-58250-9_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-58250-9_3

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-67731-4

  • Online ISBN: 978-3-642-58250-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics