Analysis and Improvement of Eclat Algorithm
Jianmin Chen · Jisuanji gongcheng · 2010
Although level transaction database is adopted in present association rules mining algorithms,plump transaction database has advantage over level transaction database.While Eclat algorithm shows when the Tidsets are very large,this step consumes a lot of time and memories.Contra posed this fault,a new improvement algorithm——Declat is presented.The algorithm applies the method of division to Eclat,reduces the Tidset's quantity when operate intersects;proposes a priority constraint,reduces the local frequent itemsets' quantity.Experimental result shows that the improved algorithm has ligher efficiency than the Eclat algorithm.