数学表达式魔训作业Day5

14. 决策表

PatientHeadacheTemperatureLymphocyteLeukocyteEosinophilHeartbeatFlu
x 1 x_1 x1YesHighHighHighHighNormalYes
x 2 x_2 x2YesHighNormalHighHighAbnormalYes
x 3 x_3 x3YesHighHighHighNormalAbnormalYes
x 4 x_4 x4NoHighNormalNormalNormalNormalNo
x 5 x_5 x5YesNormalNormalLowHighAbnormalNo
x 6 x_6 x6YesNormalLowHighNormalAbnormalNo
x 7 x_7 x7YesLowLowHighNormalNormalYes

Definition 4. A decision system is a 5-tuple S = ( U , C , D , V , I ) S = (\mathbf{U}, \mathbf{C}, \mathbf{D}, \mathbf{V}, I) S=(U,C,D,V,I), where

  • U = { x 1 , x 2 , … , x n } \mathbf{U} = \{x_1, x_2, \dots, x_n\} U={x1,x2,,xn} is the set of instances,
  • C = { a 1 , a 2 , … , a m } \mathbf{C} = \{a_1, a_2, \dots, a_m\} C={a1,a2,,am} is the set of conditions attributes,
  • D = { d 1 , d 2 , … , d l } \mathbf{D} = \{d_1, d_2, \dots, d_l\} D={d1,d2,,dl} is the set of decisional attributes,
  • V = ⋃ a ∈ C ∪ D V a \mathbf{V} = \bigcup_{a \in \mathbf{C} \cup \mathbf{D}}\mathbf{V}_a V=aCDVa,
  • V a \mathbf{V}_a Va is the domain of a ∈ C ∪ D a \in \mathbf{C} \cup \mathbf{D} aCD,
  • I : U × ( C ∪ D ) → V I: \mathbf{U} \times (\mathbf{C} \cup \mathbf{D}) \to \mathbf{V} I:U×(CD)V is the information function.

作业:

写出本例中的 U , C , D 和 V \mathbf{U}, \mathbf{C}, \mathbf{D} 和 \mathbf{V} U,C,DV. 注: 最后两个属性为决策属性.
I I I 是怎么表示的?

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 = { \{ {Patient, Headache, Temperature, Lymphocyte, Leukocyte, Eosinophil } \} };
D \mathbf{D} D = { \{ {Heartbeat, Flu } \} };
V \mathbf{V} V = { \{ {Yes, No, High, Low, Abnormal, Normal } \} }.

I ( x 1 , { I(x_1, \{ I(x1,{yes, High, High, High, High } ) = { \} ) = \{ })={Normal, Yes } \} }.
I ( x 2 , { I(x_2, \{ I(x2,{yes, High, Normal, High, High } ) = { \} ) = \{ })={Abnormal, Yes } \} }.

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

A label distributes system is a tuple L = ( X , Y ) L=(\mathbf X,\mathbf Y) L=(X,Y), where
X = [ x i j ] n × m ∈ R n × m \mathbf X=\left[x_{ij}\right]_{n\times m}\in \R^{n\times m} X=[xij]n×mRn×m is the data matrix;
Y = [ y i k ] n × l ∈ [ 0 , 1 ] \mathbf Y=\left[y_{ik}\right]_{n\times l}\in[0,1] Y=[yik]n×l[0,1] is the label matrix and ∑ k = 1 l y i k = 1 \sum_{k=1}^{l}y_{ik}=1 k=1lyik=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.

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值