Efficient Frequent Item Set Mining Algorithm Based on Prefix Tree
Jinglian Huang · Jisuanji gongcheng · 2010
Aiming at the problem of low time and space efficiencies for frequent item sets mining,an efficient frequent item sets mining algorithm based on prefix tree is proposed.To ensure the consistence of transactions sequence,the proposed algorithm pre-processes transaction sets to create index table and assign index identity.It creates compact prefix tree with the index information,and mines frequent item sets by bottom-to-up and projection methods.Experimental results show this algorithm has higher mining efficiency and expends less space.