The definitions and properties of fuzzy constraint are discussed , and based on its properties , the spaces of itemsets and transactions are pruned , thus improving the mining efficiency 讨论了模糊约束的定义和性质，并根据其性质对项集空间和事务空间进行剪枝，以提高挖掘效率。
And a pruning approach is proposed , when restrict ecl only to classification . classification rule induced from the pruned classification ecl is superior to those from decision tree in quality 基于这种剪枝后的格结构(分类剪枝格)挖掘的分类规则在规则质量等方面具有良好的性能。
In addition , we show how to generate all high confidence rules from an example database of transactions based on fcsl , and propose the relevant algorithm for rule mining and pruning 另外，针对频繁概念子格结构的特点，进行了相关的关联规则提取的研究，并给出了规则发现和剪枝算法。
So i moved the already grown plants outside and put them in front of the temple . everyone passing by could just take them home , and because i had no more room ; i had to sleep sitting up 然后我必须继续剪枝，但找不到更多盆罐来种，我就把已经长大的那几棵搬到外面，放在寺庙前，让路过的人带回家去。
It grew so much that i had to cut some of it and put it into another pot that i found outside , or into any plastic cup or bottle that i found ; and then i cut another . and another one grew again 原先它在一个像这样的小花盆里，又黄又枯，结果长得这么大，我必须替它剪枝，再种到我从外面找到的花盆或塑胶杯塑胶罐里。
A new pruning algorithm based on curve tracing was proposed , which can follow the backbone of the light stripe to find out the branches , and then eliminates branches and produce a high - quality skeleton 为此提出了一种基于曲线追踪技术的剪枝算法，在分枝点处，根据光刀主干的走向找出分枝，从而快速有效的将这些分枝剔除，使最后得到的线条满足骨架的要求。
These algorithms search the p / s ( publication / subscription ) tree using a heuristic pruning method to discover object instances with high efficiency , and generate the sending templates to facilitate the reflection of attributes updating 这些算法使用启发信息和剪枝条件搜索公布订购树，生成发送模板，提高了发现对象的搜索效率和数据更新时的反射发送效率。
As to solving related regular increments upgrade problem , stored the assembling itemset of the original data set and the new data set in the middle table . then used minimum support to cut on the itemset , found the frequent set 对于关联规则的增量更新问题，提出采用中间表中存储原数据集项集和新数据集项集的集合，然后在此集合上使用最小支持度进行剪枝，找到频繁集。
On page purification module , we describe a web page as a dom tree , and introduce the number of chinese punctuation into the weight of page content . by means of pruning the dom tree , noises of the web page can be reduced 在网页净化技术说明中,我们将网页表示成一颗dom树,并首次将中文标点符号数引入到衡量网页正文的权重中,通过对dom树不断的剪枝,极大的减少了网页的噪音。
With the tests on artificial data and biological data , sca guaranteed to find the potential patterns in given sequence if they existed , and with scc as pruning rule , sca could accomplish the search in less time and with less memory 通过仿真数据和生物数据的测试,该算法能确保发现序列中蕴含的所有模式,同时由于将信号相容性条件作为剪枝准则,该算法具有计算时间短,占用内存少的优点。
