Research on association rules mining algorithm with item constraints
Nan Lu, Wang-Zhe, Chunguang Zhou, Jing-Zhou Zhou · 2005
The issues in the field of association rules mining with specific items are discussed first. To solve the problems in the ordinary algorithm, we put forward a new but efficient mining algorithm with item-constraints, called EclatII. We then give an analysis on the performance of the algorithm as well as on its strategy. The experimental result shows that the Eclatll algorithm is more robust in items of using "low support'"' and "long pattern" association rules than others.