Paper
21 March 1989 A New Incremental Learning Technique For Decision Trees With Thresholds
J. Robin, B. Cockett, Yunzhou Zhu
Author Affiliations +
Abstract
This paper presents some basic algorithms for manipulating decision trees with thresholds. The algorithms are based on discrete decision theory. This algebraic approach to discrete decision theory, in particular, provides syntactic techniques for reducing the size of decision trees. If one takes the view that the object of a learning algorithm is to give an economical representation of the observations then this reduction technique provides the key to a method of learning. The basic algorithms to support the incremental learning of decision trees are discussed together with the modifications required to perform reasonable learning when threshold decisions are present. The main algorithm discussed is an incremental learning algorithm which works by maintaining an association irreducible tree representing the observations. At each iteration a new observation is added and an efficient reduction of the tree enlarged by that example is undertaken. The results of some simple experiments are discussed which suggest that this method of learning holds promise and may in some situations out perform standard heuristic techniques.
© (1989) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
J. Robin, B. Cockett, and Yunzhou Zhu "A New Incremental Learning Technique For Decision Trees With Thresholds", Proc. SPIE 1095, Applications of Artificial Intelligence VII, (21 March 1989); https://doi.org/10.1117/12.969329
Lens.org Logo
CITATIONS
Cited by 4 scholarly publications.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Artificial intelligence

Evolutionary algorithms

Data storage

Algorithms

Binary data

Data processing

Databases

RELATED CONTENT

A fast Euler number computing algorithm of a binary image
Proceedings of SPIE (October 29 2018)
Processing heterogeneous XML data from multi-source
Proceedings of SPIE (April 18 2006)
Parametric curve approximation using ICP reparametrization
Proceedings of SPIE (September 25 2001)
Immune algorithm for KDD
Proceedings of SPIE (September 25 2001)
New parallel algorithms for thinning of binary images
Proceedings of SPIE (March 01 1991)
Expert bidder for a pilot's monthly schedule
Proceedings of SPIE (January 01 1990)

Back to Top