Register

Go Classes | DA Course | Machine Learning

173 views
0 0 votes

  

Consider the following binary classification dataset,

where circles denote the positive class and squares the negative class:

Which (if any) of the decision boundaries could be returned after optimizing the hard SVM objective (with a bias parameter) on this dataset? Mark all that apply.

  1. B
  2. A, B
  3. A, B, C
  4. Not enough information to determine

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
Answer:
← Previous · Go Classes | DA Cour...Next → · Go Classes | DA Cour...
← Previous in category · Go Classes | DA Cour...Next in category → · Go Classes | DA Cour...
Position:
Show:

Related questions

0 0 votes
1 1 answer
220
220 views
GO Classes asked Mar 29, 2025
220 views
Go Classes | DA Course | Machine Learning
If the training set is finite and linearly separable, then the perceptron convergence theorem says that the perceptron algorithm will learn a correct linear separator in ...
0 0 votes
1 1 answer
156
156 views
GO Classes asked Mar 29, 2025
156 views
Go Classes | DA Course | Machine Learning
We ran the perceptron algorithm, with offset, on the following dataset and recorded the number of mistakes we made for each point. Without running the algorithm, what is ...
0 0 votes
0 0 answers
137
137 views
GO Classes asked Mar 29, 2025
137 views
Go Classes | DA Course | Machine Learning
The perceptron algorithm will converge:If the data is linearly separableEven if the data is linearly inseparableAs long as you initialize $\theta$ to all 0'sAlways
0 0 votes
0 0 answers
148
148 views
GO Classes asked Mar 29, 2025
148 views
Go Classes | DA Course | Machine Learning
If the range of decision boundary given by Perceptron is $[a, b]$ then $a+b$?