Sixth IEEE International Conference on Data Mining (ICDM'06) Boosting for Learning Multiple Classes with Imbalanced Class Distribution Hong Kong December 18-December 22 ISBN: 0-7695-2701-9
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICDM.2006.29
Classification of data with imbalanced class distribution has posed a significant drawback of the performance attainable by most standard classifier learning algorithms, which assume a relatively balanced class distribution and equal misclassification costs. This learning difficulty attracts a lot of research interests. Most efforts concentrate on bi-class problems. However, bi-class is not the only scenario where the class imbalance problem prevails. Reported solutions for bi-class applications are not applicable to multi-class problems. In this paper, we develop a cost-sensitive boosting algorithm to improve the classification performance of imbalanced data involving multiple classes. One barrier of applying the cost-sensitive boosting algorithm to the imbalanced data is that the cost matrix is often unavailable for a problem domain. To solve this problem, we apply Genetic Algorithm to search the optimum cost setup of each class. Empirical tests show that the proposed cost-sensitive boosting algorithm improves the classification performances of imbalanced data sets significantly.
Citation:
Yanmin Sun, Mohamed S. Kamel, Yang Wang, "Boosting for Learning Multiple Classes with Imbalanced Class Distribution," icdm, pp.592-602, Sixth IEEE International Conference on Data Mining (ICDM'06), 2006 Usage of this product signifies your acceptance of the Terms of Use. | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||