| ［1］LIU Ying,LIAO Weikeng,CHOUDHARY A N.A two-phase algorithm for fast discovery of high utility itemsets［C］//Proceedings of Pacific-Asia Conference on Advances in Knowledge Discovery and Data Mining.Berlin,Germany:Springer,2005:689-695.
［2］AGRAWAL R,SRIKANT R.Fast algorithms for mining association rules［EB/OL］.［2018-07-01］.http://www.vldb.org/conf/1994/P487.PDF.
［3］林晨,顾君忠.基于Nodeset的最大频繁项集挖掘算法［J］.计算机工程,2016,42(12):204-207.
［4］TSENG V S,SHIE B E,WU Chengwei,et al.Efficient algorithms for mining high utility itemsets from transactional databases［J］.IEEE Transactions on Knowledge and Data Engineering,2013,25(8):1772-1786.
［5］LIU Mengchi,QU Junfeng.Mining high utility itemsets without candidate generation［C］//Proceedings of ACM International Conference on Information and Knowledge Management.New York,USA:ACM Press,2012:55-64.
［6］FOURNIER-VIGER P,WU Chengwei,ZIDA S,et al.FHM:faster high-utility itemset mining using estimated utility co-occurrence pruning［C］//Proceedings of International Symposium on Methodologies for Intelligent Systems.Berlin,Germany:Springer,2014:83-92.
［7］LIU Junqiang,WANG Ke,FUNG B C M.Mining high utility patterns in one phase without generating candidates［J］.IEEE Transactions on Knowledge and Data Engineering,2016,28(5):1245-1257.
(下转第181页)
(上接第174页)
［8］ZIDA S,FOURNIER-VIGER P,LIN C W,et al.EFIM:a fast and memory efficient algorithm for high-utility itemset mining［J］.Knowledge and Information Systems,2017,51(2):595-625.
［9］LIN Chunwei,YANG Lu,FOURNIER-VIGER P,et al.A binary PSO approach to mine high-utility itemsets［J］.Soft Computing,2017,21(17):5103-5121.
［10］WU Mingtai,ZHAN Justin,LIN Chunwei.An ACO-based approach to mine high-utility itemsets［J］.Knowledge-Based Systems,2017,116:102-113.
［11］SONG We,HUANG Chaomin.Mining high utility itemsets using bio-inspired algorithms:a diverse optimal value framework［J］.IEEE Access,2018,6(1):19568-19582.
［12］WU Chengwei,SHIE B E,TSENG V S,et al.Mining top-K high utility itemsets［C］//Proceedings of ACM SIGKDD International Conference on Knowledge Discovery and Data Mining.New York,USA:ACM Press,2012:78-86.
［13］DAWAR S,SHARMA V,GOYAL V.Mining top-k high-utility itemsets from a data stream under sliding window model［J］.Applied Intelligence,2017,47(4):1240-1255.
［14］李慧,刘贵全,瞿春燕.频繁和高效用项集挖掘［J］.计算机科学,2015,42(5):82-87.
［15］ZIHAYAT M,An A.Mining top-k high utility patterns over data streams［J］.Information Sciences,2014,285(1):138-161.
［16］RYANG H,YUN U.Top-k high utility pattern mining with effective threshold raising strategies［J］.Knowledge-Based Systems,2015,76:109-126.
［17］TSENG V S,WU C W,FOURNIER-VIGER P,et al.Efficient algorithms for mining top-k high utility itemsets［J］.IEEE Transactions on Knowledge and Data Engineering,2015,28(1):54-67.
［18］吴倩,王林平,罗相洲,等.一种快速挖掘top-k高效用模式的算法［J］.计算机应用研究,2017,34(11): 3303-3307.
［19］王乐,冯林,王水.不产生候选项集的top-k高效用模式挖掘算法［J］.计算机研究与发展,2015,52(2):445-455.
［20］FOURNIER V P,LIN C W,GOMARIZ A,et al.The SPMF open-source data mining library version 2［C］//Proceedings of Joint European Conference on Machine Learning and Knowledge Discovery in Databases.Berlin,Germany:Springer,2016:36-40. |