![subject](/tpl/images/cats/informatica.png)
Computers and Technology, 05.05.2020 04:16 samchix727
You are given 6 training examples for a binary classification problem as follows:
X1 X2 Y
10 0 +
0 -10 +
5 -2 +
5 10 -
0 5 -
5 5 -
Plot these points in a 2-dimensional grid and show the decision boundary resulting from 1-Nearest Neighbor. Hint: To get started, connect each point with the closest point from the opposite class. Then, for each of the 5 line segments that you drew in this way, draw the perpendicular bisector. The decision boundary consists of certain line segments of these bisectors.
![ansver](/tpl/images/cats/User.png)
Answers: 3
Another question on Computers and Technology
![question](/tpl/images/cats/informatica.png)
Computers and Technology, 24.06.2019 04:10
Write a program that reads a set of floating-point values. ask the user to enter the values, then print • the average of the values. • the smallest of the values. • the largest of the values. • the range, that is the difference between the smallest and largest. of course, you may only prompt for the values once.
Answers: 3
![question](/tpl/images/cats/informatica.png)
Computers and Technology, 24.06.2019 15:30
The idea that, for each pair of devices v and w, there’s a strict dichotomy between being “in range” or “out of range” is a simplified abstraction. more accurately, there’s a power decay function f (·) that specifies, for a pair of devices at distance δ, the signal strength f(δ) that they’ll be able to achieve on their wireless connection. (we’ll assume that f (δ) decreases with increasing δ.) we might want to build this into our notion of back-up sets as follows: among the k devices in the back-up set of v, there should be at least one that can be reached with very high signal strength, at least one other that can be reached with moderately high signal strength, and so forth. more concretely, we have values p1 ≥ p2 ≥ . . ≥ pk, so that if the back-up set for v consists of devices at distances d1≤d2≤≤dk,thenweshouldhavef(dj)≥pj foreachj. give an algorithm that determines whether it is possible to choose a back-up set for each device subject to this more detailed condition, still requiring that no device should appear in the back-up set of more than b other devices. again, the algorithm should output the back-up sets themselves, provided they can be found.\
Answers: 2
![question](/tpl/images/cats/informatica.png)
Computers and Technology, 25.06.2019 01:00
Your computer will organize files into order. alphabetical chronological size no specific
Answers: 2
![question](/tpl/images/cats/informatica.png)
Computers and Technology, 25.06.2019 07:10
When you “listen” to evaluate an online message, which question should you ask?
Answers: 1
You know the right answer?
You are given 6 training examples for a binary classification problem as follows:
X1 X2...
X1 X2...
Questions
![question](/tpl/images/cats/biologiya.png)
![question](/tpl/images/cats/en.png)
English, 17.07.2019 08:50
![question](/tpl/images/cats/fizika.png)
![question](/tpl/images/cats/mat.png)
Mathematics, 17.07.2019 08:50
![question](/tpl/images/cats/istoriya.png)
History, 17.07.2019 08:50
![question](/tpl/images/cats/biologiya.png)
![question](/tpl/images/cats/mat.png)
![question](/tpl/images/cats/mat.png)
![question](/tpl/images/cats/biologiya.png)
![question](/tpl/images/cats/mat.png)
![question](/tpl/images/cats/ekonomika.png)
Business, 17.07.2019 08:50
![question](/tpl/images/cats/mat.png)
![question](/tpl/images/cats/biologiya.png)
Biology, 17.07.2019 08:50
![question](/tpl/images/cats/mat.png)
![question](/tpl/images/cats/mat.png)
Mathematics, 17.07.2019 08:50
![question](/tpl/images/cats/obshestvoznanie.png)
![question](/tpl/images/cats/ekonomika.png)
![question](/tpl/images/cats/en.png)
![question](/tpl/images/cats/informatica.png)
Computers and Technology, 17.07.2019 08:50