Semi-supervised learning of user-preferred travel schedules

ABSTRACT

We present a graph-based semi-supervised approach for learning user-preferred travel schedules. Assuming a setting in which a user provides a small number of labeled travel schedules, we classify schedules into desirable and non-desirable. This task is non-trivial since only a small number of labeled points is available. It is further complicated by the fact that each schedule is comprised of multiple components or aspects which are different in nature. For instance in our case arrival times are modeled by probability distributions to account for uncertainty, while other aspects such as waiting times are given by a feature vector. Each aspect can thought of as a different type of observation for the same schedule While existing label propagation approaches can exploit vast amounts of unlabeled data, they cannot handle multi-aspect data. We propose Multi-Aspect Label Propagation (MALP), a novel approach which extends label propagation to handle multiple types of observations.

REFERENCES

• 1: Fei Wang , Changshui Zhang, Label propagation through linear neighborhoods, Proceedings of the 23rd international conference on Machine learning, p.985-992, June 25-29, 2006, Pittsburgh, Pennsylvania [doi>10.1145/1143844.1143968]
• 2: D. Zhou, O. Bousquet, T. Lal, J. Weston, and B. Schölkopf Learning with local and global consistency. In NIPS, 2003.
• 3: O. Chapelle, B. Scholkopf, and A. Zien, editors. Semi-Supervised Learning. MIT Press, 2006.
• 4: X. Zhu, Z. Ghahramani, and J. Lafferty. Semi-supervised learning using Gaussian fields and harmonic functions. In ICML, 2003.
• 5: M. Szummer and T. Jaakkola. Partially labeled classification with markov random walks. In NIPS, 2001.

INDEX TERMS

Primary Classification:
  I. Computing Methodologies
  I.2 ARTIFICIAL INTELLIGENCE
      I.2.6 Learning

General Terms:
Algorithms