This paper presents a triple-random ensemble learning method for handling multi-label classification problems. The proposed method integrates and develops the concepts of random subspace, bagging and random k-label sets ensemble learning methods to form an approach to classify multi-label data. It applies the random subspace method to feature space, label space as well as instance space. The devised subsets selection procedure is executed iteratively. Each multi-label classifier is trained using the randomly selected subsets. At the end of the iteration, optimal parameters are selected and the ensemble MLC classifiers are constructed. The proposed method is implemented and its performance compared against that of popular multi-label classification methods. The experimental results reveal that the proposed method outperforms the examined counterparts in most occasions when tested on six small to larger multi-label datasets from different domains. This demonstrates that the developed method possesses general applicability for various multi-label classification problems.
History
Event
International Conference on Data Mining Workshops (10th : 2010 : Sydney, N.S.W.)
Pagination
49 - 56
Publisher
IEEE Computer Society
Location
Sydney, NSW
Place of publication
Sydney, NSW
Start date
2010-12-14
ISBN-13
9780769542577
Language
eng
Publication classification
E1 Full written paper - refereed
Copyright notice
2010, IEEE
Editor/Contributor(s)
W Fan, W Hsu, G Webb, B Liu, C Zhang, D Gunopulos, X Wu
Title of proceedings
ICDMW 2010 : Proceedings of 10th IEEE International Conference on Data Mining Workshops