《《《《《《《《内容已删除》》》》》》》》》

大家在查： Carmichael 约翰•科尔特尔 language_name setCharacterEncoding electrodiagnosis haojiang 特勒雷纳德利先进高档 Soyoung

subgraphs

subgraphs

subgraphs

subgraphs

1

Two or more connected subgraphs of a process model are identified as "critical sections" .

在一个流程里面，两个或者更多的联系子图被定义为临界部分。

2

With the development of structure frequent pattern mining, subgraphs pattern becomes into a new research focus .

跟着构造化频繁模式挖掘的发铺，子图模式挖掘成为新的研讨暖点。

3

In this paper, spanning subgraphs and its counting theorem are given .

给出了生成子图和生成子图的计数定理。

4

Traditional algorithms for frequent subgraphs mining have limits when dealing with biological datasets .

传统的图挖掘算法应用到生物数据上有其局限性。

5

third, tree-structured subgraphs can't convey enough semantic information .

树结构的子图不能表现出足够的语义信息。

6

Moreover , this algorithm also makes tradeoff between time cost and precision according to performance gain of left candidate subgraphs .

此外，还根据剩余候选子图的性能收益对时间与精度进行折中。

8

Compared with the single ant colony algorithm, it can more effectively solve the correlation problem among multiple subgraphs .

与蚁群算法独立搜索比较，分散、递阶蚁群算法能更有效地实现多子图之间的关联。

9

Pyber[1] : Every graph can be covered by at most three odd subgraphs .

提出的问题：任意图可被至多三个奇子图所覆盖。

10

At present , the urgent problem in the field of the mining subgraphs is how to improve the subgraphs mining algorithm efficiency .

目前，子图挖掘范畴中迫切须要解决的题目是，如何提高子图挖掘算法的效力。

热词推荐

大家在看