Advertisement

Frequent Pattern Mining Using Modified CP-Tree for Knowledge Discovery

  • R . Vishnu Priya
  • A. Vadivel
  • R. S. Thakur
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6440)

Abstract

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.

Keywords

Frequent Pattern Mining Modified CP-Tree Knowledge Discovery 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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. 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. 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. 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. 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
  6. 6.
    Hong, T.-P., Lin, C.-W., Wu, Y.-L.: Incrementally fast updated frequent pattern trees. Expert Systems with Applications 34(4), 2424–2435 (2008)CrossRefGoogle Scholar
  7. 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
  8. 8.
    Leung, C.K., Khan, Q.I., Li, Z., Hoque, T.: CanTree: a canonical-order tree for incremental frequent-pattern mining. Knowledge and Information Systems 11(3), 287–311 (2007)CrossRefGoogle Scholar
  9. 9.
    Li, X., Deng, X., Tang, S.: A fast algorithm for maintenance of association rules in incremental databases. In: Li, X., Zaïane, O.R., Li, Z.-h. (eds.) ADMA 2006. LNCS (LNAI), vol. 4093, pp. 56–63. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  10. 10.
    Tanbeer, S.K., Ahmed, C.F., Jeong, B.-S., Lee, Y.-K.: Efficient single-pass frequent pattern mining using a prefix-tree. Information Sciences 179, 559–583 (2008)MathSciNetCrossRefzbMATHGoogle Scholar
  11. 11.

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • R . Vishnu Priya
    • 1
  • A. Vadivel
    • 1
  • R. S. Thakur
    • 2
  1. 1.Department of Computer ApplicationsNational Institute of TechnologyIndia
  2. 2.Maulana Azad National Institute of TechnologyIndia

Personalised recommendations