In this paper, we use maximal itemsets to represent itemsets in a database. We show that the set of supreme covers, which are the maximal itemsets whose proper subsets are not maximal itemsets, induces an equivalence relation on the set itemsets. Based on maximal itemsets, we propose a large itemset generation algorithm with dynamic support, which runs in time O(M′2 N +MlogM), where N is the maximum number of items in a maximal itemset, M′ is the number of the maximal itemsets with minimum support greater than the required support, and M is the number of the maximal itemsets.


Equivalence Relation Association Rule Minimum Support Association Rule Mining Mining Sequential Pattern 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Agrawal, R., Imielinksi, T., Swami, A.: Mining association rules between sets of items in large database. In: ACM SIGMOD conference, Washington DC, USA, pp. 207–216 (1993)Google Scholar
  2. 2.
    Agrawal, R., Imielinksi, T., Swami, A.: Database mining: a performance perspective. IEEE Transactions on Knowledge and Data Engineering 5(6), 914–925 (1993)CrossRefGoogle Scholar
  3. 3.
    Arawal, R., Srikant, R.: Fast algorithm for mining association rules. In: ACM International conference on Very Large Data Bases, pp. 487–499 (1994)Google Scholar
  4. 4.
    Agrawal, R., Srikant, R.: Mining sequential patterns. In: IEEE International Conferences on Data Engineering, pp. 3–14 (1995)Google Scholar
  5. 5.
    Brin, S., Motwani, R., Ullman, J.D., Tsur, S.: Dynamic itemset counting and implication rules for market basket data. In: ACM SIGMOD Conference, Tucson, Arizona, USA, pp. 255–264 (1997)Google Scholar
  6. 6.
    Cheung, D.W., Han, J., Ng, V.T., Wong, C.Y.: Maintenance of discovered association rules in large databases: an incremental updating approach. In: IEEE International Conference on Data Engineering, pp. 106–114 (1996)Google Scholar
  7. 7.
    Cheung, D.W., Lee, S.D., Kao, B.: A general incremental technique for maintaining discovered association rules. In: Proceedings of Database Systems for Advanced Applications, Melbourne, Australia, pp. 185–194 (1997)Google Scholar
  8. 8.
    Feldman, R., Aumann, Y., Amir, A., Mannila, H.: Efficient algorithms for discovering frequent sets in incremental databases. In: ACM SIGMOD Workshop on DMKD, USA, pp. 59–66 (1997)Google Scholar
  9. 9.
    Hong, T.P., Wang, C.Y., Tao, Y.H.: A new incremental data mining algorithm using pre-large itemsets. International Journal on Intelligent Data Analysis (2001)Google Scholar
  10. 10.
    Lee, H.-S.: Incremental Association Mining Based on Maximal Itemsets. In: Khosla, R., Howlett, R.J., Jain, L.C. (eds.) KES 2005. LNCS (LNAI), vol. 3681, pp. 365–371. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  11. 11.
    Sarda, N.L., Srinvas, N.V.: An adaptive algorithm for incremental mining of association rules. In: IEEE International Workshop on Database and Expert Systems, pp. 240–245 (1998)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Hsuan-Shih Lee
    • 1
  1. 1.Department of Shipping and Transportation Management, Department of Computer ScienceNational Taiwan Ocean UniversityTaiwan, Republic of China

Personalised recommendations