A rough sets based pruning method for bagging ensemble |
| |
Authors: | MIAO Duo qian WANG Rui zhi DUAN Qi guo LIU Ji ming |
| |
Institution: | 1. Department of Computer Science and Technology, Tongji University, Shanghai 201804, P. R. China 2. Computer Science Department, Hung Kong Baptist University, Kowloon Tong, Hung Kong SAR |
| |
Abstract: | Ensemble techniques train a set of component classifiers and then combine their predictions to classify new pat-terns. Bagging is one of the most popular ensemble techniques for improving weak classifiers. However, it is hard to deployin many real applications because of the large memory requirement and high computation cost to store and vote the predic- tions of component classifiers. Rough set theory is a formal mathematical tool to deal with incomplete or imprecise informa- tion, which has attracted a lot of attention from theory and application fields. In this paper, a novel rough sets based meth-od is proposed to prune the classifiers obtained from bagging ensemble and select a subset of the component classifiers for aggregation. Experiment results show that the proposed method not only decreases the number of component classifiers but also obtains acceptable performance. |
| |
Keywords: | Rough sets Bagging ensemble Pruning method |
本文献已被 维普 万方数据 等数据库收录! |
| 点击此处可从《重庆邮电大学学报(自然科学版)》浏览原始摘要信息 |
| 点击此处可从《重庆邮电大学学报(自然科学版)》下载免费的PDF全文 |