Advertisement

Incremental Mining with Prelarge Trees

  • Chun-Wei Lin
  • Tzung-Pei Hong
  • Wen-Hsiang Lu
  • Been-Chian Chien
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5027)

Abstract

In the past, we proposed a Fast Updated FP-tree (FUFP-tree) structure to efficiently handle new transactions and to make the tree-update process become easy. In this paper, we propose the structure of prelarge trees to incrementally mine association rules based on the concept of pre-large itemsets. Due to the properties of pre-large concepts, the proposed approach does not need to rescan the original database until a number of new transactions have been inserted. Experimental results also show that the proposed approach has a good performance for incrementally handling new transactions.

Keywords

data mining association rule FP-tree pre-large tree incremental mining 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Agrawal, R., Imielinksi, T., Swami, A.: Mining association rules between sets of items in large database. In: The ACM SIGMOD Conference, pp. 207–216 (1993)Google Scholar
  2. 2.
    Agrawal, R., Srikant, R.: Fast algorithm for mining association rules. In: The International Conference on Very Large Data Bases, pp. 487–499 (1994)Google Scholar
  3. 3.
    Agrawal, R., Srikant, R.: Fast algorithm for mining association rules. In: The International Conference on Very Large Data Bases, pp. 487–499 (1994)Google Scholar
  4. 4.
    Agrawal, R., Srikant, R.: Mining sequential patterns. In: The Eleventh IEEE International Conference on Data Engineering, pp. 3–14 (1995)Google Scholar
  5. 5.
    Agrawal, R., Srikant, R., Vu, Q.: Mining association rules with item constraints. In: The Third International Conference on Knowledge Discovery in Databases and Data Mining, pp. 67–73 (1997)Google Scholar
  6. 6.
    Fukuda, T., Morimoto, Y., Morishita, S., Tokuyama, T.: Mining optimized association rules for numeric attributes. In: The ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pp. 182–191 (1996)Google Scholar
  7. 7.
    Han, J., Fu, Y.: Discovery of multiple-level association rules from large database. In: The Twenty-first International Conference on Very Large Data Bases, pp. 420–431 (1995)Google Scholar
  8. 8.
    Han, J., Pei, J., Yin, Y.: Mining frequent patterns without candidate generation. In: The 2000 ACM SIGMOD International Conference on Management of Data, pp. 1–12 (2000)Google Scholar
  9. 9.
    Hong, T.P., Wang, C.Y., Tao, Y.H.: A new incremental data mining algorithm using pre-large itemsets. In: Intelligent Data Analysis, pp. 111–129 (2001)Google Scholar
  10. 10.
    Hong, T.P., Lin, C.W., Wu, Y.L.: Incrementally fast updated frequent pattern trees. Expert Systems with Applications (to appear)Google Scholar
  11. 11.
    Mannila, H.T., Verkamo, A.I.: Efficient algorithm for discovering association rules. In: The AAAI Workshop on Knowledge Discovery in Databases, pp. 181–192 (1994)Google Scholar
  12. 12.
    Park, J.S., Chen, M.S., Yu, P.S.: Using a hash-based method with transaction trimming for mining association rules. IEEE Transactions on Knowledge and Data Engineering, 812–825 (1997)Google Scholar
  13. 13.
    Zheng, Z., Kohavi, R., Mason, L.: Real world performance of association rule algorithms. In: The International Conference on Knowledge Discovery and Data Mining, pp. 401–406 (2001)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Chun-Wei Lin
    • 1
  • Tzung-Pei Hong
    • 2
    • 3
  • Wen-Hsiang Lu
    • 1
  • Been-Chian Chien
    • 4
  1. 1.Department of Computer Science and Information EngineeringNational Cheng Kung UniversityTainanTaiwan, R.O.C.
  2. 2.Department of Computer Science and Information EngineeringNational University of KaohsiungKaohsiungTaiwan, R.O.C.
  3. 3.Department of Computer Science and EngineeringNational Sun Yat-sen UniversityKaohsiungTaiwan, R.O.C.
  4. 4.Department of Computer Science and Information EngineeringNational University of TainanTainanTaiwan, R.O.C.

Personalised recommendations