In this problem, we will investigate the perceptron algorithm with different iteration ordering. Consider applying the perceptron algorithm through the origin based on a small training set containing three points: x(1) =[-1,-1], y(1)=1x(2) =[1,0], y(2)=-1x(3) =[-1, 1.5], y(3)=1Given that the algorithm starts with θ(0)=0, the first point that the algorithm sees is always considered a mistake. The algorithm starts with some data point and then cycles through the data (in order) until it makes no further mistakes. 1. (a)How many mistakes does the algorithm make until convergence if the algorithm starts with data point x(1)? How many mistakes does the algorithm make if it starts with data point x(2)? Also provide the progression of the separating plane as the algorithm cycles in the following list format: [[θ(1)1,θ(1)2],…,[θ(N)1,θ(N)2]], where the superscript denotes different θ as the separating plane progresses. For example, if θ progress from [0,0] (initialization) to [1,2] to [3,−2], you should enter [[1,2],[3,−2]]Please enter the number of mistakes of Perceptron algorithm if the algorithm starts with x(1). unanswered Please enter the progression of the separating hyperplane (θ, in the list format described above) of Perceptron algorithm if the algorithm starts with x(1). () unanswered Please enter the number of mistakes of Perceptron algorithm if the algorithm starts with x(2). unanswered Please enter the progression of the separating hyperplane (θ, in the list format described above) of Perceptron algorithm if the algorithm starts with x(2). unanswered 1. (b)In part (a), what are the factors that affect the number of mistakes made by the algorithm? Note: Only choose factors that were changed in part (a), not all factors that can affect the number of mistakes (Choose all that apply.) Iteration orderMaximum margin between positive and negative data pointsMaximum norm of data pointsunanswered1. (c)Now assume that x(3)=[−1,10]. How many mistakes does the algorithm make until convergence if cycling starts with data point x(1)? Also provide the progression of the separating plane as the algorithm cycles in the following list format: [[θ(1)1,θ(1)2],…,[θ(N)1,θ(N)2]], where the superscript denotes different θ as the separating plane progresses. For example, if θ progress from [0,0] (initialization) to [1,2] to [3,−2], you should enter [[1,2],[3,−2]]Please enter the number of mistakes of Perceptron algorithm if the algorithm starts with x(1). unanswered Please enter the progression of the separating hyperplane (θ, in a list format described above) of Perceptron algorithm if the algorithm starts with x(1). unanswered Please enter the number of mistakes of Perceptron algorithm if the algorithm starts with x(2). unanswered Please enter the progression of the separating hyperplane (θ, in the list format described above) of Perceptron algorithm if the algorithm starts with x(2). unanswered




Why Choose Us

  • 100% non-plagiarized Papers
  • 24/7 /365 Service Available
  • Affordable Prices
  • Any Paper, Urgency, and Subject
  • Will complete your papers in 6 hours
  • On-time Delivery
  • Money-back and Privacy guarantees
  • Unlimited Amendments upon request
  • Satisfaction guarantee

How it Works

  • Click on the “Place Order” tab at the top menu or “Order Now” icon at the bottom and a new page will appear with an order form to be filled.
  • Fill in your paper’s requirements in the "PAPER DETAILS" section.
  • Fill in your paper’s academic level, deadline, and the required number of pages from the drop-down menus.
  • Click “CREATE ACCOUNT & SIGN IN” to enter your registration details and get an account with us for record-keeping and then, click on “PROCEED TO CHECKOUT” at the bottom of the page.
  • From there, the payment sections will show, follow the guided payment process and your order will be available for our writing team to work on it.