本文研究了概率影响图的关联矩阵表示和矩阵变换方法，并给出了完整的计算机实现方法。
This paper studies the description and transformations of incidence matrix of PID, and discussed in detail the steps of programming by computer.
提出了一种基于关联矩阵的频繁子图挖掘算法。
An algorithm for mining frequent subgraphs based on associated matrix was proposed.
给出了变异特征属性邻接图和边面关联矩阵，表达了变异特征组成面之间的有机联系。
The attribute adjacent graphics and the interrelated matrix for edge and face of variation feature were given. The organic relation between component faces of variation feature was expressed.
应用推荐