Mining in minimum weighted frequent directed subgraphs
计量
- 文章访问数: 115
- HTML全文浏览量: 1
- PDF下载量: 166
引用本文: | 任威. 最小权重有向频繁子图挖掘[J]. 铁路计算机应用, 2013, 22(7): 5-10. |
Citation: | REN Wei. Mining in minimum weighted frequent directed subgraphs[J]. Railway Computer Application, 2013, 22(7): 5-10. |