魔鬼训练第五天作业

老师原文链接:
14. 决策表

14.5 作业

  • 写出本例中的 U , C , D \mathbf{U},\mathbf{C}, \mathbf{D} U,C,D V \mathbf{V} V. 注:最后两个是决策属性.

  • 定义一个标签分布系统, 即各标签的值不是 0/1, 而是 [ 0 , 1 ] [ 0 , 1 ] [0,1] 区间的实数, 且同一对象的标签和为 1.

    1. U = { x 1 , x 2 , x 3 , x 4 , x 5 , x 6 , x 7 } \mathbf{U}=\{x_1,x_2, x_3, x_4, x_5, x_6, x_7\} U={ x1,x2,x3,x4,x5,x6,x7}.
      C = \mathbf{C} = C= {Yes, No, High, Normal, Low}
      D = \mathbf{D}= D= {Normal, Abnormal, Yes, No}.
      V = \mathbf{V}= V= {Yes, No, High, Low, Abnormal, Normal}.
    2. Definition 4. A multi-label segment system is a tuple S = ( X , Y ) S=(\mathbf{X, Y}) S=(X,Y) where X = [ x i j ] n × m ∈ R n × m \mathbf{X}=[x_{ij}]_{n \times m} \in \mathbb{R}^{n \times m} X=[xij]n×mRn×m is the data matrix, Y = [ y i k ] ∈ [ 0 , 1 ] n × l \mathbf{Y}=[y_{ik}] \in \left[0, 1\right]^{n \times l} Y=[yik][0,1]n×l is the label matrix, and ∑ i = 1 n y i k = 1 \sum\limits_{i=1}^n y_{ik}=1 i=1nyik=1, n n n is the number of instances, m m m is the number of features, and l l l is the number of labels.

猜你喜欢

转载自blog.csdn.net/Naruto_8/article/details/119356390