We present a new classification algorithm that combines three properties: It generates decision trees, which proved a valuable and intelligible tool for classification and generalization of data; it utilizes fuzzy logic, that provides for a fine grained description of classified items adequate for human reasoning; and it is incremental, allowing rapid alternation of classification and learning of new data. The algorithm generalizes known non-incremental algorithms for top down induction of fuzzy decision trees, as well as known incremental algorithms for induction of decision trees in classical logic. The algorithm is shown to be terminating and to yield results equivalent to the non-incremental version.
CITATION STYLE
Guetova, M., Hölldobler, S., & Störr, H. P. (2002). Incremental fuzzy decision trees. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2479, pp. 67–81). Springer Verlag. https://doi.org/10.1007/3-540-45751-8_5
Mendeley helps you to discover research relevant for your work.