VC dimension
Код 2409968
- ISBN: 978-5-5113-8657-7
Код 2409968
High Quality Content by WIKIPEDIA articles! In statistical learning theory, or sometimes computational learning theory, the VC dimension (for Vapnik–Chervonenkis dimension) is a measure of the capacity of a statistical classification algorithm, defined as the cardinality of the largest set of points that the algorithm can shatter. It is a core concept in Vapnik–Chervonenkis theory, and was originally defined by Vladimir Vapnik and Alexey Chervonenkis.
Оставить комментарий