关键词: 基因表达数据 关联规则挖掘 与运算 频繁项集

Abstract:

Based on studying and analyzing the merits and demerits of the classic association rule algorithms and the characteristics of gene expression data, th  is paper proposes a rule mining algorithm based on the subsected AND operation, which can be able to find frequent itemsets without candidate itemsets.  The experiment results show that the algorithm can mine frequent itemsets more effectively and faster.

Key words: （gene expression data, association rule minlng, and operatlon, frequent itemset）