×

集划分 meaning in Chinese

set partition

Examples

  1. Compared with static dataset partition , it can realize the load balance better and improve the efficiency of data mining
    与静态的数据集划分相比,它能更好地实现负载平衡,提高并行数据挖掘的效率。
  2. Among the critical algorithms the technique of dividing task set in . to scheduabletasks and manageabletasks , the algorithm of maximizing scheduabletasks , and the algorithm of optimizing hard real - time tasks are originated by the author
    其中将任务集划分为seheduabletasks和manageabletasks的思想,最大化seheduabletasks算法,硬实时任务的调度优化算法为笔者自行研发。
  3. Since the problem of load balance can not be solved effecfivety by the parallel algorithm for mining association rules , on the basis of cd algorithm , this paper presents a parallel algorithm for mining association rules based on dynamic dataset partition
    摘要针对并行关联规则挖掘算法不能有效的解决负载平衡的问题,在cd算法的基础上,介绍了一种基于动态数据集划分的并行关联规则挖掘算法。
  4. After analyzed the defaults of the fault dictionary method , several techniques to enhance the capability of the d . c . fault dictionary are presented . these include 1 ) using monte carlo analysis to get the node voltage tolerance , 2 ) using bayesian decision theory to direct the fuzzy set dividing , 3 ) selecting nodes by the fuzzy sets , 4 ) using the fault tree to diagnose the circuit ' s fault with varied sum of nodes
    文中分析了字典法存在的问题,提出了改进方法,其中包括:用蒙特卡罗法求各节点电压的容差域;用贝叶斯决策理论来指导模糊集划分;以模糊集为特征进行节点优选;依故障诊断树进行变节点诊断。
  5. If a document is viewed as a combination of basis topics , and every basis topic is represented by a related vector , then it can be categorized as belonging to the topic represented by its principal vector . thus , nmf can be used to organize document collections into partitioned structures or clusters directly derived from the nonnegative factors
    如果将一篇文档看作是由许多文本主题组合而成,而文本主题与语义空间的特征向量相对应的话,则我们可以直接根据nmf算法所提取的特征向量及相对于特征向量各文档的编码向量将文本集划分成不同的类。
More:   Next

Related Words

  1. 通道划分
  2. 业务划分
  3. 图划分
  4. 划分者
  5. 重新划分
  6. 有限划分
  7. 节点划分
  8. 密度划分
  9. 功能划分
  10. 区域划分
  11. 集呼
  12. 集呼, 成组呼叫
  13. 集换式卡片游戏
  14. 集灰
PC Version

Copyright © 2018 WordTech Co.