Sciweavers

PKDD
2005
Springer

Improving Generalization by Data Categorization

13 years 10 months ago
Improving Generalization by Data Categorization
In most of the learning algorithms, examples in the training set are treated equally. Some examples, however, carry more reliable or critical information about the target than the others, and some may carry wrong information. According to their intrinsic margin, examples can be grouped into three categories: typical, critical, and noisy. We propose three methods, namely the selection cost, SVM confidence margin, and AdaBoost data weight, to automatically group training examples into these three categories. Experimental results on artificial datasets show that, although the three methods have quite different nature, they give similar and reasonable categorization. Results with real-world datasets further demonstrate that treating the three data categories differently in learning can improve generalization.
Ling Li, Amrit Pratap, Hsuan-Tien Lin, Yaser S. Ab
Added 28 Jun 2010
Updated 28 Jun 2010
Type Conference
Year 2005
Where PKDD
Authors Ling Li, Amrit Pratap, Hsuan-Tien Lin, Yaser S. Abu-Mostafa
Comments (0)