Cargando…
Mixture-Based Probabilistic Graphical Models for the Label Ranking Problem †
The goal of the Label Ranking (LR) problem is to learn preference models 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 particular, fine-tuned instance-based algorit...
| Autores principales: | , , , |
|---|---|
| Formato: | Online Artículo Texto |
| Lenguaje: | English |
| Publicado: |
MDPI
2021
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8066248/ https://www.ncbi.nlm.nih.gov/pubmed/33807440 http://dx.doi.org/10.3390/e23040420 |