go top

frequent sub-graph mining

网络释义专业释义

  频繁子图挖掘

... Apriori-based Graph Mining Apriori的图挖掘 frequent sub-graph mining 频繁子图挖掘 Graph-Based Data Mining 基于图的数据挖掘 ...

基于1个网页-相关网页

  • 频繁子图挖掘 - 引用次数:3

    In order to resolve the problem of traditional Apriori algorithm that exists redundancy subgraphs when mining frequent subgraph, a new frequent subgraph mining algorithm called GAI is proposed.

    传统Aprior频繁子图挖掘算法中存在大量冗余子图

    参考来源 - 一种新的频繁子图挖掘算法

·2,447,543篇论文数据,部分数据来源于NoteExpress

双语例句

  • Secondly, we processed the edge expansion and frequent sub-graph isomorphism which are the most complexity parts of frequent subgraphs mining in parallel.

    其次,将频繁子图扩展同构判断这部分频繁挖掘算法时间复杂度最高的部分并行处理

    youdao

更多双语例句
$firstVoiceSent
- 来自原声例句
小调查
请问您想要如何调整此模块?

感谢您的反馈,我们会尽快进行适当修改!
进来说说原因吧 确定
小调查
请问您想要如何调整此模块?

感谢您的反馈,我们会尽快进行适当修改!
进来说说原因吧 确定