Material Detail

Universal Learning over Related Distributions and Adaptive Graph Transduction

Universal Learning over Related Distributions and Adaptive Graph Transduction

This video was recorded at European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases (ECML PKDD), Bled 2009. The basis assumption "training and test data drawn from the same distribution" is often violated. We propose one common solution to cover various scenarios of learning under "different but related distributions" in a single framework. Examples include (a) sample selection bias (b) transfer learning and (c) uncertain training data. The main motivation is that one could ideally solve as many problems as possible with a single approach. The proposed solution extends graph transduction using the maximum margin principle over unlabeled data. The error of the proposed method is bounded even when the training and testing distributions are different. Experiment results demonstrate that the proposed method improves the traditional graph transduction by as much as 15% in accuracy and AUC in all common situations of distribution difference. Most importantly, it outperforms, by up to 10% in accuracy, several state-of-art approaches proposed to solve specific category of distribution difference.

Quality

  • User Rating
  • Comments
  • Learning Exercises
  • Bookmark Collections
  • Course ePortfolios
  • Accessibility Info

More about this material

Browse...

Disciplines with similar materials as Universal Learning over Related Distributions and Adaptive Graph Transduction

Comments

Log in to participate in the discussions or sign up if you are not already a MERLOT member.