An algorithm for mining frequent subgraphs based on associatedmatrix was proposed.
提出了一种基于关联矩阵的频繁子图挖掘算法。
2
You may wish to compute the padding as a function of the number of groups (the number of rows or columns in the associatedmatrix).
你可能希望计算填充是分组数量(关联矩阵中行和列的数量)的函数。
3
Then, similar customer groups or relevant Web pages were obtained by measuring the similarity between column vectors or between row vectors of the associatedmatrix.