Active learning of label ranking functions

ABSTRACT

The effort necessary to construct labeled sets of examples in a supervised learning scenario is often disregarded, though in many applications, it is a time-consuming and expensive procedure. While this already constitutes a major issue in classification learning, it becomes an even more serious problem when dealing with the more complex target domain of total orders over a set of alternatives. Considering both the pairwise decomposition and the constraint classification technique to represent label ranking functions, we introduce a novel generalization of pool-based active learning to address this problem.

REFERENCES

• 1: Dana Angluin, Queries and Concept Learning, Machine Learning, v.2 n.4, p.319-342, April 1988 [doi>10.1023/A:1022821128753]
• 2: Dimitris Bertsimas , Santosh Vempala, Solving convex programs by random walks, Proceedings of the thiry-fourth annual ACM symposium on Theory of computing, May 19-21, 2002, Montreal, Quebec, Canada [doi>10.1145/509907.509926]
• 3: Colin Campbell , Nello Cristianini , Alex J. Smola, Query Learning with Large Margin Classifiers, Proceedings of the Seventeenth International Conference on Machine Learning, p.111-118, June 29-July 02, 2000
• 4: Chang, C.-C., & Lin, C.-J. (2001). LIBSVM: a library for support vector machines. Software available at http://www.csie.ntu.edu.tw/~cjlin/libsvm.
• 5: Cohen, W. W., Schapire, R. E., & Singer, Y. (1999). Learning to order things. Journal of Artificial Intelligence Research, 10, 243--270.
• 6: Crammer, K., & Singer, Y. (2002). Pranking with ranking. Advances in Neural Information Processing Systems 14 (pp. 641--647). Cambridge, MA: MIT Press.
• 7: Dubois, D., Prade, H., & Sabbadin, R. (2001). Decision-theoretic foundation of qualitative possibility theory. European Journal of Operational Research, 459--459.
• 8: Yoav Freund , H. Sebastian Seung , Eli Shamir , Naftali Tishby, Selective Sampling Using the Query by Committee Algorithm, Machine Learning, v.28 n.2-3, p.133-168, Aug./Sept. 1997 [doi>10.1023/A:1007330508534]
• 9: Fürnkranz, J., & Hüüllermeier, E. (2003). Pairwise preference learning and ranking. Proceedings of the 14th European Conference on Machine Learning (pp. 145--156). Cavtat, Croatia: Springer-Verlag.
• 10: Grünbaum, B. (1960). Partitions of mass-distributions and convex bodies by hyperplanes. Pacific J. Math., 10, 1257--1261.
• 11: Har-Peled, S., Roth, D., & Zimak, D. (2002). Constraint classification: A new approach to multiclass classification and ranking. Advances in Neural Information Processing Systems 15 (NIPS).
• 12: Herbrich, R., Graepel, T., & Obermayer, K. (2000). Advances in large margin classifiers, chapter Large margin rank boundaries for ordinal regression, 115--132. Cambridge, MA: MIT Press.
• 13: Pat Langley, Machine Learning for Adaptive User Interfaces, Proceedings of the 21st Annual German Conference on Artificial Intelligence: Advances in Artificial Intelligence, p.53-62, September 09-12, 1997
• 14: David D. Lewis , William A. Gale, A sequential algorithm for training text classifiers, Proceedings of the 17th annual international ACM SIGIR conference on Research and development in information retrieval, p.3-12, July 03-06, 1994, Dublin, Ireland
• 15: Mitchell, T. M. (1982). Generalization as search. Journal of Artificial Intelligence, 18, 203--226.
• 16: Platt, J. (1999). Probabilistic outputs for support vector machines and comparison to regularized likelihood methods. Advances in Large Margin Classifiers (pp. 61--74). Cambridge, MA: MIT Press.
• 17: Doug Riecken, Introduction: personalized views of personalization, Communications of the ACM, v.43 n.8, p.26-28, Aug. 2000 [doi>10.1145/345124.345133]
• 18: Bernhard Schölkopf , John C. Platt , John C. Shawe-Taylor , Alex J. Smola , Robert C. Williamson, Estimating the Support of a High-Dimensional Distribution, Neural Computation, v.13 n.7, p.1443-1471, July 2001 [doi>10.1162/089976601750264965]
• 19: Bernhard Scholkopf , Alexander J. Smola, Learning with Kernels: Support Vector Machines, Regularization, Optimization, and Beyond, MIT Press, Cambridge, MA, 2001
• 20: H. S. Seung , M. Opper , H. Sompolinsky, Query by committee, Proceedings of the fifth annual workshop on Computational learning theory, p.287-294, July 27-29, 1992, Pittsburgh, Pennsylvania, United States [doi>10.1145/130385.130417]
• 21: John Shawe-Taylor , Nello Cristianini, Further results on the margin distribution, Proceedings of the twelfth annual conference on Computational learning theory, p.278-285, July 07-09, 1999, Santa Cruz, California, United States [doi>10.1145/307400.307470]
• 22: Simon Tong , Daphne Koller, Support Vector Machine Active Learning with Application sto Text Classification, Proceedings of the Seventeenth International Conference on Machine Learning, p.999-1006, June 29-July 02, 2000
• 23: von Neumann, J., & Morgenstern, O. (1944). Theory of games and economic behavior. Princeton University Press.
• 24: Warmuth, M. K., Rätsch, G., Mathieson, M., Liao, J., & Lemmen, C. (2002). Active learning in the drug discovery process. Advances in Neural information processing systems (pp. 1449--1456).