Multi-label Learning Through Minimum Spanning Tree-Based Subset Selection and Feature Extraction

DOI10.1007/978-3-319-57351-9_12zbMath1454.68130OpenAlexW2607224130MaRDI QIDQ3305117

Payel Sadhukhan, Chivukula 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)

Cites Work

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

This page was built for publication: Multi-label Learning Through Minimum Spanning Tree-Based Subset Selection and Feature Extraction