Advertisement

An algorithm for learning hierarchical classifiers

  • Jyrki Kivinen
  • Heikki Mannila
  • Esko Ukkonen
  • Jaak Vilo
Extended Abstracts
Part of the Lecture Notes in Computer Science book series (LNCS, volume 784)

References

  1. 1.
    A. Blumer, A. Ehrenfeucht, D. Haussler, and M. K. Warmuth. Occam's razor. Information Processing Letters, 24:377–380, April 1987.MathSciNetGoogle Scholar
  2. 2.
    V. Chvátal. A greedy heuristic for the set-covering problem. Mathematics of the Operation Research, 4(3):233–235, August 1979.Google Scholar
  3. 3.
    R. Kankkunen, H. Mannila, M. Rantamäki, and E. Ukkonen. Experience in inductive inference of a hyphenation algorithm for Finnish. In Proceedings of the Finnish Artificial Intelligence Symposium (STEP'90), pages 183–193. Oulu, Finland, 1990.Google Scholar
  4. 4.
    J. Kivinen, H. Mannila, and E. Ukkonen. Learning hierarchical rule sets. In Proc. of the 5th Annual ACM Workshop on Computational Learning Theory., pages 37–44. Pittsburgh, Pennsylvania, July 27–29 1992.Google Scholar
  5. 5.
    M. F. Liang. Word Hy-phen-a-tion by Com-put-er. PhD thesis, Stanford University, 1983.Google Scholar
  6. 6.
    J.R. Quinlan. Induction of decision trees. Machine Learning, 1:81–106, 1986.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1994

Authors and Affiliations

  • Jyrki Kivinen
    • 1
  • Heikki Mannila
    • 1
  • Esko Ukkonen
    • 1
  • Jaak Vilo
    • 1
  1. 1.Department of Computer ScienceUniversity of HelsinkiFinland

Personalised recommendations