On learning discretized geometric concepts

We present a polynomial time online learning algorithm that learns any discretized geometric concept generated from any number of halfspaces with any number of known (to the learner) slopes in a constant dimensional space. In particular, our algorithm learns (from equivalence queries only) unions of...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Bshouty, N.H., Zhixiang Chen, Homer, S.
Format:	Tagungsbericht
Sprache:	eng
Schlagworte:	Algorithm design and analysis Approximation algorithms Computer science Injuries Polynomials
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!