中文摘要：

提出了一种基于频繁模式矩阵（FP-array）的约束最大频繁项目集挖掘及其更新算法。算法只扫描事务数据库一遍．把满足约束条件的所有事务转换成一个频繁模式矩阵，显著缩小了FP-array的大小规模。挖掘过程采用逻辑运算．在效率上有独特的优势。实验结果表明该算法是快速有效的。

英文摘要：

This paper presents an effective algorithm for mining constrained maximum frequent itemsets and its update, update constrained maximum frequent itemsets algorithm, based on a novel frequent pattern array （FP-array） structure. The main concept of this algorithm is to convert all transactions that satisfy given conditions into a FP-array through scanning the database only once. The size of the FP-array is greatly reduced. As the mining process adopts logic operation, it has predominance in efficiency. A experiment is used to verify its mining effectiveness.