Javascript must be enabled to continue!
Multi-Label Learning Through Label-Specific Features with Entropy Guided Clustering
View through CrossRef
Multi-label learning deals with the problem where each instance is associated with multiple labels. Some methods improve the performance through generating label-specific features rather than inducing model on the original feature space. LIFT [1] first conducts clustering analysis to generate label-specific features, and then some methods are presented to improve the clustering process, e.g. 1) guiding clustering with label entropy, and 2) incorporating clustering ensemble with label similarity. However, these works only focus on label space and ignores the information of instance distribution. To address this issue, we propose a novel method named LIFTED, which systematically employs information theory to guide clustering and clustering ensemble. First, a novel scheme of label entropy is defined on both feature and label spaces, which precisely measures the amount of information of a multi-label dataset given a label. Second, for distinct label, an objective function is established to determine the degree of clustering through minimizing the label entropy. Third, an entropy-based label similarity is designed to guide clustering ensemble, which enhances the model stability and its ability on label correlation exploiting. Experiments on 12 benchmark datasets verify the competitive performance of LIFT against the state-of-art algorithms.
Title: Multi-Label Learning Through Label-Specific Features with Entropy Guided Clustering
Description:
Multi-label learning deals with the problem where each instance is associated with multiple labels.
Some methods improve the performance through generating label-specific features rather than inducing model on the original feature space.
LIFT [1] first conducts clustering analysis to generate label-specific features, and then some methods are presented to improve the clustering process, e.
g.
1) guiding clustering with label entropy, and 2) incorporating clustering ensemble with label similarity.
However, these works only focus on label space and ignores the information of instance distribution.
To address this issue, we propose a novel method named LIFTED, which systematically employs information theory to guide clustering and clustering ensemble.
First, a novel scheme of label entropy is defined on both feature and label spaces, which precisely measures the amount of information of a multi-label dataset given a label.
Second, for distinct label, an objective function is established to determine the degree of clustering through minimizing the label entropy.
Third, an entropy-based label similarity is designed to guide clustering ensemble, which enhances the model stability and its ability on label correlation exploiting.
Experiments on 12 benchmark datasets verify the competitive performance of LIFT against the state-of-art algorithms.
Related Results
Multi-Label Learning Through Label-Specific Features with Entropy Definition
Multi-Label Learning Through Label-Specific Features with Entropy Definition
Multi-label learning deals with the problem where each instance is associated with multiple labels. To exploit discriminative features for different labels, some researchers seek t...
CREATING LEARNING MEDIA IN TEACHING ENGLISH AT SMP MUHAMMADIYAH 2 PAGELARAN ACADEMIC YEAR 2020/2021
CREATING LEARNING MEDIA IN TEACHING ENGLISH AT SMP MUHAMMADIYAH 2 PAGELARAN ACADEMIC YEAR 2020/2021
The pandemic Covid-19 currently demands teachers to be able to use technology in teaching and learning process. But in reality there are still many teachers who have not been able ...
BMFS: Bidirectional weighted approach for multi-label feature selection algorithm
BMFS: Bidirectional weighted approach for multi-label feature selection algorithm
Abstract
Shortcomings of the existing multi-label feature selection algorithms, such as non-considering the correlation of label space, ignoring the possible difference of ...
Explaining the entropy concept and entropy components
Explaining the entropy concept and entropy components
Total entropy of a
thermodynamic system consists of two components: thermal entropy due to energy,
and residual entropy due to molecular orientation. In this article, a three-ste...
The Kernel Rough K-Means Algorithm
The Kernel Rough K-Means Algorithm
Background:
Clustering is one of the most important data mining methods. The k-means
(c-means ) and its derivative methods are the hotspot in the field of clustering research in re...
A Generalized Measure of Cumulative Residual Entropy
A Generalized Measure of Cumulative Residual Entropy
In this work, we introduce a generalized measure of cumulative residual entropy and study its properties. We show that several existing measures of entropy, such as cumulative resi...
Cross-Subject Emotion Recognition Using Fused Entropy Features of EEG
Cross-Subject Emotion Recognition Using Fused Entropy Features of EEG
Emotion recognition based on electroencephalography (EEG) has attracted high interest in fields such as health care, user experience evaluation, and human–computer interaction (HCI...
Image clustering using exponential discriminant analysis
Image clustering using exponential discriminant analysis
Local learning based image clustering models are usually employed to deal with images sampled from the non‐linear manifold. Recently, linear discriminant analysis (LDA) based vario...

