ScholarMate
English简体中文繁體中文
客服热线:400-1616-289
登录注册
期刊论文

Learning comprehensible and accurate hybrid trees

Piltaver, Rok; Lustrek, Mitja; Dzeroski, Saso; Gjoreski, Martin*; Gams, Matjaz
EXPERT SYSTEMS WITH APPLICATIONS2021-2DOI: 10.1016/j.eswa.2020.113980
4被引1阅读
引用收藏
分享

摘要

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.

学科与关键词

关键词
Hybrid treeMulti-objective learningComprehensibilityAccuracyClassification
相关
加载中…
  • The non-linear nature of the cost of comprehensibility
    Goethals, Sofie*; Martens, David; Evgeniou, TheodorosJOURNAL OF BIG DATA, 2022, 9(1): 30.被引 7
  • An empirical evaluation of the comprehensibility of decision table, tree and rule based predictive models
    Huysmans, Johan; Dejaeger, Karel; Mues, Christophe; Vanthienen, Jan; Baesens, Bart*DECISION SUPPORT SYSTEMS, 2011, 51(1): 141-154.被引 253
  • Classification rule mining based on Pareto-based Multiobjective Optimization
    Sag, Tahir*; Kahramanli Ornek, HumarAPPLIED SOFT COMPUTING, 2022, 127: 109321.被引 4
查看全部 →

发表信息

论文状态
公开发表
期刊
EXPERT SYSTEMS WITH APPLICATIONS
发表日期
2021-02
卷期
第 164 卷
页码
113980
DOI
10.1016/j.eswa.2020.113980
语言
ENGLISH
期刊收录
NSL
期刊等级
1区
成果收录
SCIE
资助标注
Slovenian Research Agency (ARRS) [U2-AG-16/0672]

作者

  • P

    Piltaver, Rok (第一作者)

  • L

    Lustrek, Mitja

查看全部 5 位作者收起作者
  • D

    Dzeroski, Saso

  • G

    Gjoreski, Martin (通讯)

  • G

    Gams, Matjaz

登录解锁更多功能

  • 收藏这篇,随时在“我的 · 收藏”找回
  • 认领你的成果,生成推广素材
  • 关注作者获取最新成果
  • 加入项目组、协同写作
注册 / 登录

产品服务

  • 科研之友
  • 创新城
  • 科创云

服务支持

  • 帮助中心
  • 隐私政策
  • 服务条款

联系方式

在线客服:【】
客服热线:400-1616-289
电子邮箱:support@scholarmate.com

关注或下载科研之友

微信二维码
微信公众号
客户端下载二维码
下载客户端
科研成果科研人员科研机构科研动态爱瑞思软件

©2026 深圳市科研之友网络服务有限公司

公安备案图标粤公网安备 44030502000213
粤ICP备 16046710 号粤B2-20110417