Supervised learning is characterized by a broad spectrum of learning problems, often involving structured types of prediction, including classification, ranking-based predictions (label and instance ranking), and (ordinal) regression in its various forms. All these different learning problems are typically addressed by specific algorithmic solutions. In this chapter, we propose ageneral preference learning model (GPLM), which gives an easy way to translate any supervised learning problem and the associated cost functions into sets of preferences to learn from. A large margin principled approach to solve this problem is also proposed. Examples of how the proposed framework has been effectively used by us to address non-standard real-world applications are reported showing the flexibility and effectiveness of the approach. © 2011 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Aiolli, F., & Sperduti, A. (2011). A preference optimization based unifying framework for supervised learning problems. In Preference Learning (pp. 19–42). Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-642-14125-6_2
Mendeley helps you to discover research relevant for your work.