Title of article
An upper bound on the sample complexity of PAC-learning halfspaces with respect to the uniform distribution
Author/Authors
Philip M. Long، نويسنده ,
Issue Information
دوهفته نامه با شماره پیاپی سال 2003
Pages
6
From page
229
To page
234
Keywords
PAC-learning , Halfspaces , computational complexity , Sample complexity , Machine Learning
Journal title
Information Processing Letters
Serial Year
2003
Journal title
Information Processing Letters
Record number
129768
Link To Document