Query by committee, linear separation and random walks.

DOI10.1016/S0304-3975(01)00079-2zbMath1050.68118OpenAlexW2127809819MaRDI QIDQ1603591

Ran Gilad-Bachrach, Eli Shamir, Shai Fine

Publication date: 15 July 2002

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(01)00079-2

zbMATH Keywords

Experimental designActive learningLabeled and unlabelled dataSelective samplingVolume approximation

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Related Items (2)

Algorithmic aspects of determining depth functions in a procedure for optimal hypothesis selection in data classification problems ⋮ Active sampling for multiple output identification

Cites Work

• Geometric algorithms and combinatorial optimization
• Bounds on the sample complexity of Bayesian learning using information theory and the VC dimension
• Selective sampling using the query by committee algorithm
• Random walks in a convex body and an improved volume algorithm
• A random polynomial-time algorithm for approximating the volume of convex bodies
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Query by committee, linear separation and random walks.