Design and implementation of improved algorithm for frequent item sets mining

A new frequent item sets mining algorithm based on linked list and stack data structure at the Apriori algorithm´s expensive disadvantage is given in this paper. This method create frequent item sets based on the linked list series and use the stack structure and subset judgment method to judge if the created frequent item sets are the maximum frequent item sets. Through demonstrates we can see that this method is cheap, with high accuracy and can provide some reference for related rules.