The algorithm is based on row enumeration, which can find high-utility long itemsets directly by intersecting long transactions, without extending short itemsets step by step.
该算法基于行枚举，通过长事务的交集运算，直接得到长项集，不必从短项集逐步扩展得到长项集。
We also present an algorithm based on implicit enumeration and simplex method on network.
在求解算法上，提出隐枚举法与网络单纯形法相结合的求解方法。
In this paper, the problem of multi-centres in a network is solved using implicit enumeration method for 0-1 integer programming. The algorithm is simple and can be easily realized.
本文提出用0 - 1整数规划的隐枚举法，求解网络的多中心问题，算法简单，容易实现。
Among these three categories a possible common subtree algorithm is presented based on the enumeration tree technique of data mining domain.
本文深入探讨了每类算法中的代表算法，其中根据数据挖掘中枚举树相关技术提出了一种可能的公共子树查找算法的思想。
The algorithm is an improved greedy algorithm which combined the part of enumeration method with the greedy algorithm, thus to make it a better performance guarantee.
给出了求解一类具有简单约束的上模集函数最小值问题的一种局部搜索法，并讨论了所给算法的性能保证。
Mainly studied the system connectivity, the status switching and so on, and putting forward the optimization algorithm for state enumeration method combined with the power network model.
着重研究了系统的连通性、状态切换等几个问题，并结合电网模型对状态枚举算法提出了优化策略。
An enumeration method was used to get the optimal splitting of the candidate branches. A modified discrete particle swarm optimization algorithm (MDPSO) was used to get the final strategy.
根据限流措施优化配置问题的特点，提出先对候选可开断支路采用枚举法求解支路开断的优化方案，再采用改进离散粒子群算法(MDPSO)求解综合限流方案。
An enumeration method was used to get the optimal splitting of the candidate branches. A modified discrete particle swarm optimization algorithm (MDPSO) was used to get the final strategy.
根据限流措施优化配置问题的特点，提出先对候选可开断支路采用枚举法求解支路开断的优化方案，再采用改进离散粒子群算法(MDPSO)求解综合限流方案。
应用推荐