[1] ZHU F, ZHANG Z, QU Q. A direct mining approach to efficient constrained graph pattern discovery[C]//SIGMOD 2013:Proceedings of the 2013 Special Interest Group on Management of Data. New York:ACM, 2013:821-832. [2] GUNS T, NIJSSEN S, RAEDT L. K-pattern set mining under constraints[J]. IEEE Transaction on Knowledge and Data Engineering, 2013, 25(2):402-418. [3] ZENG X, PEI J, WANG K, et al. PADS:a simple yet effective pattern-aware dynamic search method for fast maximal frequent pattern mining[J]. Knowledge and Information Systems, 2009, 20(3):243-252. [4] GAO L. Domain-driven data mining:challenges and prospects[J]. IEEE Transaction on Knowledge and Data Engineering, 2010, 22(6):755-769. [5] AGRAWAL R, IMIELINSKI T, SWAMI A. Mining association rules between sets of items in large databases[C]//SIGMOD' 93:Proceedings of the 1993 ACM Special Interest Group on Management of Data. New York:ACM, 1993:207-216. [6] BONCHIA F, GIANNOTTIB F, LUCCHESB C, et al. A constraint-based querying system for exploratory pattern discovery[J]. Information Systems, 2009, 34(1):3-27. [7] YAO H, HAMMILTON H J, BUTZ C J. A foundational approach to mining itemset utilities from databases[C]//SDM 2004:Proceedings of the 2004 Siam International Conference on Data mining. New York:ACM, 2004:482-486. [8] WU C, SHIE B, TSENG V, et al. Mining top-K high utility itemsets[C]//KDD 2012:Proceedings of the 2012 ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. New York:ACM, 2012:78-86. [9] TANG L, ZHANG L, LUO P, et al. Incorporating occupancy into frequent pattern mining for high quality pattern recommendation[C]//Proceedings of the 2013 ACM International Conference on Information and Knowledge Management. New York:ACM, 2013:75-84. [10] YUN U. Efficient mining of weighted interesting patterns with a strong weight and/or support affinity[J]. Information Sciences, 2007, 177(17):213-241. [11] 张磊.基于约束的频繁模式挖掘方法[D].合肥:中国科学技术大学,2014:73-116.(ZHANG L. Constraint-based frequent pattern mining:novel applications and new techniques[D]. Hefei:University of Science and Technology of China, 2014:73-116.) [12] GREEN T, TANNEN V. Models for incomplete and probabilistic information[C]//Proceedings of the 2006 IEEE International Conference on Extending Database Technology. Piscataway, NJ:IEEE, 2006:278-296. [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. [14] LIU M, QU J. Mining high utility itemsets without candidate generation[C]//KDD 2012:Proceedings of the 2012 ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. New York:ACM, 2012:78-86. [15] LIU Y, LIAO W, CHOUDHARY A. A two-phase algorithm for fast discovery of high utility itemsets[C]//Proceedings of the 2005 Pacific-Asia Conference on Knowledge Discovery and Data Mining. New York:ACM, 2005:689-695. WANG Ju, born in 1991, Ph. D. candidate. Her research interests include data mining, pattern recognition.LUI Fuxian, born in 1962, Ph. D., professor. His research interests include simulation of warfare, data mining.JIN Chunjie, born in 1989, assistant engineer. His research interests include data mining, pattern recognition. |