Learning probabilistic linear-threshold classifiers via selective sampling.

DOI10.1007/B12006MaRDI QIDQ5305864zbMATH OpenOpenAlexFDO

Authors Nicolò Cesa-Bianchi, Alex Conconi, Claudio Gentile

Publication date 23 March 2010

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b12006

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• scientific article; zbMATH DE number 5957363
• Learning noisy linear classifiers via adaptive and selective sampling
• Selective sampling and active learning from single and multiple teachers
• Selective sampling for nearest neighbor classifiers
• Selective sampling using the query by committee algorithm

Cited in

(12)

• Tracking the best hyperplane with a simple budget perceptron
• Selective sampling using the query by committee algorithm
• Selective sampling for nearest neighbor classifiers
• Applications of regularized least squares to pattern classification
• scientific article; zbMATH DE number 5957363 (Why is no real title available?)
• scientific article; zbMATH DE number 5521070 (Why is no real title available?)
• Learning noisy linear classifiers via adaptive and selective sampling
• scientific article; zbMATH DE number 2033141 (Why is no real title available?)
• scientific article; zbMATH DE number 1373582 (Why is no real title available?)
• scientific article; zbMATH DE number 1928797 (Why is no real title available?)
• scientific article; zbMATH DE number 7387623 (Why is no real title available?)
• Selective sampling and active learning from single and multiple teachers

This page was built for publication: Learning probabilistic linear-threshold classifiers via selective sampling.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5305864)