Thus a complete pruning algorithm for the morphological skeleton is achieved.
至此设计出了一套完整的针对形态学骨架的剪枝算法。
A pruning algorithm based on entropy theory for designing BP neural network structure is proposed.
提出了一种基于熵理论的BP神经网络结构设计修剪算法。
An optimized direct hashing and pruning algorithm is proposed based on minimal perfect Hash scheme.
提出了一种基于最小完美哈希函数的关联规则的挖掘算法。
Pruning algorithm is an important method to set up and optimize the structure of neural network model.
修剪法是确定和优化神经网络结构的重要方法之一。
A pruning algorithm based on the principle of Minimum Description Length is applied in the tree-pruning phase.
在树的修剪阶段，采用了一种基于最小描述长度原理的修剪算法。
The initial inverse model of process is built based on least squares support vector machine, and the Numbers of support vector is reduced through pruning algorithm.
初始过程的逆模型，建立了基于最小二乘支持向量机，并通过剪枝算法将支持向量的数量减少。
The simulated experiments show the necessity of pruning the new Emails and the validity of Email-adding algorithm.
模拟的邮件语料添加实验表明了待添加语料裁剪的必要性及添加算法的有效性。
The algorithm improves the generalization performance of feedforward neural networks through combining the regularization and pruning technology.
正则最小二乘算法将正则化网络和节点删除算法结合起来，大大提高了前馈网络的泛化性能。
An incremental construction algorithm named PCCL of the constrained concept lattice was presented by using pruning technology that eliminated the redundant information in the construction process.
采用剪枝技术来消除构造过程中存在的冗余内涵比较，给出约束概念格渐进式构造算法PCCL。
The search strategy of our algorithm integrates a depth-first traversal of the prefix sequence lattice with two effective pruning mechanisms.
算法采用了深度优先挖掘策略，并将基于前缀序列格的深度优先遍历与两种高效的剪枝策略相结合。
An optimization algorithm of RBF Neural Networks based on ant colony clustering and a pruning method is proposed.
提出了一种基于蚁群聚类算法和裁剪方法的RBF神经网络优化算法。
Moreover, this algorithm adopts an effective iterative and pruning strategy that could compress the scale of candidate patterns and reduce the communication cost.
而且，该算法采用了有效的迭代剪枝技术，大大压缩了候选模式的数量，降低了通信代价。
By using the method to improve the ID3 algorithm, experiments show that the algorithm generates smaller decision tree and USES less training time than the algorithm using pre-pruning method.
利用该方法对基本ID 3决策树算法进行了改进。分析和实验表明，与先剪枝方法相比，该方法能进一步减小决策树的规模和训练时间。
By using the method to improve the ID3 algorithm, experiments show that the algorithm generates smaller decision tree and USES less training time than the algorithm using pre-pruning method.
利用该方法对基本ID 3决策树算法进行了改进。分析和实验表明，与先剪枝方法相比，该方法能进一步减小决策树的规模和训练时间。
应用推荐