Abstract: Based on the pattern information protecting lemma, a frequent pattern stack transform algorithm is proposed, which can be used to effectively mine the association rules without candidate generation The algorithm uses a frequent pattern stack structure to store all the frequent pattern information and gets the frequent item sets through a stack transform In the middle of the paper, a particular description of the stack’s construction and transform algorithm is presented, and finally, the performance analysis and comparison experiments are done The result shows the algorithm is excellent