Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Tracking the best disjunction

From MaRDI portal
Publication:1275393
Jump to:navigation, search

DOI10.1023/A:1007472513967zbMath0912.68164MaRDI QIDQ1275393

Peter Auer, Manfred K. Warmuth

Publication date: 18 May 1999

Published in: Machine Learning (Search for Journal in Brave)


zbMATH Keywords

disjunction scheduleon-line learning algorithmWINNOW


Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)


Related Items (7)

Competitive On-line Statistics ⋮ Projective DNF formulae and their revision ⋮ Agnostic learning of geometric patterns ⋮ Tracking the best hyperplane with a simple budget perceptron ⋮ Improved MCMC sampling methods for estimating weighted sums in Winnow with application to DNF learning ⋮ Direct and indirect algorithms for on-line learning of disjunctions ⋮ Adaptive and self-confident on-line learning algorithms




This page was built for publication: Tracking the best disjunction

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1275393&oldid=13376169"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 10:54.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki