Statistical Learning in Multiple Instance Problems
Lists
Only you see this
Abstract
Multiple instance (MI) learning is a relatively new topic in machine learning. It is concerned with supervised learning but differs from normal supervised learning in two points: (1) it has multiple instances in an example (and there is only one instance in an example in standard supervised learning), and (2) only one class label is observable for all the instances in an example (whereas each instance has its own class label in normal supervised learning). In MI learning there is a common assumption regarding the relationship between the class label of an example and the “unobservable ” class labels of the instances inside it. This assumption, which is called the “MI assumption ” in this thesis, states that “An example is positive if at least one of its instances is positive and negative otherwise”. In this thesis, we first categorize current MI methods into a new framework. According to our analysis, there are two main categories of MI methods, instancebased and metadata-based approaches. Then we propose a new assumption for MI learning, called the “collective assumption”. Although this assumption has been used in some previous MI methods, it has never been explicitly stated, 1 and this is
BibTeX
@inproceedings{xu2003statistical,
author = {Xin Xu},
title = {{Statistical Learning in Multiple Instance Problems}},
booktitle = {Research},
year = {2003},
}Loading related content...