A Fast Algorithm for Mining Maximum Frequent Item Sets
Haisheng Song · Jisuanji yingyong yanjiu · 2004
In this paper,Pincer-Search algorithm is improved,and proposesa new algorithm for mining maximum frequent item sets based on set-enumeration tree.The proposed algorithm makes enough use of bit matrix-stored technology,and combines the bottom-up and top-down.Efficiency of algorithm is more high,cost of I/O and CPU time is reduced remarkably.