第四次作业

1.定义无向网络.
An undirected net is a tuple $G=(\mathbf{V},w)$, where $\mathbf{V}$ is the set of nodes, and $w:\mathbf{V}\times \mathbf{V}\to \mathbb{R}$ is the weight function where $w(v_i,v_j)$ is the weight of the arc $(v_i,v_j)$.
2.写出该无向图的邻接矩阵.

$\mathbf{X}=\left[\begin{array}{cccc}0& 1& 1& 1\\ 1& 0& 1& 0\\ 1& 1& 0& 1\\ 1& 0& 1& 0\end{array}\right]$
3.$自己画一棵树,将其元组各部分写出来(特别是函数p)$

V = { v 1 , v 2 , v 3 , v 4 , v 5 , v 0 } \mathbf{V}=\{\textrm v_1,\textrm v_2,\textrm v_3,\textrm v_4,\textrm v_5,\textrm v_0\} V={v1​,v2​,v3​,v4​,v5​,v0​}
r = { v 0 } \mathbf{r} = \{\textrm v_0\} r={v0​}
$p^{(0)}({\text{v}}_3)\equiv {\text{v}}_3$
$p^{(1)}({\text{v}}_3)={\text{v}}_1$
$p^{(2)}({\text{v}}_3)={\text{v}}_0$
$p^{(0)}({\text{v}}_4)\equiv {\text{v}}_4$
$p^{(1)}({\text{v}}_4)={\text{v}}_1$
$p^{(2)}({\text{v}}_4)={\text{v}}_0$
$p^{(0)}({\text{v}}_5)\equiv {\text{v}}_5$
$p^{(1)}({\text{v}}_5)={\text{v}}_2$
$p^{(2)}({\text{v}}_5)={\text{v}}_0$
$p^{(0)}({\text{v}}_1)\equiv {\text{v}}_1$
$p^{(1)}({\text{v}}_1)={\text{v}}_0$
$p^{(0)}({\text{v}}_2)\equiv {\text{v}}_2$
$p^{(1)}({\text{v}}_2)={\text{v}}_0$
$p^{(0)}({\text{v}}_0)\equiv {\text{v}}_0$
针对该树, 将代码中的变量值写出来 (特别是 parent 数组).
$\mathrm{n}=6$
$\mathrm{r}=0$
$\mathrm{p}\mathrm{a}\mathrm{r}\mathrm{e}\mathrm{n}\mathrm{t}[0]=-1$
$\mathrm{p}\mathrm{a}\mathrm{r}\mathrm{e}\mathrm{n}\mathrm{t}[1]=0$
$\mathrm{p}\mathrm{a}\mathrm{r}\mathrm{e}\mathrm{n}\mathrm{t}[2]=0$
$\mathrm{p}\mathrm{a}\mathrm{r}\mathrm{e}\mathrm{n}\mathrm{t}[3]=1$
$\mathrm{p}\mathrm{a}\mathrm{r}\mathrm{e}\mathrm{n}\mathrm{t}[4]=1$
$\mathrm{p}\mathrm{a}\mathrm{r}\mathrm{e}\mathrm{n}\mathrm{t}[5]=2$
画一棵三叉树, 并写出它的 child 数组.

c h i l d [ 1 ] = { 2 , 3 , 4 } \mathrm {child[1]} =\{2,3,4\} child[1]={2,3,4}
c h i l d [ 2 ] = { − 1 , − 1 , − 1 } \mathrm {child[2]} =\{-1,-1,-1\} child[2]={−1,−1,−1}
c h i l d [ 3 ] = { − 1 , − 1 , − 1 } \mathrm {child[3]} =\{-1,-1,-1\} child[3]={−1,−1,−1}
c h i l d [ 4 ] = { − 1 , − 1 , − 1 } \mathrm {child[4]} =\{-1,-1,-1\} child[4]={−1,−1,−1}
按照本贴风格, 重新定义树. 提示: 还是应该定义 parent 函数, 字母表里面只有一个元素.
Let $\varphi$ be the empty node, a tree is a quadruple $T=(\Sigma ,\mathbf{V},r,p)，$where
$\mathbf{V}$ is the set of nodes;
$r\in \mathbf{V}$ is the root node;
$\Sigma$ is the alphabet;
$c$ : ( V ∪ { ϕ } ) × Σ ∗ :(\mathbf{V} \cup \{\phi\}) \times \Sigma^* :(V∪{ϕ})×Σ∗→ V ∪ { ϕ } \mathbf{V} \cup \{\phi\} V∪{ϕ} satisfying
$\forall v\in \mathbf{V}$, $\exists !s\in {\Sigma }^{\ast }$ st. $p(r,s)=v$
定义一个标签分布系统, 即各标签的值不是 0/1, 而是$\left[0,1\right]$区间的实数, 且同一对象的标签和为 1.
A label distribution system is a tuple $S=(\mathbf{X},\mathbf{Y})$,
where $\mathbf{X}=[x_{ij}{]}_{n\times m}\in {\mathbb{R}}^{n\times m}$is the data matrix, $\mathbf{Y}=[y_{ik}{]}_{n\times l}\in [0,1{]}^{n\times l}$is the label matrix and ${\sum }_{k=1}^l{y}_{ik}=1$ ,$n$ is the number of instances, $m$ is the number of features, and $l$ is the number of labels.