Frequent Pattern Mining Using Modified CP-Tree for Knowledge Discovery
Mining frequent pattern from databases is useful for knowledge discovery. In this paper, we propose modified CP-Tree, which scans entire transactions only once and constructs the tree by inserting the transactions one by one. The constructed tree consists of an item list along with its occurrence. In addition, a sorted order of items with its frequency of occurrence is maintained and based on the sorted value, the tree is dynamically rearranged. In rearranging phase, the nodes are rearranged in each branch based on sorted order of items. Each path of the branch is removed from the tree, sorted based on sorted order of items and inserted back as a branch into the tree. We have evaluated the performance of the proposed modified tree on benchmark databases such as CHESS, MUSHROOM and T10I4D100K. It is observed that the time taken for extracting frequent item from the tree is encouraging compared to conventional CP-Tree.
KeywordsFrequent Pattern Mining Modified CP-Tree Knowledge Discovery
Unable to display preview. Download preview PDF.
- 1.Agrawal, R., Imielinski, T., Swami, A.: Mining association rules between sets of items in large databases. In: Proceedings. ACM-SIGMOD International Conference on Management of Data (SIGMOD), Washington, DC, pp. 207–216 (1993)Google Scholar
- 2.Ayan, N.F., Tansel, A.U., Akrun, E.: An efficient algorithm to update large itemsets with early pruning. In: Proceedings of the Fifty ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 287–291 (1999)Google Scholar
- 3.Cheung, D.W., Lee, S.D., Kao, B.: A general incremental technique for maintaining discovered association rules. In: Proceedings of the Fifth International Conference on Database Systems for Advanced Applications, pp. 185–194 (1997)Google Scholar
- 4.Cheung, W., Za, O.R.: Incremental mining of frequent patterns without candidate generation or support constraint. In: Proceedings of the Seventh International Database Engineering and Applications Symposium, IDEAS 2003 (2003)Google Scholar
- 5.Han, J., Pei, J., Yin, Y.: Mining frequent patterns without candidate generation. In: Proceedings of the ACM SIGMOD International Conference on Management of Data, pp. 1–12 (2000)Google Scholar
- 7.Koh, J.-L., Shieh, S.-F.: An efficient approach for maintaining association rules based on adjusting FP-tree structures. In: Lee, Y., Li, J., Whang, K.-Y., Lee, D. (eds.) DASFAA 2004. LNCS, vol. 2973, pp. 417–424. Springer, Heidelberg (2004)Google Scholar