In lacs , considering the characteristics of classification , we suggest two pruning strategies to confine the generation of concept nodes in the procedure of building concept lattice so that the number of nodes generated decreases greatly 在lacs系统中，针对分类系统的特点，我们提出两合肥工业大学博士学位论文种重要而有效地剪枝策略来限制格构造过程中的节点生成，从而大大减少了所需生成的格节点数目
So we discuss the mothod that can recongnize the plan of agent may be do . the results of experiment shows that the arithmetic is effective in this paper , and can solve the new problem under the frame of flexible planning 本文考虑由于灵活规划可以得到多个规划解的特性,在剪枝后仍可能存在多个符合条件的规划解,因此,我们的算法可以得到并存储规划解集合,并在得出的规划解集合中进一步限定agent可能采用的规划。
( 2 ) the reasonable describing about dynamic fuzzy decision tree from attributes treatment to building the tree and then pruning tree , and it provides a certain extent stated theory foundation for ulteriorly researching dynamic fuzzy decision tree and establishes a main concept frame of dynamic fuzzy decision tree ( 2 )对动态模糊决策树从属性处理到构建以及剪枝给出了合理的描述,形成了动态模糊决策树的基本概念框架。
Ever since its establishment , meihan green service has been operating its business centered on selling and planting seedlings of japanese anise illicium anisatum and sasaki cleyera japonica , and thinning and pruning of japanese cedar cryptomeria japonica and japanese cypress chamaecyparis obtusa 有效防止动物侵入农田所造成的灾害从当初设立开始以芥草，杨桐的鲜花及苗木的种植，杉，扁柏的间伐，剪枝为主体进行试验。
There are a lot of burrs and branches after thinning the binary image of the light stripe , which will heavily affect the accuracy of the line - structure - light 3d shape measurement , so burrs and branches must be cut at first 摘要在采用线结构光进行三维测量的过程中，将光刀图像细化后得到的骨架会出现许多毛刺和分枝，而光刀图像骨架的位置和形状将会直接影响到测量的精度，为了能够得到一条光顺并具有单一连通性的骨架，必须对其进行剪枝处理。
This paper presents a comprehensible mathematics description of the joint probabilistic data association ( jpda ) algorithm . in order to reduce the time ? pace complexity of the jpda algorithm , the method of dividing validation matrix based on the . back track ? pruning technique is proposed in this paper 本文以易于理解的方式给出联合概率数据关联（ jpda ）算法一个清晰的数学描述，并提出基于回溯剪枝技术拆分有效矩阵，以降低jpda计算的时空复杂度。
According to some strategy , dcm divides frequent itemsets lk into three non - intersect subsets thus the generation of most candidates can be localized in each individual subset and some unnecessary interactions between subsets are avoided ; moreover , most of the cut - off actions are also localized in each subset and we do n ' t need to scan the whole set lk as before 这样，大部分候选项目集的生成可以分别在这三个子集上进行，从而避免一些子集之间的连接；同时大部分的剪枝也可以分别局限在每个子集上单独进行检索，避免在整个l _ k搜索而耗费时间。
In this paper , we discuss the problem of mining association rules based on the qrrecl , and describ a formal framework for rapid generation of association rules . we study the methods to construct frequent concept sub - lattice ( fcsl ) using dynamic pruning technique and static pruning technique respectively , and develop the algorithms for building fcsl 本文以量化相对约简格模型为基础，分析了量化相对约简格和关联规则发现之间的关系，描述了基于量化相对约简格进行关联规则的快速发现的理论框架，讨论了通过对量化相对约简格结构分别进行动态剪枝和静态剪枝生成频繁概念子格的思想，并给出了相应的构造算法。
In loose allwool garments with harris tweed cap , price 8 6 , and useful garden boots with elastic gussets and wateringcan , planting aligned young firtrees , syringing , pruning , staking , sowing hayseed , trundling a weedladen wheelbarrow without excessive fatigue at sunset amid the scent of newmown hay , ameliorating the soil , multiplying wisdom , achieving longevity 浇水，剪枝，用桩撑起，播种牧草种籽。日暮时分，在新割牧草的一片清香弥漫中，在不过分劳累下，推着那堆满了杂草的低矮的独轮车，改良着土壤，不断丰富着知识，获得长寿。
