Query by committee, linear separation and random walks.
type: Item
instance of: scholarly article
title: Query by committee, linear separation and random walks.
zbMATH Open document ID: 1050.68118
DOI: 10.1016/S0304-3975(01)00079-2
author: Shai Fine
author: Ran Gilad-Bachrach
author: Eli Shamir
published in: Theoretical Computer Science
publication date: 2002-07-15T00:00:00Z
Mathematics Subject Classification ID: 68T05
zbMATH DE Number: 1767821
zbMATH Keywords: Selective sampling
zbMATH Keywords: Active learning
zbMATH Keywords: Experimental design
zbMATH Keywords: Volume approximation
zbMATH Keywords: Labeled and unlabelled data
MaRDI profile type: Publication
cites work: Q4704219
cites work: A random polynomial-time algorithm for approximating the volume of convex bodies
cites work: Q3258669
cites work: Selective sampling using the query by committee algorithm
cites work: Geometric algorithms and combinatorial optimization
cites work: Bounds on the sample complexity of Bayesian learning using information theory and the VC dimension
cites work: Random walks in a convex body and an improved volume algorithm
cites work: Q4935997
full work available at URL: s0304-3975(01)00079-2
OpenAlex ID: W2127809819
description: scientific article; zbMATH DE number 1767821