An algorithm for mining frequent subgraphs based on associated matrix was proposed.
提出了一种基于关联矩阵的频繁子图挖掘算法。
Therefore it is imperative to improve the efficiency of mining the frequent subgraphs.
随着图的广泛应用，图的规模不断扩大，因此提高频繁子图挖掘效率势在必行。
To solve the above two problems, authors propose a new depth-first algorithm to discover weighted maximal frequent subgraphs only.
为解决上述问题，提出了一种深度优先的挖掘加权最大频繁子图的新算法。
应用推荐