Study for Mining Maximally Frequent Item Sets in Association Rule
关联规则中最大频繁项目集的研究

Study the frequent item sets problem for association rule in large business database; propose an efficient new algorithm MMFI in mining maximum frequent item sets. The idea of MMFI is to divide database by level and divide candidate frequent item sets by number. This algorithm is proved that it is efficient to reduce time in compute by mathematics and expriments.