Mixture-Based Probabilistic Graphical Models for the Label Ranking Problem
The goal of the <i>Label Ranking (LR) problem</i> is to learn <i>preference models</i> that predict the preferred ranking of class labels for a given unlabeled instance. Different well-known machine learning algorithms have been adapted to deal with the LR problem. In particu...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2021-03-01
|
| Series: | Entropy |
| Subjects: | |
| Online Access: | https://www.mdpi.com/1099-4300/23/4/420 |