Query Learning with Large Margin Classifiers
Abstract
The active selection of instances can significantly improve the generalisation performance of a learning machine. Large margin classifiers such as Support Vector Machines classify data using the most informative instances (the support vectors). This makes them natural candidates for instance selection strategies. In this paper we propose an algorithm for the training of Support Vector Machines using instance selection. We give a theoretical justification for the strategy and experimental results on real and artificial data demonstrating its effectiveness. The technique is most efficient when the dataset can be learnt using few support vectors. 1. Introduction The labour-intensive task of labelling data is a serious bottleneck for many data mining tasks. Often cost or time constraints mean that only a fraction of the available instances can be labeled. For this reason there has been increasing interest in the problem of handling partially labeled datasets. One approach ...
Cite
Text
Campbell et al. "Query Learning with Large Margin Classifiers." International Conference on Machine Learning, 2000.Markdown
[Campbell et al. "Query Learning with Large Margin Classifiers." International Conference on Machine Learning, 2000.](https://mlanthology.org/icml/2000/campbell2000icml-query/)BibTeX
@inproceedings{campbell2000icml-query,
title = {{Query Learning with Large Margin Classifiers}},
author = {Campbell, Colin and Cristianini, Nello and Smola, Alexander J.},
booktitle = {International Conference on Machine Learning},
year = {2000},
pages = {111-118},
url = {https://mlanthology.org/icml/2000/campbell2000icml-query/}
}