References
A. Blumer, A. Ehrenfeucht, D. Haussler, and M. K. Warmuth. Occam's razor. Information Processing Letters, 24:377–380, April 1987.
V. Chvátal. A greedy heuristic for the set-covering problem. Mathematics of the Operation Research, 4(3):233–235, August 1979.
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.
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.
M. F. Liang. Word Hy-phen-a-tion by Com-put-er. PhD thesis, Stanford University, 1983.
J.R. Quinlan. Induction of decision trees. Machine Learning, 1:81–106, 1986.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kivinen, J., Mannila, H., Ukkonen, E., Vilo, J. (1994). An algorithm for learning hierarchical classifiers. In: Bergadano, F., De Raedt, L. (eds) Machine Learning: ECML-94. ECML 1994. Lecture Notes in Computer Science, vol 784. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57868-4_77
Download citation
DOI: https://doi.org/10.1007/3-540-57868-4_77
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57868-0
Online ISBN: 978-3-540-48365-6
eBook Packages: Springer Book Archive