Consider the following dataset: [math: X=[−π,−0.5π,0,0.5π,π]]X=[-\pi,-0.5\pi,0,0.5\pi,\pi] with corresponding labels [math: y=[1,−1,−1,−1,1]]y=[1,-1,-1,-1,1]. Which of the following transformations would make the data linearly separable? A. [math: ϕ(x)=(x,cos(x))]\phi(x)=(x,cos( x)) B. [math: ϕ(x)=(x,sin(x))]\phi(x)=(x,sin(x)) C. [math: ϕ(x)=(x,cos(0.5x))]\phi(x)=(x,cos(0.5 x)) D. [math: ϕ(x)=(x,sin(0.5x))]\phi(x)=(x,sin(0.5 x))多项选择题

题目图片
A

a. A

B

b. B

C

c. C

D

d. D

登录即可查看完整答案

我们收录了全球超50000道真实原题与详细解析,现在登录,立即获得答案。

类似问题

给定下列  1-D 数据集,包含  7  个点  {-3, -2, -1, 0, 1, 2, 3} ,其中  + 和  -  是对应样本的分类,我们不能使用一个阈值对所有点进行分类(因为  +  类样本两边都被  -   类样本包围)。我们可以定义一个从  1 维 到  2 维 的映射,从而使这两个类变为线性可分离的。  下列哪个特征映射可以实现上述目的(即,确保映射样本变为线性可分离的)?   Given the following 1-D dataset of 7 points {-3, -2, -1, 0, 1, 2, 3}, where + and - are the labels for the corresponding samples, we cannot classify all the points by using a single threshold (since the + class samples are surrounded by the - class samples from both sides). We may define a mapping from 1-D to 2-D, so as to make the two classes linearly separable. Which of the following feature mappings may achieve that goal (i.e., ensuring the mapped samples to be linearly separable)?

Let [math: x=(x1,x2)]x=(x_1,x_2) and [math: y=(y1,y2)]y=(y_1,y_2) and let kernel k be defined as follows: [math: k(x,y)=ex1x2+y1y2+2x1y1x2y2+0.25x13y13]k(x,y) = e^{x_1x_2+y_1y_2} +2 \frac{x_1 y_1}{x_2y_2} + 0.25 x_1^3 y_1^3 which transformation [math: ϕ]\phi does this kernel correspond to?

Let x=(x_1,x_2) and y=(y_1,y_2) and let kernel k be defined as follows: k(x,y) = e^{x_1x_2+y_1y_2} +2 \frac{x_1 y_1}{x_2y_2} + 0.25 x_1^3 y_1^3 which transformation \phi does this kernel correspond to?

Let [math: x=(x1,x2)]x=(x_1,x_2) and [math: y=(y1,y2)]y=(y_1,y_2) and let kernel k be defined as follows: [math: k(x,y)=ex1x2+y1y2+2x1y1x2y2+0.25x13y13]k(x,y) = e^{x_1x_2+y_1y_2} +2 \frac{x_1 y_1}{x_2y_2} + 0.25 x_1^3 y_1^3 which transformation [math: ϕ]\phi does this kernel correspond to?

更多留学生实用工具

加入我们,立即解锁 海量真题独家解析,让复习快人一步!