SeqARM:An Association Rule Mining Algorithm Based on Sequence Constraint

作     者：Shenshen Bai Department of Information Engineering Lanzhou Vocational Technical College Lanzhou China 730070 

会议名称：《2012 National Conference on Information Technology and Computer Science》

会议日期：2012年

学科分类：12[管理学] 1201[管理学-管理科学与工程(可授管理学、工学学位)] 

关 键 词：association rule sequence constraint SeqARM FI-Tree 

摘      要：Sequence constraint mainly considers the occurrence time of item,which can determine whether an association rule is *** paper proposes a novel algorithm SeqARM that aims to mine strong association rule with sequence constraint and runs on the second phase of association rule *** employs a fine data structure,named FI-Tree,which is used to save and find frequent itemsets according to a few characteristics of association *** work can dramatically reduce the number of invalid association rules,and speed up the procedure of association *** last,the experiments prove that SeqARM can improve the performance and effect of the association rule mining.