Title:
MiningAlgorithmsofN-MostFrequentItemsets
Download
Description: Frequent itemsets mining algorithm for calculating the complexity and frequent itemsets generated by the number of sets with the affairs of an exponential increase in the number of growth, minimum support threshold to become the key to control this growth. However, the practical application using only support threshold difficult to effectively control the scale of frequent itemsets. For this reason the definition of N most frequent itemsets mining problem and based on support for dynamic adjustment of the threshold strategy-first search algorithm Apriori width and depth-first search algorithm IntvMatrix Mining N most frequent itemsets. Experiments show that the two kinds of methods than the simple method of high-efficiency 2 times more, particularly when the N value is low, the efficiency advantages of this method is more obvious.
File list (Check if you may need any files):
