Wang, Jun and Zucker, Jean-Daniel (2000) Solving Multiple-Instance Problem: A Lazy Learning Approach. [Conference Paper]
Full text available as:
PDF
98Kb |
Abstract
As opposed to traditional supervised learning, multiple-instance learning concerns the problem of classifying a bag of instances, given bags that are labeled by a teacher as being overall positive or negative. Current research mainly concentrates on adapting traditional concept learning to solve this problem. In this paper we investigate the use of lazy learning and Hausdorff distance to approach the multiple-instance problem. We present two variants of the K-nearest neighbor algorithm, called Bayesian-KNN and Citation-KNN, solving the multiple-instance problem. Experiments on the Drug discovery benchmark data show that both algorithms are competitive with the best ones conceived in the concept learning framework. Further work includes exploring of a combination of lazy and eager multiple-instance problem classifiers.
Item Type: | Conference Paper |
---|---|
Keywords: | multiple-instance problem, multiple-instance learning, lazing learning, nearest neighbor |
Subjects: | Computer Science > Artificial Intelligence Computer Science > Machine Learning |
ID Code: | 2124 |
Deposited By: | Wang, Jun |
Deposited On: | 10 Mar 2002 |
Last Modified: | 11 Mar 2011 08:54 |
References in Article
Select the SEEK icon to attempt to find the referenced article. If it does not appear to be in cogprints you will be forwarded to the paracite service. Poorly formated references will probably not work.
Metadata
- ASCII Citation
- Atom
- BibTeX
- Dublin Core
- EP3 XML
- EPrints Application Profile (experimental)
- EndNote
- HTML Citation
- ID Plus Text Citation
- JSON
- METS
- MODS
- MPEG-21 DIDL
- OpenURL ContextObject
- OpenURL ContextObject in Span
- RDF+N-Triples
- RDF+N3
- RDF+XML
- Refer
- Reference Manager
- Search Data Dump
- Simple Metadata
- YAML
Repository Staff Only: item control page