Multi-label learning through minimum spanning tree-based subset selection and feature extraction

DOI10.1007/978-3-319-57351-9_12MaRDI QIDQ3305117zbMATH OpenOpenAlexFDO

Authors Payel Sadhukhan, C. A. Murthy

Publication date 5 August 2020

Published in Advances in Artificial Intelligence (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-57351-9_12

zbMATH Keywords

feature extractionminimum spanning treemulti-label classificationmulti-label ranking

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• Label distribution feature selection for multi-label classification with rough set
• Feature selection for multi-label naive Bayes classification
• Review on multi-label feature selection
• Label-specific features on a multi-label learning algorithm
• Multi-label feature selection based on the division of label topics

Cites work

• Concatenation-based greedy heuristics for the Euclidean Steiner tree problem
• ML-KNN: A lazy learning approach to multi-label learning
• Multilabel classification via calibrated label ranking
• On the History of the Minimum Spanning Tree Problem

Cited in

(1)

• Finding minimum label spanning trees using cross‐entropy method

This page was built for publication: Multi-label learning through minimum spanning tree-based subset selection and feature extraction

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3305117)