|
[1]R. Agrawal and R. Srikant, “Fast Algorithm for Mining Association Rule in Large Databases,” in Proc. of the 20th International Conference on Very Large Database, 1994. [2]C.C. Chang and Y.C. Li and J.S. Lee "An Efficient Algorithm for Incremental Mining of Association Rules," in Proc. of the 15th Intl. Workshop on Research Issues in Data Engineering: Stream Data Mining and Applications (RIDE-SDMA’05), 2005. [3]J. H. Chang and W. S. Lee, “A Sliding Window Method for Finding Recently Frequent Itemsets over Online Data Streams,” in Proc. of the 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2003. [4]J. H. Chang and W. S. Lee, “A Sliding Window Method for Finding Recently Frequent Itemsets over Online Data Streams,” in Proc. of the 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2003. [5]J. H, Chang and W.S. Lee, “Finding Recent Frequent Itemsets Adaptively over Online Data Streams,” in Proc. of the 9th ACM International Conference on Knowledge Discovery and Data Ming, 2003. [6]D. W. Cheung, J. Han, V. T. Ng, and C. Y. Wang, ”Maintenance of discovered association rules in large databases : an incremental updating technique,” in Proc. of the 12th Intl. Conf. on Data Engineering. New Orleans, LA, Feb. 1996. [7]D. W. Cheung, S. D. Lee, and B. Kao, “A general incremental technique for maintaining discovered association rules”, in Proc. 5th Intl. Conf. on Database Systems for Advanced Applications, Melbourne, Australia, Apr. 1997. [8]J. Han, J. Wang, Y. Lu and P. Tzvetkov, “Mining TopK Frequent Closed Patterns without Minimum Support,” in Proc. of Int. Conference on Data Mining (ICDM’02), 2002. [9]J. Han, J. Pei, and Y. Yin, “Mining Frequent Patterns without Candidate Generation,” in Proc. of the ACM SIGMOD International Conference on Management of Data, pages 1-12, Dallas, Texas, USA, 2000. [10]C.H. Lin and D. Y. Chiu and Y.H. Wu and Arbee L. P. Chen "Mining Frequent Itemsets from Data Streams with a Time-Sensitive Sliding Window," in Proc. of SIAM Intl. Conference on Data Mining, 2005 [11]G.. S. Manku and R. Chen Motwani, “Approximate frequent counts over data Streams,” in Proc. of the 28th International Conference on Very Large Database, Hong Kong, China Aug, 2002. [12]J. Pei, J. Han, and R. Mao "CLOSET : An efficient algorithm for mining frequent closed itemsets," in Proc. of ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery , 2000. [13]S. N. Shin and J. L. Koh , “An Approximate Approach for Mining Recently Frequent Itemsets from Data Streams,” in Proc. of 8th International Conference on Data Warehousing and Knowledge Discovery(DaWaK’06), 2006. [14]S. Thomas, S. Bodagala, K. Alsabti, and S. Ranka, “An efficient algorithm for the incremental updating of association rules in large database,” in Proc. of the 3rd Intl. Conf. on data Mining and Knowledge Discovery, Newport Beach, 1997. [15]K. Wang, L. Tang, and J. Liu, “Top down FP-Growth for association rule mining,” in Porc. of the 6th Pacific Area Conf. on Knowledge Discovery and Data Mining(PAKDD’02), May 2002. [16]K Wang, L. Tang, J. Han, and J. Liu, “Top Down FP-Growth for Association Rule Mining,” in Proc. of the 6th Pacific Area Conference on Knowledge Discovery and Data Mining, May 6-8, Taipei, Taiwan(PAKDD’02), 2002. [17]R.C.W. Wong and A. W.C. Fu "Mining Top-K Itemsets over a Sliding Window Based on Zipfian Distribution," in Proc. of SIAM Int. Conference on Data Mining, 2005. [18]D. Xin, J. Han, X. Yan and H. Cheng, “Mining Compressed Frequent-Pattern Sets,” in Proc. of Int. Conf. on Very Large Data Bases (VLDB'05), 2005. [19]X. Yan, H. Cehng, Jiawei Han, and D. Xin, “Summarizing itemset patterns: a profile based approach,” in Proc. of ACM Intl. Conf. on Knowledge Discovery in Database (KDD’05), 2005.
|