Direct and indirect algorithms for on-line learning of disjunctions

Author： Helmbold D.P.   Panizza S.   Warmuth M.K.  

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.284, Iss.1, 2002-07, pp. : 109-142

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Algorithms and Lower Bounds for On-Line Learning of Geometrical Concepts

By Maass W.  

Machine Learning, Vol. 14, Iss. 3, 1994-03 ,pp. : 251-269

Springer Publishing Company

Access to resources Recommend Favorite

On-line algorithms for orders

By Bouchitte V.   Rampon J.-X.  

Theoretical Computer Science, Vol. 175, Iss. 2, 1997-04 ,pp. : 225-238

Elsevier

Access to resources Recommend Favorite

On-Line Unsupervised Outlier Detection Using Finite Mixtures with Discounting Learning Algorithms

By Yamanishi Kenji   Takeuchi Jun-ichi   Williams Graham   Milne Peter  

Data Mining and Knowledge Discovery, Vol. 8, Iss. 3, 2004-05 ,pp. : 275-300

Springer Publishing Company

Access to resources Recommend Favorite

On-line algorithms for satisfiability problems with uncertainty

By Ausiello G.   Giaccio R.  

Theoretical Computer Science, Vol. 171, Iss. 1, 1997-01 ,pp. : 3-24

Elsevier

Access to resources Recommend Favorite

More on randomized on-line algorithms for caching

By Chrobak M.   Koutsoupias E.   Noga J.  

Theoretical Computer Science, Vol. 290, Iss. 3, 2003-01 ,pp. : 1997-2008

Elsevier

Access to resources Recommend Favorite