
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Chowdhury Farhan Ahmed, Syed Khairuzzaman Tanbeer, ByeongSoo Jeong, YoungKoo Lee, "Efficient Tree Structures for High Utility Pattern Mining in Incremental Databases," IEEE Transactions on Knowledge and Data Engineering, vol. 21, no. 12, pp. 17081721, December, 2009.  
BibTex  x  
@article{ 10.1109/TKDE.2009.46, author = {Chowdhury Farhan Ahmed and Syed Khairuzzaman Tanbeer and ByeongSoo Jeong and YoungKoo Lee}, title = {Efficient Tree Structures for High Utility Pattern Mining in Incremental Databases}, journal ={IEEE Transactions on Knowledge and Data Engineering}, volume = {21}, number = {12}, issn = {10414347}, year = {2009}, pages = {17081721}, doi = {http://doi.ieeecomputersociety.org/10.1109/TKDE.2009.46}, 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  Efficient Tree Structures for High Utility Pattern Mining in Incremental Databases IS  12 SN  10414347 SP1708 EP1721 EPD  17081721 A1  Chowdhury Farhan Ahmed, A1  Syed Khairuzzaman Tanbeer, A1  ByeongSoo Jeong, A1  YoungKoo Lee, PY  2009 KW  Data mining KW  frequent pattern mining KW  high utility pattern mining KW  incremental mining KW  interactive mining. VL  21 JA  IEEE Transactions on Knowledge and Data Engineering ER   
[1] R. Agrawal, T. Imielinski, and A. Swami, “Mining Association Rules Between Sets of Items in Large Databases,” Proc. 12th ACM SIGMOD, pp. 207216, 1993.
[2] R. Agrawal and R. Srikant, “Fast Algorithms for Mining Association Rules,” Proc. 20th Int'l Conf. Very Large Data Bases (VLDB '94), pp. 487499, 1994.
[3] U. Yun and J.J. Leggett, “WFIM: Weighted Frequent Itemset Mining with a Weight Range and a Minimum Weight,” Proc. Fifth SIAM Int'l Conf. Data Mining (SDM '05), pp. 636640, 2005.
[4] U. Yun, “Efficient Mining of Weighted Interesting Patterns with a Strong Weight and/or Support Affinity,” Information Sciences, vol. 177, pp. 34773499, 2007.
[5] H. Yao, H.J. Hamilton, and C.J. Butz, “A Foundational Approach to Mining Itemset Utilities from Databases,” Proc. Fourth SIAM Int'l Conf. Data Mining (SDM '04), pp. 482486, 2004.
[6] H. Yao and H.J. Hamilton, “Mining Itemset Utilities from Transaction Databases,” Data and Knowledge Eng., vol. 59, pp.603626, 2006.
[7] Y. Liu, W.K. Liao, and A. Choudhary, “A Two Phase Algorithm for Fast Discovery of High Utility of Itemsets,” Proc. Ninth PacificAsia Conf. Knowledge Discovery and Data Mining (PAKDD '05), pp.689695, 2005.
[8] Y. Liu, W.K. Liao, and A. Choudhary, “A Fast High Utility Itemsets Mining Algorithm,” Proc. First Int'l Conf. UtilityBased Data Mining, pp. 9099, 2005.
[9] B. Barber and H.J. Hamilton, “Extracting Share Frequent Itemsets with Infrequent Subsets,” Data Mining and Knowledge Discovery, vol. 7, pp. 153185, 2003.
[10] R. Chan, Q. Yang, and Y.D. Shen, “Mining High Utility Itemsets,” Proc. Third IEEE Int'l Conf. Data Mining (ICDM '03), pp. 1926, 2003.
[11] F. Tao, “Weighted Association Rule Mining Using Weighted Support and Significant Framework,” Proc. Ninth ACM SIGKDD, pp. 661666, 2003.
[12] J. Han, J. Pei, Y. Yin, and R. Mao, “Mining Frequent Patterns without Candidate Generation: A FrequentPattern Tree Approach,” Data Mining and Knowledge Discovery, vol. 8, pp. 5387, 2004.
[13] G. Grahne and J. Zhu, “Fast Algorithms for Frequent Itemset Mining Using FPTrees,” IEEE Trans. Knowledge and Data Eng., vol. 17, no. 10, pp. 13471362, Oct. 2005.
[14] J. Wang, J. Han, Y. Lu, and P. Tzvetkov, “TFP: An Efficient Algorithm for Mining TopK Frequent Closed Itemsets,” IEEE Trans. Knowledge and Data Eng., vol. 17, no. 5, pp. 652664, May 2005.
[15] C. Lucchese, S. Orlando, and R. Perego, “Fast and Memory Efficient Mining of Frequent Closed Itemsets,” IEEE Trans. Knowledge and Data Eng., vol. 18, no. 1, pp. 2136, Jan. 2006.
[16] W. Cheung and O.R. Zaïane, “Incremental Mining of Frequent Patterns without Candidate Generation or Support Constraint,” Proc. Seventh Int'l Database Eng. and Applications Symp. (IDEAS '03), pp. 111116, 2003.
[17] J.L. Koh and S.F. Shieh, “An Efficient Approach for Maintaining Association Rules Based on Adjusting FPTree Structures,” Proc. Ninth Int'l Conf. Database Systems for Advanced Applications (DASFAA '04), pp. 417424, 2004.
[18] X. Li, Z.H. Deng, and S. Tang, “A Fast Algorithm for Maintenance of Association Rules in Incremental Databases,” Proc. Advanced Data Mining and Applications (ADMA 06), pp. 5663, 2006.
[19] C.K.S. Leung, Q.I. Khan, Z. Li, and T. Hoque, “CanTree: A CanonicalOrder Tree for Incremental FrequentPattern Mining,” Knowledge and Information Systems, vol. 11, no. 3, pp. 287311, 2007.
[20] W. Wang, J. Yang, and P.S. Yu, “WAR: Weighted Association Rules for Item Intensities,” Knowledge Information and Systems, vol. 6, pp. 203229, 2004.
[21] U. Yun, “Mining Lossless Closed Frequent Patterns with Weight Constraints,” KnowledgeBased Systems, vol. 20, pp. 8697, 2007.
[22] H. Xiong, P.N. Tan, and V. Kumar, “Hyperclique Pattern Discovery,” Data Mining and Knowledge Discovery, vol. 13, pp.219242, 2006.
[23] J. Dong and M. Han, “BitTableFI: An Efficient Mining Frequent Itemsets Algorithm,” KnowledgeBased Systems, vol. 20, pp. 329335, 2007.
[24] M. Song and S. Rajasekaran, “A Transaction Mapping Algorithm for Frequent Itemsets Mining,” IEEE Trans. Knowledge and Data Eng., vol. 18, no. 4, pp. 472481, Apr. 2006.
[25] Y.H. Wen, J.W. Huang, and M.S. Chen, “HardwareEnhanced Association Rule Mining with Hashing and Pipelining,” IEEE Trans. Knowledge and Data Eng., vol. 20, no. 6, pp. 784795, June 2008.
[26] A. Erwin, R.P. Gopalan, and N.R. Achuthan, “CTUMine: An Efficient High Utility Itemset Mining Algorithm Using the Pattern Growth Approach,” Proc. Seventh IEEE Int'l Conf. Computer and Information Technology (CIT '07), pp. 7176, 2007.
[27] J. Hu and A. Mojsilovic, “High Utility Pattern Mining: A Method for Discovery of High Utility Itemsets,” Pattern Recognition, vol. 40, pp. 33173324, 2007.
[28] Frequent Itemset Mining Dataset Repository, http://fimi.cs. helsinki.fidata/, accessed Jan. 2008.
[29] UCI Machine Learning Repository, http:/kdd.ics.uci.edu/, accessed Jan. 2008.
[30] J. Pisharath, Y. Liu, J. Parhi, W.K. Liao, A. Choudhary, and G. Memik,, NUMineBench Version 2.0 Source Code and Datasets, http://cucis.ece.northwestern.edu/projects/ DMSMineBench.html, accessed June 2008
[31] T. Brijs, G. Swinnen, K. Vanhoof, and G. Wets, “Using Association Rules for Product Assortment Decisions: A Case Study,” Proc. Fifth ACM SIGKDD, pp. 254260, 1999.
[32] S. Zhang, J. Zhang, and C. Zhang, “EDUA: An Efficient Algorithm for Dynamic Database Mining,” Information Sciences, vol. 177, pp.27562767, 2007.
[33] Y.S. Lee and S.J. Yen, “Incremental and Interactive Mining of Web Traversal Patterns,” Information Sciences, vol. 178, pp. 287306, 2008.
[34] T.P. Hong, C.W. Lin, and Y.L. Wu, “Incrementally Fast Updated Frequent Pattern Trees,” Expert Systems with Applications, vol. 34, pp. 24242435, 2008.
[35] Y.C. Li, J.S. Yeh, and C.C. Chang, “Isolated Items Discarding Strategy for Discovering High Utility Itemsets,” Data and Knowledge Eng., vol. 64, pp. 198217, 2008.
[36] S.K. Tanbeer, C.F. Ahmed, B.S. Jeong, and Y.K. Lee, “CPTree: A Tree Structure for Single Pass Frequent Pattern Mining,” Proc. 12th PacificAsia Conf. Knowledge Discovery and Data Mining (PAKDD '08), pp. 10221027, 2008.