Learning Subjective Functions with Large Margins

In this paper, the authors study optimization and decision making. They propose an algorithm that is based on the theory of support vector machines. The algorithm is advantageous in that prior knowledge about the domain can be used to constrain the solution. The algorithm is demonstrated in a route recommendation system which adapts to the driver's route preferences.

[1]  P. Langley,et al.  An Analysis of Bayesian Classifiers , 1992, AAAI.

[2]  David Gelperin,et al.  The optimality of A , 1988 .

[3]  Kenneth Steiglitz,et al.  Combinatorial Optimization: Algorithms and Complexity , 1981 .

[4]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[5]  David E. Moriarty,et al.  Symbiotic Evolution of Neural Networks in Sequential Decision Tasks , 1997 .

[6]  Paul E. Utgoff,et al.  Two Kinds of Training Information For Evaluation Function Learning , 1991, AAAI.

[7]  Pat Langley,et al.  An adaptive interactive agent for route advice , 1999, AGENTS '99.

[8]  Gerald Tesauro,et al.  Connectionist Learning of Expert Preferences by Comparison Training , 1988, NIPS.

[9]  Yoram Singer,et al.  Learning to Order Things , 1997, NIPS.

[10]  Vladimir N. Vapnik,et al.  The Nature of Statistical Learning Theory , 2000, Statistics for Engineering and Information Science.

[11]  Vladimir Vapnik,et al.  Statistical learning theory , 1998 .

[12]  Pat Langley,et al.  An Analysis of Bayesian Classifiers , 1992, AAAI.

[13]  Paul E. Utgoff,et al.  Learning a Preference Predicate , 1987 .

[14]  Kristian J. Hammond,et al.  Knowledge-Based Navigation of Complex Information Spaces , 1996, AAAI/IAAI, Vol. 1.

[15]  Pat Langley,et al.  Learning User Evaluation Functions for Adaptive Scheduling Assistance , 1999, ICML.

[16]  Pat Langley,et al.  Machine Learning for Adaptive User Interfaces , 1997, KI.