Đang tải... (xem toàn văn)
Mục đích của luận án nhằm nghiên cứu các thuật toán khai phá tập phổ biến, tập phổ biến có trọng số và tập lợi ích cao. Xây dựng mô hình, cấu trúc dữ liệu nhằm giảm không gian tìm kiếm và dựa trên cơ sở đó để xây dựng các thuật toán khai phá tập phổ biến có trọng số và tập lợi ích cao.
ski E., and Navathe S.B (1995) An Efficient Algorithm for Mining Association Rules in Large Databases. Proceedings of the 21th International Conference on Very Large Data Bases, San Francisco, CA, USA, Morgan Kaufmann Publishers Inc., 432– 444 52 Shankar S., Babu N., Purusothaman T. et al. (2009). A Fast Algorithm for Mining High Utility Itemsets 2009 IEEE International Advance Computing Conference, 1459–1464 53 Shenoy P., Haritsa J.R., Sudarshan S et al (2000) Turbocharging Vertical Mining of Large Databases Proceedings of the 2000 ACM SIGMOD International Conference on Management of Data, New York, NY, USA, ACM, 22–33 54 Solanki S.K. and Patel J.T. (2015). A Survey on Association Rule Mining. 2015 Fifth International Conference on Advanced Computing Communication Technologies, 212–216 55 Song W., Liu Y., and Li J (2012) Vertical mining for high utility itemsets 2012 IEEE International Conference on Granular Computing, 429–434 56 Subramanian K., Kandhasamy P., and Subramanian S. (2013). A Novel Approach to Extract High Utility Itemsets from Distributed Databases. Comput Inform, 31(6+), 1597–1615 155 57 Sucahyo Y.G. and Gopalan R.P. (2004). CTPRO: A BottomUp Non Recursive Frequent Itemset Mining Algorithm Using Compressed FP Tree Data Structure. FIMI, 212–223 58 Tao F., Murtagh F., and Farid M (2003) Weighted Association Rule Mining Using Weighted Support and Significance Framework. Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, New York, NY, USA, ACM, 661–666 59 Teodoro G., Mariano N., Jr W.M. et al. (2010). Tree ProjectionBased Frequent Itemset Mining on Multicore CPUs and GPUs 2010 22nd International Symposium on Computer Architecture and High Performance Computing, 47–54 60 Tseng V.S., Shie B.E., Wu C.W. et al. (2013). Efficient Algorithms for Mining High Utility Itemsets from Transactional Databases. IEEE Trans Knowl Data Eng, 25(8), 1772–1786 61 Tseng V.S., Wu C.W., FournierViger P et al (2016) Efficient Algorithms for Mining TopK High Utility Itemsets. IEEE Trans Knowl Data Eng, 28(1), 54–67 62 Tseng V.S., Wu C.W., Shie B.E. et al. (2010). UPGrowth: An Efficient Algorithm for High Utility Itemset Mining. Proceedings of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, New York, NY, USA, ACM, 253–262 63 Veloso A., Otey M.E., Parthasarathy S et al (2003) Parallel and Distributed Frequent Itemset Mining on Dynamic Datasets High Performance Computing HiPC 2003, Springer, Berlin, Heidelberg, 184– 193 64 Vo B., Coenen F., and Le B. (2013). A New Method for Mining Frequent Weighted Itemsets Based on WITtrees Expert Syst Appl, 40(4), 1256– 1264 65 Vo B., Nguyen H., Ho T.B. et al. (2009). Parallel Method for Mining High Utility Itemsets from Vertically Partitioned Distributed Databases. Proceedings of the 13th International Conference on KnowledgeBased 156 and Intelligent Information and Engineering Systems: Part I, Berlin, Heidelberg, SpringerVerlag, 251–260 66 Wang W., Yang J., and Yu P. (2004). WAR: Weighted Association Rules for Item Intensities. Knowl Inf Syst, 6(2), 203–229 67 Xun Y., Zhang J., and Qin X (2016) FiDoop: Parallel Mining of Frequent Itemsets Using MapReduce. IEEE Trans Syst Man Cybern Syst, 46(3), 313–325 68 Ye Y and Chiang C.C (2006) A Parallel Apriori Algorithm for Frequent Itemsets Mining. Fourth International Conference on Software Engineering Research, Management and Applications (SERA’06), 87–94 69 Yin J., Zheng Z., Cao L. et al. (2013). Efficiently Mining TopK High Utility Sequential Patterns. 2013 IEEE 13th International Conference on Data Mining, 1259–1264 70 Yoshikawa M and Terai H (2006) Apriori, Association Rules, Data Mining,Frequent Itemsets Mining (FIM), Parallel Computing Fourth International Conference on Software Engineering Research, Management and Applications (SERA’06), 95–100 71 Yu K.M. and Wu S.H. (2011). An Efficient Load Balancing Multicore Frequent Patterns Mining Algorithm 2011IEEE 10th International Conference on Trust, Security and Privacy in Computing and Communications, 1408–1412 72 Yun U. and Leggett J. (2005). WFIM: Weighted Frequent Itemset Mining with a weight range and a minimum weight Proceedings of the 2005 SIAM International Conference on Data Mining. Society for Industrial and Applied Mathematics, 636–640 73 Yun U and Ryu K.H (2011) Approximate weighted frequent pattern mining with/without noisy environments KnowlBased Syst, 24(1), 73– 82 74 Zaki M.J (2000) Scalable Algorithms for Association Mining IEEE Trans Knowl Data Eng, 12(3), 372–390 75 Zaki M.J. and Gouda K. (2003). Fast Vertical Mining Using Diffsets. Proceedings of the Ninth ACM SIGKDD International Conference on 157 Knowledge Discovery and Data Mining, New York, NY, USA, ACM, 326–335 76 Zhang Z., Ji G., and Tang M. (2013). MREclat: An Algorithm for Parallel Mining Frequent Itemsets 2013 International Conference on Advanced Cloud and Big Data, 177–180 77 Zida S., FournierViger P., Lin J.C.W et al (2015) EFIM: a highly efficient algorithm for highutility itemset mining. Mexican International Conference on Artificial Intelligence, Springer, 530–546 78 ZongYu Z. and YaPing Z. (2012). A Parallel Algorithm of Frequent Itemsets Mining Based on Bit Matrix. 2012 International Conference on Industrial Control and Electronics Engineering, 1210–1213 79 SPMF: A Java OpenSource Data Mining Library. , accessed: 04/26/2017 158 ... Frequent Itemsets Mining. Fourth International Conference on Software Engineering Research, Management and Applications (SERA’06), 87–94 69 Yin J., Zheng Z., Cao L. et al. (2013). Efficiently Mining TopK High Utility Sequential Patterns. 2013 IEEE 13th International Conference on