AuthorConference on Computational Learning Theory (12th : 1999 : Santa Cruz, Calif.)
TitleProceedings of the Twelfth Annual Conference on Computational Learning Theory, July 6-9, 1999, Santa Cruz, California / [Shai Ben-David and Phil Long, program chairs] ; in cooperation with ACM SIGACT and ACM SIGART
Imprint New York, N.Y. : ACM Press, c1999
Descript v, 333 p. ; 28 cm

CONTENT

Robustness of the p-norm algorithms -- Minimax regret under log loss for general classes of experts -- On theory revision with queries -- Apprentice learning model -- On learning in the presence of unspecified attribute values -- Approximation algorithms for clustering problems -- Drifting games -- Multiclass learning, boosting, and error-correcting codes -- Theoretical analysis of a randomized regularization methods


SUBJECT

  1. Computational learning theory -- Congresses

LOCATIONCALL#STATUS
Central Library (5th Floor)371.334 C748P CHECK SHELVES