Abstract
The possibility and advantage of applying a method of managing evidential reasoning to decision tree classifyer is discussed. Relative algorithms are proposed and some experiments have been conducted. Results are very good.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
J. Pearl, "Research note on Evidential Reasoning in a Hierarchy of Hypotheses", Artifial Intelligenc AI-28, pp9–15, 1986
Q.R. Wang and C.Y. Suen, "Analysis and Design of a Decition Tree Based on Entropy Reduction and Its Application to Large Character Set Recognition", IEEE Tr.Vol PAMI-6, pp406–417, 1984
M. Ben-Bassat and L. Zaidenberg, "Contextual Template Matching: A Distance Measure for Patterns with Hierarchically Dependent Features", IEEE Tr.Vol PAMI-6, pp201–211, 1984
Q.R. Wang and C.Y. Suen, "Large Tree Classifier with Heuristic Search and Global Training", IEEE Tr.Vol PAMI-9, pp91–103, 1987
A.V.Kulkarni and L.N.Kanal, "Admissible Search Strategies for Parametric and Nonparametric Hierarchical Classification", in proc. of 4th IJCPR, Japan, Nov. 1978
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1988 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Liu, L., He, Bk. (1988). Application of a method of managing evidential reasoning to decision tree classifier. In: Kittler, J. (eds) Pattern Recognition. PAR 1988. Lecture Notes in Computer Science, vol 301. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-19036-8_53
Download citation
DOI: https://doi.org/10.1007/3-540-19036-8_53
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-19036-3
Online ISBN: 978-3-540-38947-7
eBook Packages: Springer Book Archive