Generalised bottom-up pruning: A model level combination of decision trees

被引:5
|
作者
Eastwood, Mark [1 ]
Gabrys, Bogdan [1 ]
机构
[1] Bournemouth Univ, Smart Technol Res Ctr, Poole BH12 5BB, Dorset, England
关键词
Churn prediction; Ensemble methods; Decision tree pruning; EXPLANATION; INDUCTION;
D O I
10.1016/j.eswa.2012.02.061
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
A generalisation of bottom-up pruning is proposed as a model level combination method for a decision tree ensemble. Bottom up pruning on a single tree involves choosing between a subtree rooted at a node, and a leaf, dependant on a pruning criterion. A natural extension to an ensemble of trees is to allow subtrees from other ensemble trees to be grafted onto a node in addition to the operations of pruning to a leaf and leaving the existing subtree intact. Suitable pruning criteria are proposed and tested for this multi-tree pruning context. Gains in both performance and in particular compactness over individually pruned trees are observed in tests performed on a number of datasets from the UCI database. The method is further illustrated on a churn prediction problem in the telecommunications domain. (C) 2012 Elsevier Ltd. All rights reserved.
引用
收藏
页码:9150 / 9158
页数:9
相关论文
共 50 条
  • [1] A framework for bottom-up induction of oblique decision trees
    Banos, Rodrigo C.
    Jaskowiak, Pablo A.
    Cerri, Ricardo
    de Carvalho, Andre C. P. L. F.
    NEUROCOMPUTING, 2014, 135 : 3 - 12
  • [2] Bottom-up fuzzy partitioning in fuzzy decision trees
    Fajfer, Maciej
    Janikow, Cezary Z.
    Annual Conference of the North American Fuzzy Information Processing Society - NAFIPS, 2000, : 326 - 330
  • [3] Bottom-up fuzzy partitioning in fuzzy decision trees
    Fajfer, M
    Janikow, CZ
    PEACHFUZZ 2000 : 19TH INTERNATIONAL CONFERENCE OF THE NORTH AMERICAN FUZZY INFORMATION PROCESSING SOCIETY - NAFIPS, 2000, : 326 - 330
  • [4] BOTTOM-UP RECURSION IN TREES
    CASAS, R
    STEYAERT, JM
    LECTURE NOTES IN COMPUTER SCIENCE, 1986, 214 : 172 - 182
  • [5] Protein Classification Using Decision Trees With Bottom-up Classification Approach
    Pepik, Bojan
    Kalajdziski, Slobodan
    Davcev, Danco
    13TH INTERNATIONAL CONFERENCE ON BIOMEDICAL ENGINEERING, VOLS 1-3, 2009, 23 (1-3): : 174 - 178
  • [6] FAST BOTTOM-UP PRUNING FOR HEVC INTRAFRAME CODING
    Huang, Han
    Zhao, Yao
    Lin, Chunyu
    Bai, Huihui
    2013 IEEE INTERNATIONAL CONFERENCE ON VISUAL COMMUNICATIONS AND IMAGE PROCESSING (IEEE VCIP 2013), 2013,
  • [7] An efficient bottom-up distance between trees
    Valiente, G
    EIGHTH SYMPOSIUM ON STRING PROCESSING AND INFORMATION RETRIEVAL, PROCEEDINGS, 2001, : 212 - 219
  • [8] Bottom-up computation using trees of sublists
    Mu, Shin-cheng
    JOURNAL OF FUNCTIONAL PROGRAMMING, 2024, 34
  • [9] Bottom-up automata on data trees and vertical XPath
    Figueira, Diego
    Segoufin, Luc
    28TH INTERNATIONAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE (STACS 2011), 2011, 9 : 93 - 104
  • [10] MORE EFFICIENT BOTTOM-UP MULTIPATTERN MATCHING IN TREES
    CAI, J
    PAIGE, R
    TARJAN, R
    THEORETICAL COMPUTER SCIENCE, 1992, 106 (01) : 21 - 60