Abstract
In standard supervised learning, each training instance is associated with an outcome from a corresponding output space (e.g., a class label in classification or a real number in regression). In the superset learning problem, the outcome is only characterized in terms of a superset—a subset of candidates that covers the true outcome but may also contain additional ones. Thus, superset learning can be seen as a specific type of weakly supervised learning, in which training examples are ambiguous. In this paper, we introduce a generic approach to superset learning, which is motivated by the idea of performing model identification and “data disambiguation” simultaneously. This idea is realized by means of a generalized risk minimization approach, using an extended loss function that compares precise predictions with set-valued observations. As an illustration, we instantiate our meta learning technique for the problem of label ranking, in which the output space consists of all permutations of a fixed set of items. The label ranking method thus obtained is compared to existing approaches tackling the same problem.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Boekaerts, M., Smit, K., Busing, F.M.T.A.: Salient goals direct and energise students’ actions in the classroom. Applied Psychology: An International Review 4(S1), 520–539 (2012)
Burkard, R.E., Dell’Amico, M., Martello, S.: Assignment Problems. SIAM (2009)
Cheng, W., Dembczynski, K., Hüllermeier, E.: Label ranking based on the Plackett-Luce model. In: Proc. ICML 2010, Int. Conf. on Machine Learning, Haifa, Israel (2010)
Cheng, W., Hühn, J., Hüllermeier, E.: Decision tree and instance-based learning for label ranking. In: Proc. ICML 2009, 26th International Conference on Machine Learning, Montreal, Canada (2009)
Cour, T., Sapp, B., Taskar, B.: Learning from partial labels. Journal of Machine Learning Research 12, 1501–1536 (2011)
Grandvalet, Y.: Logistic regression for partial labels. In: IPMU 2002, Int. Conf. Information Processing and Management of Uncertainty in Knowledge-Based Systems, pp. 1935–1941, Annecy, France (2002)
Har-Peled, S., Roth, D., Zimak, D.: Constraint classification for multiclass classification and ranking. In: Proc. NIPS 2002, pp. 785–792 (2003)
Hüllermeier, E.: Learning from imprecise and fuzzy observations: Data disambiguation through generalized loss minimization. International Journal of Approximate Reasoning 55(7), 1519–1534 (2014)
Hüllermeier, E., Beringer, J.: Learning from ambiguously labeled examples. Intelligent Data Analysis 10(5), 419–440 (2006)
Hüllermeier, E., Fürnkranz, J., Cheng, W., Brinker, K.: Label ranking by learning pairwise preferences. Artificial Intelligence 172, 1897–1917 (2008)
Jin, R., Ghahramani, Z.: Learning with multiple labels. In: 16th Annual Conference on Neural Information Processing Systems, Vancouver, Canada (2002)
Kuhn, H.W.: The Hungarian method for the assignment problem. Naval Research Logistics Quarterly 2(1–2), 83–97 (1955)
Liu, L.P., Dietterich, T.G.: A conditional multinomial mixture model for superset label learning. In: Proc. NIPS (2012)
Liu, L.P., Dietterich, T.G.: Learnability of the superset label learning problem. In: Proc. ICML 2014, Int. Conference on Machine Learning, Beijing, China (2014)
Nguyen, N., Caruana, R.: Classification with partial labels. In: Proc. KDD 2008, 14th Int. Conf. on Knowledge Discovery and Data Mining, Las Vegas, USA (2008)
Schölkopf, B., Smola, A.J.: Learning with Kernels: Support Vector Machines, Regularization, Optimization, and Beyond. MIT Press (2001)
Sid-Sueiro, J.: Proper losses for learning from partial labels. In: Proc. NIPS (2012)
Sun, Y.Y., Zhang, Y., Zhou, Z.H.: Multi-label learning with weak label. In: Proc. 24th AAAI Conference on Artificial Intelligence, Atlanta, Georgia, USA (2010)
Zhou, Y. Lui, Y., Yang, J., He, X., Liu, L.: A taxonomy of label ranking algorithms. Journal of Computers 9(3) (2014)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Hüllermeier, E., Cheng, W. (2015). Superset Learning Based on Generalized Loss Minimization. In: Appice, A., Rodrigues, P., Santos Costa, V., Gama, J., Jorge, A., Soares, C. (eds) Machine Learning and Knowledge Discovery in Databases. ECML PKDD 2015. Lecture Notes in Computer Science(), vol 9285. Springer, Cham. https://doi.org/10.1007/978-3-319-23525-7_16
Download citation
DOI: https://doi.org/10.1007/978-3-319-23525-7_16
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-23524-0
Online ISBN: 978-3-319-23525-7
eBook Packages: Computer ScienceComputer Science (R0)