Stacking model of multi-label classification based on pruning strategies

Exploiting dependencies between the labels is the key of improving the performance of multi-label classification. In this paper, we divide the utilizing methods of label dependence into two groups from the perspective of different ways of problem transformation: label grouping method and feature spa...

Full description

Saved in:
Bibliographic Details
Published in:Neural computing & applications 2020-11, Vol.32 (22), p.16763-16774
Main Authors: Liu, Haiyang, Wang, Zhihai, Sun, Yange
Format: Article
Language:English
Subjects:
Algorithms
Artificial Intelligence
Classification
Computational Biology/Bioinformatics
Computational Science and Engineering
Computer Science
Data Mining and Knowledge Discovery
Image Processing and Computer Vision
Labels
Probability and Statistics in Computer Science
Smart Data Aggregation Inspired Paradigm & Approaches in IoT Applns
Stacking
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Exploiting dependencies between the labels is the key of improving the performance of multi-label classification. In this paper, we divide the utilizing methods of label dependence into two groups from the perspective of different ways of problem transformation: label grouping method and feature space extending method. As to the feature space extending method, we find that the common problem is how to measure the dependencies between labels and to select proper labels to add to the original feature space. Therefore, we propose a ReliefF-based pruning model for multi-label classification (ReliefF-based stacking, RFS). RFS measures the dependencies between labels in a feature selection perspective and then selects the more relative labels into the original feature space. Experimental results of 9 multi-label benchmark datasets shows that RFS is more effective compared to other advanced multi-label classification algorithms.
ISSN:0941-0643
1433-3058
DOI:10.1007/s00521-018-3888-0