Improving performance of decision tree algorithms with multi-edited nearest neighbor rule

Authors:
Chen-Zhou Ye;Jie Yang;Li-Xiu Yao;Nian-Yi Chen
Affiliations:
Institute of Image Processing & Pattern Recognition, Shanghai Jiaotong University, Shanghai, China;Institute of Image Processing & Pattern Recognition, Shanghai Jiaotong University, Shanghai, China;Institute of Image Processing & Pattern Recognition, Shanghai Jiaotong University, Shanghai, China;Institute of Image Processing & Pattern Recognition, Shanghai Jiaotong University, Shanghai, China
Venue:
PAKDD'03 Proceedings of the 7th Pacific-Asia conference on Advances in knowledge discovery and data mining
Year:
2003

Citing 3
Cited 0

Data mining with decision trees and decision rules

Future Generation Computer Systems - Special double issue on data mining
An Experimental Comparison of Three Methods for Constructing Ensembles of Decision Trees: Bagging, Boosting, and Randomization

Machine Learning
Pattern Classification (2nd Edition)

Pattern Classification (2nd Edition)

Quantified Score

Hi-index	0.00

Visualization

Abstract

The paper proposed a new method based on the multi-edited nearest neighbor rule to prevent decision tree algorithms from growing a tree of unnecessary large size and hence partially alleviate the problem of "over-training". For this purpose, two useful prosperities of the multi-edited nearest neighbor rule are investigated. Experiments show that the method proposed could drastically reduce the size of resulting trees, significantly enhance their understandability, and meanwhile improve the test accuracy when the control parameter takes an appropriate value.