［1］AGRAWAL R,IMIELI T,SKI T,et al.Mining associa-tion rules between sets of items in large databases［C］//Proceedings of 1993 ACM SIGMOD International Con-ference on Management of Data.New York,USA:ACM Press,1993:207-216.
［2］TOIVONEN H.Sampling large databases for association rules［C］//Proceedings of the 22nd International Conference on Very Large Databases.New York,USA:ACM Press,1996:134-145.
［3］SAVASERE A,OMIECINSKI E,NAVATHE S.An efficient algorithm for mining association rules in large databases［C］//Proceedings of the 21st International Conference on Very Large Databases.New York,USA:ACM Press,1995:432-444.
［4］PARK J S,CHEN M S,YU P S.An effective hash-based algorithm for mining association rules［C］//Proceedings of 1995 ACM SIGMOD International Conference on Management of Data.New York,USA:ACM Press,1995:175-186.
［5］HAN J,PEI J,YIN Y.Mining frequent patterns without candidate generation［C］//Proceedings of 2000 ACM SIGMOD International Conference on Management of Data.New York,USA:ACM Press,2000:1-12.
［6］YAO H,HAMILTON H J,BUTZ C J.A foundational approach to mining itemset utilities from databases［C］//Proceedings of the 4th SIAM International Conference on Data Mining.Lake Buena Vista,USA:［s.n.］,2004:482-486.
［7］LU S,HU H,LI F.Mining weighted association rules［J］.Mini-micro Systems,2001,5(5):211-225.
［8］LIU Y,LIAO W K,CHOUDHARY A.A two-phase algorithm for fast discovery of high utility itemsets［C］//Proceedings of the 9th Pacific-Asia Conference on Advances in Knowledge Discovery and Data Mining.Berlin,Germany:Springer,2005:689-695.
［9］AHMED C F,TANBEER S K,JEONG B S,et al.Efficient tree structures for high utility pattern mining in incremental databases［J］.IEEE Transactions on Knowledge and Data Engineering,2009,21(12):1708-1721.
［10］TSENG V S,WU C W,SHIE B E,et al.Up-growth:an efficient algorithm for high utility itemset mining［C］//Proceedings of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining.New York,USA:ACM Press:2010:253-262.
［11］王敬华,罗相洲,吴倩.基于投影的高效用项集挖掘算法［J］.小型微型计算机系统,2016,37(6):1212-1216.
［12］LIU M,QU J.Mining high utility itemsets without candidate generation［C］//Proceedings of the 21st ACM International Conference on Information and Knowledge Management.New York,USA:ACM Press,2012:55-64.
［13］FOURNIER-VIGER P,WU C W,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.
(下转第214页)
(上接第207页)
［14］王乐,熊松泉,常艳芬,等.基于模式增长方式的高效用模式挖掘算法［J］.自动化学报,2015,41(9):1616-1626.
［15］李雨明,邱卫东,徐赛赛,等.一种挖掘不确定数据最大模式的深度优先算法［J］.计算机工程,2015,41(7):204-209.
［16］KANNIMUTHU S,PREMALATHA K.Discovery of high utility itemsets using genetic algorithm with ranked mutation［J］.International Journal of Engineering and Technology,2014,5(6):337-359.
［17］LIN C W,YANG L,FOURNIER-VIGER P,et al.Mining high-utility itemsets based on particle swarm optimization［J］.Engineering Applications of Artificial Intelligence,2016,55:320-330.
［18］LIN C W,YANG L,FOURNIER-VIGER P,et al.A binary PSO approach to mine high-utility itemsets［J］.Soft Computing,2017,21(17):5103-5121.
［19］KENNEDY J,EBERHART R C.A discrete binary version of the particle swarm algorithm［C］//Proceedings of International Conference on Systems,Man and Cybernetics.Washington D.C.,USA:IEEE Press,1997:4104-4108.
［20］FOURNIER-VIGER 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.
［21］TRELEA I C.The particle swarm optimization algorithm:convergence analysis and parameter selection［J］.Information Processing Letters,2003,85(6):317-325.