文中讨论了基于相关性矩阵的测试点优化方法和故障诊断树的生成方法。
The problems of optimal test point selection and optimal diagnosis tree generation are discussed in this paper.
通过引入一个合适的相关性矩阵，用户期望关注的最相关的文章被首先列出。
By introducing an appropriate relevance metric, the most relevant articles on which the user wishes to focus are listed first.
另外还提出一种新的对系数矩阵a分块的列分解策略，该策略基于每块的列相关性估计而得出。
In addition we present a new column partition strategy, based on the estimate of column-dependence of each block, to divide the coefficient matrix a.
应用推荐