To search, Click below search items. |
| All Published Papers Search Service |
|
|
|
Title |
An Efficient Reduced Pattern Count Tree Method for Discovering Most Accurate Set of Frequent itemsets |
|
Author |
Geetha M, R. J. D’Souza |
| Citation |
Vol. 8 No. 8 pp. 121-126 |
|
Abstract |
Discovery of association rules from large volumes of data is an important Data Mining problem. In this paper a novel method for discovering most accurate set of frequent itemsets using partition algorithm is implemented. This method uses the concept of Reduced Pattern Count Tree, Ladder merging and Reduced Minimum Support to discover most accurate set of frequent itemsets in a single scan of database. This algorithm is a modified version of the existing Partition Algorithm, but leads to the significant reduction in time and disk input/ output, and has lower memory requirements as compared to some of the Existing algorithms. |
|
Keywords |
Frequent itemset, Path, Reduced minimum Support, Reduced Pattern Count Tree |
|
URL |
