Fifth IEEE International Conference on Data Mining (ICDM'05) Sharing Classifiers among Ensembles from Related Problem Domains Houston, Texas November 27-November 30 ISBN: 0-7695-2278-5
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICDM.2005.131
A classification ensemble is a group of classifiers that all solve the same prediction problem in different ways. It is well-known that combining the predictions of classifiers within the same problem domain using techniques like bagging or boosting often improves the performance. This research shows that sharing classifiers among different but closely related problem domains can also be helpful. In addition, a semi-definite programming based ensemble pruning method is implemented in order to optimize the selection of a subset of classifiers for each problem domain. Computational results on a catalog dataset indicate that the ensembles resulting from sharing classifiers among different product categories generally have larger AUCs than those ensembles trained only on their own categories. The pruning algorithm not only prevents the occasional decrease of effectiveness caused by conflicting concepts among the problem domains, but also provides a better understanding of the problem domains and their relationships.
Citation:
Yi Zhang, W. Nick Street, Samuel Burer, "Sharing Classifiers among Ensembles from Related Problem Domains," icdm, pp.522-529, Fifth IEEE International Conference on Data Mining (ICDM'05), 2005 Usage of this product signifies your acceptance of the Terms of Use. | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||