An algorithm of locating order mining based on sequence number

At present, existing association rules mining algorithms have redundant candidate frequent itemsets and repeated computing. This paper proposes an algorithm of locating order mining based on sequence number, which is suitable for mining long frequent itemsets. In order to fast search long frequent itemsets, the algorithm adopts not only traditional down search, but also the method of locating order of subset to generate candidate frequent itemsets. It has two aspects, which are different from traditional down search mining algorithm. One is that the algorithm need locate order of subsets of non frequent itemsets via down search. The other is that the algorithm uses character of attribute sequence number to compute support for only scanning database once. The algorithm may efficiently delete repeated L-candidate frequent itemsets generated by (L+1)-non frequent itemsets via locating subsets´ order, whose efficiency is improved. The result of experiment indicates that the algorithm is suitable for mining long frequent itemsets, and it is faster and more efficient than present algorithms of mining long frequent itemsets.