Bloomy decision tree for multi-objective classification

Einoshin Suzuki, Masafumi Gotoh, Yuta Choki

Research output: Chapter in Book/Report/Conference proceedingConference contribution

22 Citations (Scopus)

Abstract

This paper presents a novel decision-tree induction for a multi-objective data set, i.e. a data set with a multi-dimensional class. Inductive decision-tree learning is one of the frequently-used methods for a single-objective data set, i.e. a data set with a single-dimensional class. However, in a real data analysis, we usually have multiple objectives, and a classifier which explains them simultaneously would be useful and would exhibit higher readability. A conventional decision-tree inducer requires transformation of a multi-dimensional class into a singledimensional class, but such a transformation can considerably worsen both accuracy and readability. In order to circumvent this problem we propose a bloomy decision tree which deals with a multi-dimensional class without such transformations. A bloomy decision tree has a set of split nodes each of which splits examples according to their attribute values, and a set of flower nodes each of which predicts a class dimension of examples. A flower node appears not only at the fringe of a tree but also inside a tree. Our pruning is executed during tree construction, and evaluates each class dimension based on Cramér’s V. The proposed method has been implemented as D3-B (Decision tree in Bloom), and tested with eleven data sets. The experiments showed that D3-B has higher accuracies in nine data sets than C4.5 and tied with it in the other two data sets. In terms of readability, D3-B has a smaller number of split nodes in all data sets, and thus outperforms C4.5.

Original languageEnglish
Title of host publicationPrinciples of Data Mining and Knowledge Discovery - 5th European Conference, PKDD 2001, Proceedings
EditorsLuc De Raedt, Arno Siebes
PublisherSpringer Verlag
Pages436-447
Number of pages12
ISBN (Print)9783540425342
DOIs
Publication statusPublished - 2001
Event5th European Conference on Principles of Data Mining and Knowledge Discovery, PKDD 2001 - Freiburg, Germany
Duration: Sep 3 2001Sep 5 2001

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2168
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other5th European Conference on Principles of Data Mining and Knowledge Discovery, PKDD 2001
CountryGermany
CityFreiburg
Period9/3/019/5/01

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Bloomy decision tree for multi-objective classification'. Together they form a unique fingerprint.

  • Cite this

    Suzuki, E., Gotoh, M., & Choki, Y. (2001). Bloomy decision tree for multi-objective classification. In L. De Raedt, & A. Siebes (Eds.), Principles of Data Mining and Knowledge Discovery - 5th European Conference, PKDD 2001, Proceedings (pp. 436-447). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2168). Springer Verlag. https://doi.org/10.1007/3-540-44794-6_36