icon
Related questions
Question

Consider the concept class C formed by 2-dimensional triangles in the plane. Any function c ∈ C is a triangle such that for any point x, we have c(x) = 1 (or ‘+’) if x lies within or on the boundary triangle c and c(x) = 0 (or ‘-’), otherwise.
See the figure below for an illustration.
Given a set of m labeled point, which are (correctly) labeled with respect to a triangle c, described a polynomial-time algorithm that produces a hypothesis h ∈ C that is consistent with the labeled data. Explain the time complexity of your algorithm as a function of m. Note that n, the number of features, is 2 in this case, as we discuss 2-dimensional points.

C
Transcribed Image Text:C
Expert Solution
steps

Step by step

Solved in 2 steps with 2 images

Blurred answer