DocumentCode
3373683
Title
HOT: heuristics for oblique trees
Author
Iyengar, Vijay S.
Author_Institution
IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA
fYear
1999
fDate
1999
Firstpage
91
Lastpage
98
Abstract
This paper presents a new method (HOT) of generating oblique decision trees. Oblique trees have been shown to be useful tools for classification in some problem domains, producing accurate and intuitive solutions. The method can be incorporated into a variety of existing decision tree tools and the paper illustrates this with two very distinct tree generators. The key idea is a method of learning oblique vectors and using the corresponding families of hyperplanes orthogonal to these vectors to separate regions with distinct dominant classes. Experimental results indicate that the learnt oblique hyperplanes lead to compact and accurate oblique trees. HOT is simple and easy to incorporate into most decision tree packages, yet its results compare well with much more complex schemes for generating oblique trees
Keywords
decision trees; heuristic programming; learning (artificial intelligence); HOT method; classification; experimental results; hyperplanes; learning; oblique decision trees; oblique tree heuristics; oblique vectors; tree generators; vectors; Classification tree analysis; Data mining; Decision trees; Reactive power; Scalability; Testing;
fLanguage
English
Publisher
ieee
Conference_Titel
Tools with Artificial Intelligence, 1999. Proceedings. 11th IEEE International Conference on
Conference_Location
Chicago, IL
ISSN
1082-3409
Print_ISBN
0-7695-0456-6
Type
conf
DOI
10.1109/TAI.1999.809771
Filename
809771
Link To Document