Journal of Engineering and Applied Sciences

Year: 2017
Volume: 12
Issue: 12
Page No. 3098 - 3101

Parallelizing Pincer Search Using CUDA-A Conceptual Idea

Authors : Anchit Bhatia, Divyanshu Sharma and S. Chethan

References

Al-Hamoudi, A.S. and A.A. Biyabani, 2014. Accelerating data mining with CUDA and OpenMP. Proceedings of the 11th International Conference on Computer Systems and Applications (AICCSA) 2014, November 10-13, 2014, IEEE, Riyadh, Saudi Arabia, pp: 528-535.

Lin, D.I. and Z.M. Kedem, 2002. Pincer-search: An efficient algorithm for discovering the maximum frequent set. IEEE. Trans. Knowl. Data Eng., 14: 553-566.
CrossRef  |  Direct Link  |  

Salah, S., R. Akbarinia and F. Masseglia, 2015. Fast parallel mining of maximally informative K-itemsets in big data. Proceedings of the 2015 IEEE International Conference on Data Mining (ICDM), November 14-17, 2015, IEEE, Montpellier, France, ISBN:978-1-4673-9504-5, pp: 359-368.

Uy, R.L. and N. Marcos, 2016. Fast 1-itemset frequency count using CUDA. Proceedings of the 2016 IEEE Conference on Region 10 (TENCON), November 22-25, 2016, IEEE, Manila, Philippines, ISBN:978-1-5090-2598-5, pp: 210-213.

Wang, F. and B. Yuan, 2014. Parallel frequent pattern mining without candidate generation on GPUs. Proceedings of the 2014 IEEE International Conference on Data Mining Workshop (ICDMW), December 14, 2014, IEEE, Shenzhen, China, ISBN:978-1-4799-4273-2, pp: 1046-1052.

Design and power by Medwell Web Development Team. © Medwell Publishing 2024 All Rights Reserved