Algorithm for constructing tree structured classifiers

Boots – shoes – and leggings

Patent

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

G06F 100

Patent

active

047195711

ABSTRACT:
In assigning features to nodes of a tree structured classifier and determining terminal nodes in response to a training set of objects each being determined by a plurality of features, a selected characteristic, such as a cost function based on the minimum description length, of the plurality of features unused at prior nodes is determined along the path from the root to the present node, a feature is then assigned to the node having a preferred value for the selected characteristic relative to the other features. Child nodes of the node are created in response to the assigned feature with features assigned thereto in a similar way. The preferred values for the selected characteristics of the assigned features for the child nodes of the node are combined and compared with the preferred value of their father node. Classification of the father node as a terminal is based upon such a comparison.

REFERENCES:
patent: 4613946 (1986-09-01), Forman
L. Kanal, (1974): "Patterns in Pattern Recognition," IEEE Trans. on Information Theory, vol. 20, pp. 697-722.
P. M. Narendra & K. Fukunaga, (1977): "A Branch and Bound Algorithm for Feature Subset Selection," IEEE Trans. on Computers, vol. 26, pp. 917-922.
C. Y. Chang, (1973): "Dynamic Programming as Applied to Subset Selection in Pattern Recognition Systems," IEEE Trans. on Systems, Man and Cybernetics, vol. 3, pp. 166-171.
R. M. & J. D. Elashoff, & G. E. Goldman, (1967): "On the Choice of Variables in Classification Problems with Dichotomous Variables," Biometrika, vol. 54, pp. 668-670.
G. T. Toussaint, (1971): "Note on Optimal Selection of Independent Binary-Valued Features for Pattern Recognition," IEEE Trans. on Information Theory, vol. 17, p. 617.
T. M. Cover, (1974): "The Best Two Independent Measurement Are Not the Two Best," IEEE Trans. on Systems, Man and Cybernetics, vol. 4, pp. 116-117.
T. M. Cover & Van Campenhout, J.M.V, (1977): "On the Possible Ordering in the Measurement Selection Problem," IEEE Trans. on Systems, Man and Cybernetics, vol. 7, pp. 657-661.
P. M. Lewis, (1962): "The Characteristic Selection Problem in Recognition Systems," IRE Trans. on Information theory, vol. 8, pp. 171-178.
R. G. & G. Nagy, (1984): "Decision Tree Design Using Probabilistic Model," IEEE Trans. on Information Theory, vol. 30, pp. 191-199.
Gini index, L. Breiman, J. H. Friedman, R. A. Olshen, & C. Stone, (1984): Classification & Regression Trees, Wadsworth International Group, Belmont, CA.
A. Mabbet, M. Stone, and K. Washbrook, (1980): "Cross-Validatory Selection of Binary Variables in Differential Diagnosis," Appl. Statist., vol. 29, pp. 198-204, and Breiman et al (supra, 1984).

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Algorithm for constructing tree structured classifiers does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Algorithm for constructing tree structured classifiers, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Algorithm for constructing tree structured classifiers will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-923838

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.