Conformal Multi-Instance Kernels
Description
In the multiple instance learning setting, each observation is a bag of feature vectors
of which one or more vectors indicates membership in a class. The primary
task is to identify if any vectors in the bag indicate class membership while ignoring
vectors that do not. We describe here a kernel-based technique that defines
a parametric family of kernels via conformal transformations and jointly learns
a discriminant function over bags together with the optimal parameter settings of
the kernel. Learning a conformal transformation effectively amounts to weighting
regions in the feature space according to their contribution to classification accuracy;
regions that are discriminative will be weighted higher than regions that are
not. This allows the classifier to focus on regions contributing to classification
accuracy while ignoring regions that correspond to vectors found both in positive
and in negative bags. We show how parameters of this transformation can
be learned for support vector machines by posing the problem as a multiple kernel
learning problem. The resulting multiple instance classifier gives competitive
accuracy for several multi-instance benchmark datasets from different domains.
| Slides | |
| 0:00 | Conformal Multi-Instance Kernels |
| 0:12 | Outline |
| 0:53 | Multiple Instance Learning |
| 2:00 | Related Work |
| 3:07 | Related Work (continued) |
| 4:25 | Kernels between distributions |
| 6:44 | Kernel Density Estimation Over Bags |
| 7:17 | Conformal Kernels (Amari and Wu, 1999) |
| 9:01 | Conformal Multi-Instance Kernels |
| 9:41 | Implementation details |
| 11:15 | Gradient Descent on the Radius-Margin Bound |
| 11:43 | Optimizing the Trace-Margin Bound |
| 12:28 | Diagnolization of conformal transformation |
| 13:40 | A toy example |
| 16:02 | Experimental Results |
| 18:20 | Future Work |
| 20:01 | Thank you |
| 22:07 | Diagnolization of conformal transformation01 |
Lecture rating
| People found this lecture: | ||
| Worth seeing | ||
| because it is: | ||
| Valuable and informative | ||
| Well presented | ||
| Easily understandable | ||
| Acceptably recorded | ||
| You need to login to cast your vote. | ||
Report a problem or upload files
If you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
Related content
SEE ALSO:
Link this page
Would you like to put a link to this lecture on your homepage?Go ahead! Copy the HTML snippet !




