|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
| | ||
| Search | ||
| ||
| ASCII Text | x | ||
| Ying-Hsiang Wen, Jen-Wei Huang, Ming-Syan Chen, "Hardware-Enhanced Association Rule Mining with Hashing and Pipelining," IEEE Transactions on Knowledge and Data Engineering, vol. 20, no. 6, pp. 784-795, June, 2008. | |||
| BibTex | x | ||
| @article{ 10.1109/TKDE.2008.39, author = {Ying-Hsiang Wen and Jen-Wei Huang and Ming-Syan Chen}, title = {Hardware-Enhanced Association Rule Mining with Hashing and Pipelining}, journal ={IEEE Transactions on Knowledge and Data Engineering}, volume = {20}, number = {6}, issn = {1041-4347}, year = {2008}, pages = {784-795}, doi = {http://doi.ieeecomputersociety.org/10.1109/TKDE.2008.39}, 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 - Hardware-Enhanced Association Rule Mining with Hashing and Pipelining IS - 6 SN - 1041-4347 SP784 EP795 EPD - 784-795 A1 - Ying-Hsiang Wen, A1 - Jen-Wei Huang, A1 - Ming-Syan Chen, PY - 2008 KW - data mining KW - Association Rules KW - hardware-enhanced mining VL - 20 JA - IEEE Transactions on Knowledge and Data Engineering ER - | |||
[1] R. Agarwal, C. Aggarwal, and V. Prasad, “A Tree Projection Algorithm for Generation of Frequent Itemsets,” J. Parallel and Distributed Computing, 2000.
[2] R. Agrawal and R. Srikant, “Fast Algorithms for Mining Association Rules,” Proc. 20th Int'l Conf. Very Large Databases (VLDB), 1994.
[3] Z.K. Baker and V.K. Prasanna, “Efficient Hardware Data Mining with the Apriori Algorithm on FPGAS,” Proc. 13th Ann. IEEE Symp. Field-Programmable Custom Computing Machines (FCCM), 2005.
[4] Z.K. Baker and V.K. Prasanna, “An Architecture for Efficient Hardware Data Mining Using Reconfigurable Computing Systems,” Proc. 14th Ann. IEEE Symp. Field-Programmable Custom Computing Machines (FCCM '06), pp. 67-75, Apr. 2006.
[5] C. Besemann and A. Denton, “Integration of Profile Hidden Markov Model Output into Association Rule Mining,” Proc. 11th ACM SIGKDD Int'l Conf. Knowledge Discovery in Data Mining (KDD '05), pp. 538-543, 2005.
[6] C.W. Chen, J. Luo, and K.J. Parker, “Image Segmentation via Adaptive K-Mean Clustering and Knowledge-Based Morphological Operations with Biomedical Applications,” IEEE Trans. Image Processing, vol. 7, no. 12, pp. 1673-1683, 1998.
[7] S.M. Chung and C. Luo, “Parallel Mining of Maximal Frequent Itemsets from Databases,” Proc. 15th IEEE Int'l Conf. Tools with Artificial Intelligence (ICTAI), 2003.
[8] S. Cong, J. Han, J. Hoeflinger, and D. Padua, “A Sampling-Based Framework for Parallel Data Mining,” Proc. 10th ACM SIGPLAN Symp. Principles and Practice of Parallel Programming (PPoPP '05), June 2005.
[9] M. Estlick, M. Leeser, J. Szymanski, and J. Theiler, “Algorithmic Transformations in the Implementation of K-Means Clustering on Reconfigurable Hardware,” Proc. Ninth Ann. IEEE Symp. Field-Programmable Custom Computing Machines (FCCM), 2001.
[10] M. Gokhale, J. Frigo, K. McCabe, J. Theiler, C. Wolinski, and D. Lavenier, “Experience with a Hybrid Processor: K-Means Clustering,” J. Supercomputing, pp. 131-148, 2003.
[11] J. Han and M. Kamber, Data Mining: Concepts and Techniques. Morgan Kaufmann, 2001.
[12] J. Han, J. Pei, and Y. Yin, “Mining Frequent Patterns without Candidate Generation,” Proc. ACM SIGMOD '00, pp. 1-12, May 2000.
[13] H. Kung and C. Leiserson, “Systolic Arrays for VLSI,” Proc. Sparse Matrix, 1976.
[14] N. Ling and M. Bayoumi, Specification and Verification of Systolic Arrays. World Scientific Publishing, 1999.
[15] W.-C. Liu, K.-H. Liu, and M.-S. Chen, “High Performance Data Stream Processing on a Novel Hardware Enhanced Framework,” Proc. 10th Pacific-Asia Conf. Knowledge Discovery and Data Mining (PAKDD '06), Apr. 2006.
[16] J.S. Park, M.-S. Chen, and P.S. Yu, “An Effective Hash Based Algorithm for Mining Association Rules,” Proc. ACM SIGMOD '95, pp. 175-186, May 1995.
[17] J.S. Park, M.-S. Chen, and P.S. Yu, “Using a Hash-Based Method with Transaction Trimming for Mining Association Rules,” IEEE Trans. Knowledge and Data Eng., vol. 9, no. 5, pp. 813-825, Sept./Oct. 1997.
[18] A. Savasere, E. Omiecinski, and S. Navathe, “An Efficient Algorithm for Mining Association Rules in Large Databases,” Proc. 21st Int'l Conf. Very Large Databases (VLDB '95), pp. 432-444, Sept. 1995.
[19] H. Toivonen, “Sampling Large Databases for Association Rules,” Proc. 22nd Int'l Conf. Very Large Databases (VLDB '96), pp. 134-145, 1996.
[20] C. Wolinski, M. Gokhale, and K. McCabe, “A Reconfigurable Computing Fabric,” Proc. Int'l Conf. Eng. of Reconfigurable Systems and Algorithms (ERSA), 2004.

