| http://www.w3.org/ns/prov#value | - The complexity of the algorithm is bounded by a fixed polynomial in n times a function of k and ?? where k is the dimension of the normal subspace (the span of normal vectors to supporting hyperplanes of the convex set) and the output is a hypothesis that correctly classifies at least 1 - ?? of the unknown Gaussian distribution.
|
