Constructing Nonlinear Discriminants from Multiple Data Views

There are many situations in which we have more than one view of a single data source, or in which we have multiple sources of data that are aligned. We would like to be able to build classifiers which incorporate these to enhance classification performance. Kernel Fisher Discriminant Analysis (KFDA) can be formulated as a convex optimisation problem, which we extend to the Multiview setting (MFDA) and introduce a sparse version (SMFDA). We show that our formulations are justified from both probabilistic and learning theory perspectives. We then extend the optimisation problem to account for directions unique to each view (PMFDA). We show experimental validation on a toy dataset, and then give experimental results on a brain imaging dataset and part of the PASCAL 2007 VOC challenge dataset.

• Type: Journal
• Year: 2010
• Where: PKDD
• Authors: Tom Diethe, David R. Hardoon, John Shawe-Taylor
• Keywords: Brain Imaging Dataset, Convex Optimisation Problem, Data Mining, Optimisation Problem, PKDD 2010