Suppose you have trained a perceptron algorithm on a binary classification problem using the following dataset: X1X2 Y 111 1-10 -110 -1-1 1 After training, the decision boundary of the perceptron is a straight line passing through the origin that separates the positive and negative examples. The activation function is (if v0. y-1: else y-0). Which of the following options represents the trained weights of this perceptron?

Suppose you have trained a perceptron algorithm on a binary classification problem using the following dataset: X1X2 Y 111 1-10 -110 -1-1 1 After training, the decision boundary of the perceptron is a straight line passing through the origin that separates the positive and negative examples. The activation function is (if v0. y-1: else y-0). Which of the following options represents the trained weights of this perceptron?

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

Given a list of non-overlapping intervals of items, write a function that takes an item as argument and determines in which, if any, interval that item lies. For example, if the items are integers and the intervals are 1643-2033, 5532-7643, 8999-10332, 5666653-5669321, then the query point 9122 lies in the third interval and 8122 lies in no interval.
Alex is playing Poker card game. He starts with a deck of N cards, where for each valid (i), the ith card has an integer A¡ written on it. Now the dealer starts dealing the cards one by one in the order from card 1 to card N. Alex wins if at some moment in time, the sum of all the cards dealt so far is between X and Y inclusive; if this never happens, Alex loses. You are now helping Alex to win the game, so without him noticing, you will swap some pairs of cards before the game starts. Develop a python script to find the smallest number of swaps we need so that Alex would win the game, or find that it is impossible to make Alex win. Display a single line containing one integer i.e., the smallest required number of swaps or -l if Alex cannot win. Input: 5 15 22 10 15 22 4 19 Output: 1
Write a program to find the solution to Maxone problem (You want to maximize the number of ones) using agenetic algorithm where the population size is 2000 and each chromosome is 20 genes long. Use a mutationprobability of 0.02 and a cross-over probability of 0.5. Make separate functions for different components of thegenetic algorithm.
Given the following Truth Table: Inputs ABC Outputs Y 000 001 010 011 100 101 110 111 Y= 1. Construct a K-Map on Scrap Paper 2. Perform Grouping on Scrap Paper 3. Give the SIMPLEST Boolean Expression for x in the answer box below. 1 X 1 0 X 1 1 1 4. Give sum of minterms and sum of don't cares. Em( )+ d( Should you have an empty set please answer with N/A )
4. Write a Julia function called resistance that returns the resistance distance r given the Cholesky factor U of L+ ee" and nodes i and j. rij = resistance (U, i, j)
Appendix A 10-Fold Cross Validation for Parameter Selection Cross Validation is the standard method for evaluation in empirical machine learning. It can also be used for parameter selection if we make sure to use the training set only. To select parameter A of algorithm A(X) over an enumerated range d E [A1,..., A] using dataset D, we do the following: 1. Split the data D into 10 disjoint folds. 2. For each value of A e (A1,..., Ar]: (a) For i = 1 to 10 Train A(A) on all folds but ith fold Test on ith fold and record the error on fold i (b) Compute the average performance of A on the 10 folds. 3. Pick the value of A with the best average performance Now, in the above, D only includes the training data and the parameter A is chosen without the knowledge of the test data. We then re-train on the entire train set D using the chosen A and evaluate the result on the test set.
We can specify the PageRank algorithm's convergence threshold using proc networks. This figure has to be positive. Default value is 1E-9. When the difference between the PageRank scores of the current iteration and the previous iteration is less than or equal to the tolerance set, the PageRank algorithm ceases iterating. We can use the PAGERANKTOLERANCE= parameter to specify the convergence tolerance. Write The example code demonstrates how to calculate PageRank centrality using a proc network built on a directed graph with unweighted links.
Suppose the function X₂+1 = (ax₂ + c) mod m is used to generate pseudo random number. Assume: m=11₁a-6,c=2, xo=5, what are x₁, x2 and x3 ?
matlab
Q3 In a company, there are several branches. Let us consider a branch of that company having N employees, if the manager is allotted to that branch(s) then he is known to everyone else in that branch. Note that the property of "known to everyone" is unique to a manager. Your task is to find the manager in that branch. Input from the user in main (), the square matrix M where if an element of row i and column j is set to 1 it means that ith person knows jth person. You need to write a function managerId () which returns the id of the manager if present or else returns -1. The function managerId () takes two arguments - the square matrix of N *N and its size N. Call managerId () from the main () output the information about the manager. Assume all diagonal elements to be 1 (as everyone knows him/herself) and there is at most one manager in the company. Example: No of persons N = 3 Input matrix: 0 1 1 1 0 1 Output: manager is person 3 1 0 1
The correct representation of the function F(A, 8, C) shown in the figure below is: A F Select one: F = m3+ m4 + m5 None of the answers F=m2 + m5 + m6 F= M3 + M4 + M7 F=m1.m3.m6 F= MO.MT.M2.M5.M6 F= I(2, 5,7) F= E(0, 1,7)
Analyze the following code fragment and answer the questions: test - 0 for i in range(n): test = test + 1 for j in range(n): test - test - 1 a Wite lotal number of operations as a function se b. What is the total number of operations if n= 100 (show all work) c. What is its Big-O running time? In algorithm analysis, how many operations are pertormed by the 2nd line of code? for i in range(len(Wst1)): for j in range(len(Nist2): On2 On+n O-2 n² -1