2021夏数学表达式魔训(2)

数学表达式魔训

Day 5

5.1 图与网络

Definition :An undirected network is a tuple $G=(\mathbf{V},\mathbf{E},\mathbf{W})$, where $\mathbf{V}$ is the set of nodes, $\mathbf{E}\subseteq \mathbf{V}\times \mathbf{V}$, where $(v_i,v_j)\in \mathbf{E}\iff (v_j,v_i)\in \mathbf{E}$ is the set of edges.
$w_{ij}\in \mathbf{W}$ is the weighted of $(v_i,v_j)$, where $w_{ij}=w_{ji}$.

5.2 树

1. Let $\varphi$ be the empty node, a tree is a triple $T=(\mathbf{A},r,p)$ where
   ∙ A = { A 0 , A 1 , … , A 6 } ≠ ϕ \bull \mathbf{A} =\{A_0, A_1, \dots, A_6\}\neq\phi ∙A={A0​,A1​,…,A6​}​=ϕ is the set of nodes;
   $\bullet r\in \mathbf{A}$ is the root node;
   ∙ p : A → A ∪ { ϕ } \bull p: \mathbf{A} \to\mathbf{A} \cup\{\phi\} ∙p:A→A∪{ϕ} is the parent mapping satisfying;
      $\bullet p(r)=\varphi$
      $\bullet \forall a\in \mathbf{A},\exists !n\ge 0,\text{ st. }{p}^{(n)}(a)=r$
2. n=6；root=0；
   parent[0]=-1; parent[1]=0; parent[2]=0; parent[3]=1;
   parent[4]=1; parent[5]=2; parent[6]=2;
   code:

public class Tree {
	/**
	 * 节点数. 表示节点 A_0 至 A_{n-1}.
	 */
	int n;
	
	/**
	 * 根节点. 0 至 n-1.
	 */
	int root;
	
	/**
	 * 父节点.
	 */
	int[] parent;

	/**
	 * 构造一棵树, 第一个节点为根节点, 其余节点均为其直接子节点, 也均为叶节点.
	 */
	public Tree(int paraN) {
		n = paraN;
		parent = new int[n];
		parent[0] = -1; // -1 即 \phi
	}// Of the constructor
}//Of class Tree

5.3 m叉树

1. child 数组：
   { ( 1 , 2 , 3 ) ; ( 4 , − 1 , 5 ) ; ( − 1 , − 1 , 6 ) ; ( − 1 , − 1 , − 1 ) ; ( − 1 , − 1 , − 1 ) ; ( − 1 , − 1 , − 1 ) ; ( − 1 , − 1 , − 1 ) } \{(1, 2, 3); (4, -1, 5); (-1, -1, 6); (-1, -1, -1); (-1, -1, -1); (-1, -1, -1); (-1, -1, -1)\} {(1,2,3);(4,−1,5);(−1,−1,6);(−1,−1,−1);(−1,−1,−1);(−1,−1,−1);(−1,−1,−1)}

2. Let $\varphi$ be the empty node, a tree is a triple $T=(\mathbf{A},r,\Sigma ,c)$ where
   $\bullet \mathbf{A}\ne \varphi$ is the set of nodes;
   $\bullet r\in \mathbf{A}$ is the root node;
   ∙ Σ = { 0 } \bull \Sigma = \{0\} ∙Σ={0} is the alphabet;
   ∙ c : ( A ∪ { ϕ } ) × Σ ∗ → A ∪ { ϕ } \bull c: (\mathbf{A} \cup \{\phi\}) \times \Sigma^{*} \rightarrow \mathbf{A} \cup\{\phi\} ∙c:(A∪{ϕ})×Σ∗→A∪{ϕ} satisfying ;
      $\bullet \forall a\in \mathbf{A},\exists !s\in {\Sigma }^{\ast }\text{ s.t. }c(r,s)=a$

Day 6

6.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, s.t. ${\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.

6.2 示例讲解

${\min }_{{\mathbf{v}}^{(j)}}E\left({\mathbf{v}}^{(j)}\right)={\sum }_{i=1}^{l}L\left(y_i,g^{(j)}({\mathbf{x}}_i)\right)+{\sum }_{i=l+1}^{l+u}{v}_i^{(j)}L\left({\overline{g}}^{(j-1)}({\mathbf{x}}_i),g^{(j)}({\mathbf{x}}_i)\right)$
涵义：在第$j$个视角上，在输入为${\mathbf{v}}^{(j)}$ 的情况下，使模型在标记数据与伪标记数据上的预测损失最小。
优点：简介明了，变量名为出现混用的情况。
缺点：无法一次性讲整个多个视角之间的优化情况写出。