Learning decision trees in continuous space

Two problems of the ID3 and C4.5 decision tree building methods will be mentioned and solutions will be suggested on them. First, in both methods a Gain-type criteria is used to compare the applicability of possible tests, which derives from the entropy function. We are going to propose a new measur...

Full description

Saved in:
Bibliographic Details
Main Authors: Dombi József
Zsiros Ákos
Corporate Author: Conference for PhD Students in Computer Science (2.) (2000) (Szeged)
Format: Article
Published: 2001
Series:Acta cybernetica 15 No. 2
Kulcsszavak:Számítástechnika, Kibernetika
Subjects:
Online Access:http://acta.bibl.u-szeged.hu/12674
LEADER 01918nab a2200241 i 4500
001 acta12674
005 20220614121148.0
008 161015s2001 hu o 0|| eng d
022 |a 0324-721X 
040 |a SZTE Egyetemi Kiadványok Repozitórium  |b hun 
041 |a eng 
100 1 |a Dombi József 
245 1 0 |a Learning decision trees in continuous space  |h [elektronikus dokumentum] /  |c  Dombi József 
260 |c 2001 
300 |a 213-224 
490 0 |a Acta cybernetica  |v 15 No. 2 
520 3 |a Two problems of the ID3 and C4.5 decision tree building methods will be mentioned and solutions will be suggested on them. First, in both methods a Gain-type criteria is used to compare the applicability of possible tests, which derives from the entropy function. We are going to propose a new measure instead of the entropy function, which comes from the measure of fuzziness using a monotone fuzzy operator. It is more natural and much simpler to compute in case of concept learning (when elements belong to only two classes: positive and negative). Second, the well-known extension of the ID3 method for handling continuous attributes (C4.5) is based on discretization of attribute values and in it the decision space is separated with axis-parallel hyperplanes. In our proposed new method (CDT) continuous attributes are handled without discretization, and arbitrary geometric figures are used for separation of decision space, like hyperplanes in general position, spheres and ellipsoids. The power of our new method is going to be demonstrated oh a few examples. 
650 4 |a Természettudományok 
650 4 |a Számítás- és információtudomány 
695 |a Számítástechnika, Kibernetika 
700 0 1 |a Zsiros Ákos  |e aut 
710 |a Conference for PhD Students in Computer Science (2.) (2000) (Szeged) 
856 4 0 |u http://acta.bibl.u-szeged.hu/12674/1/cybernetica_015_numb_002_213-224.pdf  |z Dokumentum-elérés