Predicting nearly as well as the best pruning of a decision tree

被引：0
|
作者：
Univ of California, Santa Cruz, United States [1 ]
机构：
来源：
Mach Learn | 1600年 / 1卷 / 51-68期
关键词：
All Open Access; Bronze;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
Learning algorithms
引用
收藏
相关论文
共 50 条
  • [1] Predicting nearly as well as the best pruning of a decision tree
    Helmbold, DP
    Schapire, RE
    MACHINE LEARNING, 1997, 27 (01) : 51 - 68
  • [2] Predicting Nearly As Well As the Best Pruning of a Decision Tree
    David P. Helmbold
    Robert E. Schapire
    Machine Learning, 1997, 27 : 51 - 68
  • [3] Predicting nearly as well as the best pruning of a decision tree through dynamic programming scheme
    Takimoto, E
    Maruoka, A
    Vovk, V
    THEORETICAL COMPUTER SCIENCE, 2001, 261 (01) : 179 - 209
  • [4] A simple algorithm for predicting nearly as well as the best pruning labeled with the best prediction values of a decision tree
    Takimoto, E
    Hirai, K
    Maruoka, A
    ALGORITHMIC LEARNING THEORY, 1997, 1316 : 385 - 400
  • [5] Predicting nearly as well as the best pruning of a planar decision graph
    Takimoto, E
    Warmuth, MK
    THEORETICAL COMPUTER SCIENCE, 2002, 288 (02) : 217 - 235
  • [6] Predicting nearly as well as the best pruning of a planar decision graph
    Takimoto, E
    Warmuth, MK
    ALGORITHMIC LEARNING THEORY, PROCEEDINGS, 1999, 1720 : 335 - 346
  • [7] RST in decision tree pruning
    Wei, Jin-Mao
    Wang, Shu-Qin
    You, Jun-Ping
    Wang, Guo-Ying
    FOURTH INTERNATIONAL CONFERENCE ON FUZZY SYSTEMS AND KNOWLEDGE DISCOVERY, VOL 3, PROCEEDINGS, 2007, : 213 - +
  • [8] The biases of decision tree pruning strategies
    Elomaa, T
    ADVANCES IN INTELLIGENT DATA ANALYSIS, PROCEEDINGS, 1999, 1642 : 63 - 74
  • [9] A quality index for decision tree pruning
    Fournier, D
    Crémilleux, B
    KNOWLEDGE-BASED SYSTEMS, 2002, 15 (1-2) : 37 - 43
  • [10] AN INVESTIGATION ON THE CONDITIONS OF PRUNING AN INDUCED DECISION TREE
    KIM, H
    KOEHLER, GJ
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1994, 77 (01) : 82 - 95
12345