Learning comprehensible and accurate hybrid trees

被引:4
|
作者
Piltaver, Rok [1 ,2 ]
Lustrek, Mitja [1 ]
Dzeroski, Saso [2 ,3 ]
Gjoreski, Martin [1 ,2 ]
Gams, Matjaz [1 ,2 ]
机构
[1] Jozef Stefan Inst, Dept Intelligent Syst, Jamova Cesta 39, Ljubljana 1000, Slovenia
[2] Jozef Stefan Int Postgrad Sch, Jamova Cesta 39, Ljubljana 1000, Slovenia
[3] Jozef Stefan Inst, Dept Knowledge Technol, Jamova Cesta 39, Ljubljana 1000, Slovenia
关键词
Hybrid tree; Multi-objective learning; Comprehensibility; Accuracy; Classification; NEURAL-NETWORK; ALGORITHM;
D O I
10.1016/j.eswa.2020.113980
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Finding the best classifiers according to different criteria is often performed by a multi-objective machine learning algorithm. This study considers two criteria that are usually treated as the most important when deciding which classifier to apply in practice: comprehensibility and accuracy. A model that offers a broad range of trade-offs between the two criteria is introduced because they conflict; i.e., increasing one decreases the other. The choice of the model is motivated by the fact that domain experts often formalize decisions based on knowledge that can be represented by comprehensible rules and some tacit knowledge. This approach is mimicked by a hybrid tree that consists of comprehensible parts that originate from a regular classification tree and incomprehensible parts that originate from an accurate black-box classifier. An empirical evaluation on 23 UCI datasets shows that the hybrid trees provide trade-offs between the accuracy and comprehensibility that are not possible using traditional machine learning models. A corresponding hybrid-tree comprehensibility metric is also proposed. Furthermore, the paper presents a novel algorithm for learning MAchine LeArning Classifiers with HybrId TrEes (MALACHITE), and it proves that the algorithm finds a complete set of nondominated hybrid trees with regard to their accuracy and comprehensibility. The algorithm is shown to be faster than the well-known multi-objective evolutionary optimization algorithm NSGA-II for trees with moderate size, which is a prerequisite for comprehensibility. On the other hand, the MALACHITE algorithm can generate considerably larger hybrid-trees than a naive exhaustive search algorithm in a reasonable amount of time. In addition, an interactive iterative data mining process based on the algorithm is proposed that enables inspection of the Pareto set of hybrid trees. In each iteration, the domain expert analyzes the current set of nondominated hybrid trees, infers domain relations, and sets the parameters for the next machine learning step accordingly.
引用
收藏
页数:11
相关论文
共 50 条
  • [1] LOTUS: An algorithm for building accurate and comprehensible logistic regression trees
    Chan, KY
    Loh, WY
    [J]. JOURNAL OF COMPUTATIONAL AND GRAPHICAL STATISTICS, 2004, 13 (04) : 826 - 852
  • [2] Machine Learning Explainability Through Comprehensible Decision Trees
    Blanco-Justicia, Alberto
    Domingo-Ferrer, Josep
    [J]. MACHINE LEARNING AND KNOWLEDGE EXTRACTION, CD-MAKE 2019, 2019, 11713 : 15 - 26
  • [3] Selecting accurate and comprehensible regression algorithms through meta learning
    Loterman, Gert
    Mues, Christophe
    [J]. 12TH IEEE INTERNATIONAL CONFERENCE ON DATA MINING WORKSHOPS (ICDMW 2012), 2012, : 953 - 960
  • [4] Creating comprehensible regression modelsInductive learning and optimization of fuzzy regression trees using comprehensible fuzzy predicates
    Mario Drobics
    Johannes Himmelbauer
    [J]. Soft Computing, 2007, 11 : 421 - 438
  • [5] Creating comprehensible regression models - Inductive learning and optimization of fuzzy regression trees using comprehensible fuzzy predicates
    Drobics, Mario
    Himmelbauer, Johannes
    [J]. SOFT COMPUTING, 2007, 11 (05) : 421 - 438
  • [6] Seeing the forest through the trees: Learning a comprehensible model from an ensemble
    Van Assche, Anneleen
    Blockeel, Hendrik
    [J]. MACHINE LEARNING: ECML 2007, PROCEEDINGS, 2007, 4701 : 418 - +
  • [7] Multi-objective learning of accurate and comprehensible classifiers - a case study
    Piltaver, Rok
    Lustrek, Mitja
    Gams, Matjaz
    [J]. STAIRS 2014, 2014, 264 : 220 - 229
  • [8] What makes classification trees comprehensible?
    Piltaver, Rok
    Lustrek, Mitja
    Gams, Matjaz
    Martincic-Ipsic, Sanda
    [J]. EXPERT SYSTEMS WITH APPLICATIONS, 2016, 62 : 333 - 346
  • [9] Evolving Accurate and Comprehensible Classification Rules
    Sonstrod, Cecilia
    Johansson, Ulf
    Konig, Rikard
    [J]. 2011 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2011, : 1436 - 1443
  • [10] Seeing the forest through the trees - Learning a comprehensible model from a first order ensemble
    Van Assche, Anneleen
    Blockeel, Hendrik
    [J]. INDUCTIVE LOGIC PROGRAMMING, 2008, 4894 : 269 - 279