subgraphs
英[ˈsʌbɡrɑːf]
美[ˈsʌbɡræf]
双语例句
- 1. The construction theorem of spanning subgraphs is proved.
- 证明了生成子图的构造定理。
youdao
- 2. In this paper, spanning subgraphs and its counting theorem are given.
- 给出了生成子图和生成子图的计数定理。
youdao
- 3. An algorithm for mining frequent subgraphs based on associated matrix was proposed.
- 提出了一种基于关联矩阵的频繁子图挖掘算法。
youdao
- 4. Therefore it is imperative to improve the efficiency of mining the frequent subgraphs.
- 随着图的广泛应用,图的规模不断扩大,因此提高频繁子图挖掘效率势在必行。
youdao
- 5. The subgraphs of a forest graph, such as adjacent forest graphs and leaf exchange forest graphs, are studied.
- 研究了森林图的子图:邻接森林图和叶交换森林图。
youdao
- 6. The number of 3-nodes connected induced subgraphs S3(G) in a graph G plays a important role in the reliability of a network.
- 一个图G中所含的三结点连通导出子图的个数记为S_3(G),它在网络可靠性中起着重要作用。
youdao
- 7. To solve the above two problems, authors propose a new depth-first algorithm to discover weighted maximal frequent subgraphs only.
- 为解决上述问题,提出了一种深度优先的挖掘加权最大频繁子图的新算法。
youdao
- 8. In this paper, we use the reconstructibility of weighted nuclear subgraphs and it is proved that connected graphs are reconstructible.
- 本文我们利用带权核子图的可重构性证明了连通图是可重构的,从而证明了重构猜想为真。
youdao
- 9. In this paper, the topological properties of molecules are discussed by using subgraphs induced from molecular graph as the basic graph.
- 本文以分子图的导图为基本图来讨论分子的拓扑性质。
youdao
- 10. Finally, for the spectral radius of a graph with a cut vertex, we give an inequality concerning the spectral radius of the graph and its subgraphs.
- 最后,对于有割点的图的谱半径给出一个与子图的谱半径有关的一个不等式。
youdao
- 11. Secondly, we processed the edge expansion and frequent sub-graph isomorphism which are the most complexity parts of frequent subgraphs mining in parallel.
- 其次,将频繁子图边扩展及同构判断这部分频繁子图挖掘算法中时间复杂度最高的部分并行处理。
youdao
- 12. An alternate way to solve these problems is to represent the transactions of those domains by graph, and find the frequent subgraphs by using graph-based data mining techniques.
- 一种解决的方法就是用图的形式表示这些领域的事务,然后利用基于图论的数据挖掘技术发现频繁子图。
youdao
- 13. We consider three types of probability measures on Q, the set of subgraphs of g, which govern a random spanning tree, a random spanning forest, and a random connected subgraph respectively.
- 本文研究图g的子图空间g上的三类概率测度,它们分别刻画图的随机扩张树,随机扩张森林和随机连通子图。
youdao
- 14. Aiming at this problem, graph based link discovery technology, which compresses the fund exchange graph by frequent subgraphs, can detect the criminal pattern of groups with illegal fund exchanges.
- 针对这一问题,采用基于图的链接发现技术,利用频繁子图对资金交易图进行压缩,可以有效地侦测群体的异常资金交易结构。
youdao
- 15. Aiming at this problem, graph based link discovery technology, which compresses the fund exchange graph by frequent subgraphs, can detect the criminal pattern of groups with illegal fund exchanges.
- 针对这一问题,采用基于图的链接发现技术,利用频繁子图对资金交易图进行压缩,可以有效地侦测群体的异常资金交易结构。
youdao
百度翻译
有道翻译