[1]ZHU F J,ZHANG Z,QU Q.A direct mining approach to efficient constrained graph pattern discovery[C]//Proceedings of SIGMOD’13.Washington D.C.,USA:IEEE Press,2013:821-832.br/
[2]GUNS T,NIJSSEN S,RAEDT L D.K-pattern set mining under constraints[J].IEEE Transactions on Knowledge and Data Engineering,2013,25(2):402-418.br/
[3]AGRAWAL R,IMIELINSKI T,SWAMI A.Mining association rules between sets of items in large databases[C]//Proceedings of SIGMOD’93.Washington D.C.,USA:IEEE Press,1993:207-216.br/
[4]CAO L.Domain-driven data mining:challenges and prospects[J].IEEE Transactions on Knowledge and Data Engineering,2010,22(6):755-769.br/
[5]LIU Y,CHEN L,PEI J,et al.Mining frequent trajectory patterns for activity monitoring using radio frequency tag arrays[C]//Proceedings of IEEE International Conference on Pervasive Computing and Communications.Washington D.C.,USA:IEEE Press,2007:37-46.br/
[6]HAN J,PEI J,YIN Y.Mining frequent patterns without candidate generation[C]//Proceedings of ACM SIGMOD International Conference on Management of Data.New York,USA:ACM Press,2000:1-12.br/
[7]YAO H,HAMILTON H J,BUTZ C J.A foundational approach to mining itemset utilities from databases[EB/OL].[2017-07-05].http://www2.cs.uregina.ca/~butz/publica tions/siam04.pdf.br/
[8]WU C W,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.br/
[9]TANG L,ZHANG L,LUO P,et al.Incorporating occupancy into frequent pattern mining for high quality pattern recommendation[C]//Proceedings of the 21st ACM International Conference on Information and Knowledge Management.New York,USA:ACM Press,2012:75-84.br/
[10]YUN U.Efficient mining of weighted interesting patterns with a strong weight and/or support affinity[J].Information Sciences,2007,177(17):3477-3499.br/
[11]张磊.基于约束的频繁模式挖掘方法[D].合肥:中国科学技术大学,2014.br/
[12]吴正佳,罗月胜,周玉琼,等.一种求解典型JSP的改进离散粒子群优化算法[J].计算机应用研究,2013,30(8):2406-2409.br/
[13]LIN C W,HONG T P,LU W H.An effective tree structure for mining high utility itemsets[J].Expert Systems with Applications,2011,38(6):7419-7424.br/
[14]LIU M,QU J.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.br/
[15]LAN Y,WANG Y N,WANG Y,et al.Mining high utility itemsets over uncertain databases[C]//Proceedings of International Conference on Cyber-enabled Distributed Computing and Knowledge Discovery.Washington D.C.,USA:IEEE Press,2015:235-238.br/
[16]LIN C W,GAN W,FOURNIER-VIGER P,et al.Efficient algorithms for mining high-utility itemsets in uncertain databases[J].Knowledge-Based Systems,2016,96(C):171-187.br/
[17]LIU Y,LIAO W,CHOUDHARY A.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.br/ |