Abstract
In this paper, a novel algorithm for learning structured descriptions, ascribable to the category of symbolic techniques, is proposed. It faces the problem directly in the space of the graphs, by defining the proper inference operators, as graph generalization and graph specialization, and obtains general and coherent prototypes with a low computational cost with respect to other symbolic learning systems. The proposed algorithm is tested with reference to a problem of handwritten character recognition from a standard database.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
T. Pavlidis “Structural Pattern Recognition”, Springer, New York, 1977.
P. Frasconi, M. Gori and A. Sperduti, “A general framework for adaptive processing of data structures, IEEE Trans. on Neural Networks, vol. 9, n. 5, pp. 768–785, 1998.
G.E. Hinton, “Mapping part-whole hierarchies into connectionist networks”, Artificial Intelligence, vol. 46, pp. 47–75, 1990.
D.S. Touretzky, “Dynamic symbol structures in a connectionist network”, In Artificial Intelligence, vol. 42, n. 3, pp. 5–46, 1990.
P.H. Winston, “Learning Structural Descriptions from Examples”, Tech. Report MACTR-76, Dep. of Electrical Engineering and Computer Science-MIT, 1970.
N. Lavrac, S. Dzerosky, “Inductive Logic Programming: Techniques and Applications”, Ellis Horwood, 1994.
A. Pearce, T. Caelly, and W. F. Bischof, “Rulegraphs for graph matching in pattern recognition”, Pattern Recognition, vol. 27, n. 9, pp. 1231–1247, 1994.
T.G. Dietterich and R.S. Michalski, “A comparative review of selected methods for learning from examples”, In R.S. Michalski et al. eds., Machine Learning: An Artificial Intelligence Approach, vol. 1, chap. 3, pp. 41–82. Morgan Kaufmann, 1983.
J. Rocha and T. Pavlidis, “A shape analysis model with applications to a character recognition system”, IEEE Trans. on PAMI, vol. 16, n. 4, pp. 393–404, 1994.
H. Nishida, “Shape recognition by integrating structural descriptions and geometrical/ statistical transforms”, Computer Vision and Image Understanding, vol. 64, pp. 248–262, 1996.
R.S. Michalski, “Pattern recognition as rule-guided inductive inference”, IEEE Trans. on Pattern Analysis and Machine Intelligence, vol. 2, n. 4, pp. 349–361, July 1980.
L.P. Cordella, P. Foggia, R. Genna and M. Vento, “Prototyping Structural Descriptions: an Inductive Learning Approach”, Advances in Pattern Recognition, Lecture Notes in Computer Science, n. 1451, pp. 339–348, Springer-Verlag, 1998.
J.R. Quinlan, “Learning Logical Definitions from Relations”, Machine Learning, vol. 5, n. 3, pp. 239–266, 1993.
P.J. Grother, NIST Special Database 19, Technical Report, National Institute of Standards and Technology, 1995.
A. Chianese, L.P. Cordella, M. De Santo and M. Vento, “Decomposition of ribbon-like shapes”, Proc. 6th Scandinavian Conference on Image Analysis, pp. 416–423, 1989.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cordella, L.P., Foggia, P., Sansone, C., Tortorella, F., Vento, M. (2001). Prototyping Structural Shape Descriptions by Inductive Learning. In: Arcelli, C., Cordella, L.P., di Baja, G.S. (eds) Visual Form 2001. IWVF 2001. Lecture Notes in Computer Science, vol 2059. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45129-3_44
Download citation
DOI: https://doi.org/10.1007/3-540-45129-3_44
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42120-7
Online ISBN: 978-3-540-45129-7
eBook Packages: Springer Book Archive