Algorithm 1. Greedy Algorithm in Model Inference Process

Input: $\mathcal{A}=\left\{a_1,a_2\dots ,a_n\right\}$; ${\mathcal{A}}_p=\left\{I\right\}$;

Output: ${\mathcal{A}}_p$

For $i$ = 2;$i$ ≤ $p$ do

Compute all $F\left({\mathcal{A}}_p+\left\{a_j\right\}\right)$ for $a_j$ in $\mathcal{A}$;

Get $a_j$ that have $\underset{a_j}{\max }F\left({\mathcal{A}}_p+\left\{a_j\right\}\right)$;

${\mathcal{A}}_p={\mathcal{A}}_p+\left\{a_j\right\}$;

$\mathcal{A}=\mathcal{A}-\left\{a_j\right\}$;

end

return ${\mathcal{A}}_p$;