An efficient ensemble pruning algorithm using One-Path and Two-Trips searching approach

作者：Dai Qun^*

来源：Knowledge-Based Systems, 2013, 51: 85-92.

DOI：10.1016/j.knosys.2013.07.006

• Ensemble pruning
• Backtracking algorithm
• Ensemble Pruning via BackTracking algorithm (EnPBT)
• One-Path and Two-Trips searching algorithm (OPTT)
• Pruning efficiency

Ensemble pruning is substantial for the successful application of an ensemble system. A novel method for Ensemble Pruning via BackTracking algorithm (EnPBT) was proposed by us in our previous work. Backtracking algorithm can systematically search for the solutions of a problem in a depth-first and jumping manner, suitable for solving all those large-scale combinatorial problems. The validity of EnPBT algorithm has been verified in our previous work. However, the relatively slow pruning speed might be a drawback of EnPBT. Aiming at this problem, an efficient and novel ensemble pruning algorithm is proposed in this paper, i.e. One-Path and Two-Trips (OPTT) ensemble pruning algorithm. It is very fast in pruning speed, while its classification performance has no significant difference with EnPBT, as demonstrated in the experimental results of this work. In short, OPTT achieves a proper trade-off between pruning effectiveness and efficiency.

• 出版日期2013-10
• 单位南京大学