Abstract
Extracting an effective feature set on the basis of dataset characteristics can be a useful proposition to address a classification task. For multi-label datasets, the positive and negative class memberships for the instance set vary from label to label. In such a scenario, a dedicated feature set for each label can serve better than a single feature set for all labels. In this article, we approach multi-label learning addressing the same concern and present our work Multi-label learning through Minimum Spanning Tree based subset selection and feature extraction (MuMST-FE). For each label, we estimate the positive and negative class shapes using respective Minimum Spanning Trees (MSTs), followed by subset selection based on the key lattices of the MSTs. We select a unique subset of instances for each label which participates in the feature extraction step. A distance based feature set is extracted for each label from the reduced instance set to facilitate final classification. The classifiers modelled from MuMST-FE is found to possess improved robustness and discerning capabilities which is established by the performance of the proposed schema against several state-of-the-art approaches on ten benchmark datasets.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Boutell, M.R., Luo, J., Shen, X., Brown, C.M.: Learning multi-label scene classification. Pattern Recogn. 37(9), 1757–1771 (2004)
Fürnkranz, J., Hüllermeier, E., Mencía, E.L., Brinker, K.: Multilabel classification via calibrated label ranking. Mach. Learn. 73(2), 133–153 (2008)
Graham, R.L., Hell, P.: On the history of the minimum spanning tree problem. IEEE Ann. Hist. Comput. 7(1), 43–57 (1985). http://dx.doi.org/10.1109/MAHC.1985.10011
Nasierding, G., Tsoumakas, G., Kouzani, A.Z.: Clustering based multi-label classification for image annotation and retrieval. In: IEEE International Conference on Systems, Man and Cybernetics, SMC 2009, pp. 4514–4519, October 2009
Read, J., Pfahringer, B., Holmes, G., Frank, E.: Classifier chains for multi-label classification. Mach. Learn. 85(3), 333–359 (2011)
Tsoumakas, G., Katakis, I., Vlahavas, I.: Random k-labelsets for multilabel classification. IEEE Trans. Knowl. Data Eng. 23(7), 1079–1089 (2011)
Tsoumakas, G., Katakis, I.: Multi-label classification: an overview. Int. J. Data Wareh. Min. 3, 1–13 (2007)
Zachariasen, M., Winter, P.: Concatenation-based greedy heuristics for the Euclidean Steiner tree problem. Algorithmica 25(4), 418–437 (1999)
Zhang, M.L., Wu, L.: LIFT: multi-label learning with label-specific features. IEEE Trans. Pattern Anal. Mach. Intell. 37(1), 107–120 (2015)
Zhang, M.L., Zhou, Z.H.: ML-KNN: a lazy learning approach to multi-label learning. Pattern Recogn. 40(7), 2038–2048 (2007)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Sadhukhan, P., Murthy, C.A. (2017). Multi-label Learning Through Minimum Spanning Tree-Based Subset Selection and Feature Extraction. In: Mouhoub, M., Langlais, P. (eds) Advances in Artificial Intelligence. Canadian AI 2017. Lecture Notes in Computer Science(), vol 10233. Springer, Cham. https://doi.org/10.1007/978-3-319-57351-9_12
Download citation
DOI: https://doi.org/10.1007/978-3-319-57351-9_12
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-57350-2
Online ISBN: 978-3-319-57351-9
eBook Packages: Computer ScienceComputer Science (R0)