带有时态约束的多层次关联规则的挖掘

为了适应现实世界数据中数据具有多层次性和时态性的客观情况，在以往关联规则挖掘算法的基础上，提出上具有时态约束的多层次关联规则的挖掘算法，该算法在核心思想是利用统计分析方法，根据用户给定的最小支持度和最小可信度，确定出用户感兴趣的关联规则，实例分析结果表明，该算法与单层次的无时效性的数据挖掘算法相比更有应用价值。

Mining of Multiple Arrangements Association Rules with Tense Restrictions

In order to meet with the fact that all data in the real world possess the characteristic of multi-hierarchic arrangements and tense restrictions, a set of mining algorithms related to sense restriction and multi-hierarchic arrangements association rules is introduced. The core of the algorithm is to make use of minimal support and minimal confidence offered by clients, and of the statistic analysis method to find out the association rules that the clients are most concerned with. With the result of the given example, the efficiency of the algorithm is testified.