
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Jianyong Wang, Jiawei Han, Ying Lu, Petre Tzvetkov, "TFP: An Efficient Algorithm for Mining TopK Frequent Closed Itemsets," IEEE Transactions on Knowledge and Data Engineering, vol. 17, no. 5, pp. 652664, May, 2005.  
BibTex  x  
@article{ 10.1109/TKDE.2005.81, author = {Jianyong Wang and Jiawei Han and Ying Lu and Petre Tzvetkov}, title = {TFP: An Efficient Algorithm for Mining TopK Frequent Closed Itemsets}, journal ={IEEE Transactions on Knowledge and Data Engineering}, volume = {17}, number = {5}, issn = {10414347}, year = {2005}, pages = {652664}, doi = {http://doi.ieeecomputersociety.org/10.1109/TKDE.2005.81}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Knowledge and Data Engineering TI  TFP: An Efficient Algorithm for Mining TopK Frequent Closed Itemsets IS  5 SN  10414347 SP652 EP664 EPD  652664 A1  Jianyong Wang, A1  Jiawei Han, A1  Ying Lu, A1  Petre Tzvetkov, PY  2005 KW  Data mining KW  frequent itemset KW  association rules KW  mining methods and algorithms. VL  17 JA  IEEE Transactions on Knowledge and Data Engineering ER   
[1] R. Agrawal and R. Srikant, “Fast Algorithms for Mining Association Rules,” Proc. 1994 Int'l Conf. Very Large Data Bases (VLDB '94), pp. 487499, Sept. 1994.
[2] R. Agrawal and R. Srikant, “Mining Sequential Patterns,” Proc. 1995 Int'l Conf. Data Eng. (ICDE '95), pp. 314, Mar. 1995.
[3] Y. Bastide, R. Taouil, N. Pasquier, G. Stumme, and L. Lakhal, “Mining Frequent Patterns with Counting Inference,” SIGKDD Explorations, pp. 6675, vol. 2, 2000.
[4] S.D. Bay and M.J. Pazzani, “Detecting Change in Categorical Data: Mining Contrast Sets,” Proc. 1999 Int'l Conf. Knowledge Discovery and Data Mining (KDD '99), pp. 302306, Aug. 1999.
[5] R.J. Bayardo, “Efficiently Mining Long Patterns from Databases,” Proc. 1998 ACMSIGMOD Int'l Conf. Management of Data (SIGMOD '98), pp. 8593, June 1998.
[6] F. Bonchi, F. Giannotti, A. Mazzanti, and D. Pedreschi, “Exante: Anticipated Data Reduction in Constrained Pattern Mining,” Proc. Seventh European Conf. Principles and Practice of Knowledge Discovery in Databases (PKDD '03), Sept. 2003.
[7] J.F. Boulicaut and A. Bykowski, “Frequent Closures As a Concise Representation for Binary Data Mining,” Proc. 2000 PacificAsia Conf. Knowledge Discovery and Data Mining (PAKDD '00), pp. 6273, Apr. 2000.
[8] J.F. Boulicaut, A. Bykowski, and C. Rigotti, “FreeSets: A Condensed Representation of Boolean Data for the Approximation of Frequency Queries,” Data Mining and Knowledge Discovery, vol. 7, pp. 522, 2003.
[9] S. Brin, R. Motwani, and C. Silverstein, “Beyond Market Basket: Generalizing Association Rules to Correlations,” Proc. 1997 ACMSIGMOD Int'l Conf. Management of Data (SIGMOD '97), pp. 265276, May 1997.
[10] D. Burdick, M. Calimlim, and J. Gehrke, “MAFIA: A Maximal Frequent Itemset Algorithm for Transactional Databases,” Proc. 2001 Int'l Conf. Data Eng. (ICDE '01), pp. 443452, Apr. 2001.
[11] E. Cohen, M. Datar, S. Fujiwara, A. Gionis, P. Indyk, R. Motwani, J.D. Ullman, and C. Yang, “Finding Interesting Associations without Support Pruning,” Proc. 2000 Int'l Conf. Data Eng. (ICDE '00), pp. 489499, Feb. 2000.
[12] A.W.C. Fu, R.W.W. Kwong, and J. Tang, “Mining nMost Interesting Itemsets,” Proc. 2000 Int'l Symp. Methodologies for Intelligent Systems (ISMIS '00), pp. 5967, Oct. 2000.
[13] J. Han and Y. Fu, “Discovery of MultipleLevel Association Rules from Large Databases,” Proc. 1995 Int'l Conf. Very Large Data Bases (VLDB '95), pp. 420431, Sept. 1995.
[14] J. Han, J. Pei, and Y. Yin, “Mining Frequent Patterns without Candidate Generation,” Proc. 2000 ACMSIGMOD Int'l Conf. Management of Data (SIGMOD '00), pp. 112, May 2000.
[15] C. Hidber, “Online Association Rule Mining,” Proc. 1999 ACMSIGMOD Int'l Conf. Management of Data (SIGMOD '99), pp. 145156, June 1999.
[16] Y.K. Lee, W.Y. Kim, Y.D. Cai, and J. Han, “CoMine: Efficient Mining of Correlated Patterns,” Proc. 2003 Int'l Conf. Data Mining (ICDM '03), Nov. 2003.
[17] G. Liu, H. Lu, W. Lou, and J.X. Yu, “On Computing, Storing, and Querying Frequent Patterns,” Proc. 2003 ACM SIGKDD Int'l Conf. Knowledge Discovery and Data Mining (KDD '03), Aug. 2003.
[18] S. Morishita and A. Nakaya, “Parallel BranchandBound Graph Search for Correlated Association Rules,” LargeScale Parallel Data Mining, pp. 127144, 1999.
[19] S. Morishita and J. Sese, “Traversing Itemset Lattice with Statistical Metric Pruning,” Proc. 2000 ACM SIGMODSIGACTSIGART Symp. Principles of Database Systems (PODS '00), pp. 226236, May 2001.
[20] R. Ng, L.V.S. Lakshmanan, J. Han, and A. Pang, “Exploratory Mining and Pruning Optimizations of Constrained Associations Rules,” Proc. 1998 ACMSIGMOD Int'l Conf. Management of Data (SIGMOD '98), pp. 1324, June 1998.
[21] F. Pan, G. Cong, A.K.H. Tung, J. Yang, and M. Zaki, “CARPENTER: Finding Closed Patterns in Long Biological Datasets,” Proc. 2003 ACM SIGKDD Int'l Conf. Knowledge Discovery and Data Mining (KDD '03), Aug. 2003.
[22] N. Pasquier, Y. Bastide, R. Taouil, and L. Lakhal, “Discovering Frequent Closed Itemsets for Association Rules,” Proc. Seventh Int'l Conf. Database Theory (ICDT '99), pp. 398416, Jan. 1999.
[23] J. Pei, J. Han, and R. Mao, “CLOSET: An Efficient Algorithm for Mining Frequent Closed Itemsets,” Proc. 2000 ACMSIGMOD Int'l Workshop Data Mining and Knowledge Discovery (DMKD '00), pp. 1120, May 2000.
[24] F. Rioult, J.F. Boulicaut, B. Cremileux, and J. Besson, “Using Transposition for Pattern Discovery from Microarray Data,” Proc. Eighth ACM SIGMOD Workshop Research Issues in Data Mining and Knowledge Discovery, June 2003.
[25] J. Wang, J. Han, and J. Pei, “CLOSET+: Searching for the Best Strategies for Mining Frequent Closed Itemsets,” Proc. 2003 ACM SIGKDD Int'l Conf. Knowledge Discovery and Data Mining (KDD '03), pp. 236245, Aug. 2003.
[26] K. Wang, Y. He, D. Cheung, and F. Chin, “Mining Confident Rules without Support Requirement,” Proc. 2001 ACM CIKM Int'l Conf. Information and Knowledge Management (CIKM '01), pp. 8188, Nov. 2001.
[27] M.J. Zaki and C.J. Hsiao, “CHARM: An Efficient Algorithm for Closed Itemset Mining,” Proc. 2002 SIAM Int'l Conf. Data Mining (SDM '02), pp. 457473, Apr. 2002.