最后，综合前面几章的内容，给出了基于矩阵的关联规则更新算法。
Finally, concluding the contents of former chapters, it raised a updating algorithm of matrix-based association rule.
本文主要对典型的关联规则更新算法FUP及FUP进行分析、探讨和评价。
In this paper, the author mainly explores, analyzes and evaluates the algorithms FUP and FUP for association rules updating.
该文研究了关联规则更新的第一类问题，即数据库记录增加时的关联规则更新问题。
The article introduces some research work about the first type of association rules updating, that is, the association rules updating problem when the database record increases.
摘 要：在增量式关联规则更新算法的研究中，关于负增量式更新算法的研究比较少。
Absrtact: In the study of updating algorithm for incremental association rules, litde research has been done on the negative incremental updating algorithm.
提出了一种实用的在支持度和置信度不变的情况下数据集规模减小的负增量关联规则更新算法。
Provides a practical updating algorithm for negative incremental association rules in which the size of data sets is reduced, with the supporting and confidence limits unchanged.
更新负载均衡器中的规则来切断这些名称，并关联合适的后端服务器。
The rules at the load balancer are then updated to key off these names and associate the proper back-end servers.
由于这个示例程序并没有与组件关联任何有效性验证规则(在下一篇文章中我们将介绍这种特性)，因此您可以继续进入更新模型值的阶段了。
Since this example application doesn't have validators associated with the components (I'll introduce this feature in the next article), you'll simply advance to the update model values phase.
数据挖掘是当今国际人工智能和数据库研究的新兴领域，而关联规则的更新是数据挖掘的一个重要研究内容。
Data mining is a new emerging area for the research of artificial intelligence and databases, in which incremental updating of association rules is an important research topic.
论文研究了事务数据库记录增加时关联规则的更新问题。
The article introduces some research about association rules updating when the database records increase.
该文提出一个新的维护算法，用来解决关联规则的更新维护问题。
In this paper, one new maintenance algorithm is presented for the efficient maintenance problem of association rules.
传统的关联规则挖掘算法对更新的数据集按平等一致的方式加以处理。
The date-set are managed equally and conformably in the traditional association rule mining algorithm.
提出了一种新的增量更新策略，用来解决这一关联规则的高效维护问题。
In this paper, one new incremental updating strategy is presented for such efficient maintenance problem of association rules.
并对关联规则中的增量更新问题进行了分析，提出了在最小支持度和最小可信度都不变的情况下解决方法。
Additionally, the incremental update issues have been discussed and a solution is presented without the change of minimum supporting degree and minimum trust degree.
本文的研究工作主要包括以下两个方面：一方面，提出了基于数据库变化的关联规则增量式更新算法。
The work of author mainly focuses on two aspects in the following:On one hand, an incremental updating algorithm for mining association rules based on the change of database is proposed.
提出了一种新的量化关联规则挖掘算法QAR及其增量式更新算法IUQAR。
A novel algorithm, QAR, for mining quantitative association rules and an incremental updating algorithm, IUQAR, are proposed.
通过对挖掘关联规则增量更新中FUP算法的关键思想以及性能进行了研究，提出了改进的FUP算法SFUP。
An improved incremental updating algorithm SFUP is developed based on study of the principle and efficiency of FUP algorithm.
目前已经提出了许多用于高效地发现大规模数据库中的关联规则的算法，而对已发现规则的更新及维护问题的研究却较少。
There have been many algorithms proposed for efficient discovery of association rules in large databases. However, little work has been done on maintenance of discovered association rules.
目前已经提出了许多用于高效地发现大规模数据库中的关联规则的算法，而对已发现规则的更新及维护问题的研究却较少。
There have been many algorithms proposed for efficient discovery of association rules in large databases. However, little work has been done on maintenance of discovered association rules.
应用推荐