An algorithm for mining frequent subgraphs based on associated matrix was proposed.
提出了一种基于关联矩阵的频繁子图挖掘算法。
Then, similar customer groups or relevant Web pages were obtained by measuring the similarity between column vectors or between row vectors of the associated matrix.
然后,对所建立关联矩阵的列向量或行向量进行相似性度量,获得相似客户群体或相关页面。
Then, similar customer groups or relevant Web pages were obtained by measuring the similarity between column vectors or between row vectors of the associated matrix.
然后,对所建立关联矩阵的列向量或行向量进行相似性度量,获得相似客户群体或相关页面。
应用推荐