[1]MENG Cai-xia.A frequent pattern mining algorithm based on constraints[J].CAAI Transactions on Intelligent Systems,2009,4(2):142-147.
Copy

A frequent pattern mining algorithm based on constraints

CAAI Transactions on Intelligent Systems[ISSN 1673-4785/CN 23-1538/TP] Volume: 4 Number of periods: 2009 2 Page number: 142-147 Column: 学术论文—人工智能基础 Public date: 2009-04-25
Title:
A frequent pattern mining algorithm based on constraints
Author(s):
MENG Cai-xia
Department of Computer Science, Xi’an University of Posts & Telecommunications, Xi’an 710065,China
Keywords:
frequent patterns mining;  dynamic constraints;  frequent item set;  maximal frequent pattern
CLC:
TP311
DOI:
-
Abstract:
Most algorithms don’t allow users to dynamically change constraints in the process of mining frequent patterns. A new algorithm, constrainbased frequent patterns mining, was developed to provide frequent pattern mining with constraints. First, the algorithm constructs the FPtree (frequent pattern tree) according to the descending or ascending order of constraints, and in this process the database only needs to be scanned once. Secondly, the conditional tree of each item was established to mine maximal frequent pattern with this term as a prefix, and the maximal frequent patterns were stored. Finally, all frequent patterns with precise support degrees were discovered according to the maximal frequent patterns. The significance of this method is that this algorithm allows users to dynamically change constraints during the process. Experimental outcomes showed that the proposed algorithm is more efficient than the algorithm of iCFP.
References:
［1］AGRAWAL R, SRIKANT R. Fast algorithms for mining association rules［C］//Proceedings 20th International Conference on VLDB.Morgan Kaufmann, 1994: 487499. 
［2]颜跃进, 李舟军, 陈火旺. 频繁项集挖掘算法［J］. 计算机科学, 2004,31(3):112114. 
?YAN Yuejin, LI Zhoujun, CHEN Huowang. Frequent item sets mining algorithms［J］.Computer Science, 2004,31(3):112114.
［3］颜跃进, 李舟军, 陈火旺. 基于FPTree有效挖掘最大频繁项集［J］. 软件学报, 2005,16(2):215222.
YAN Yuejin, LI Zhoujun, CHEN Huowang. Efficiently mining of maximal frequent item sets based on FPTree［J］. Journal of Software，2005,16(2):21522.
［4］AGRAWAL R, IMIELINSKI T, SWAMI A. Mining association rules between sets of items in large database［C］//Proc of the ACM SIGMOD Conf on Management of Data.Washington, DC 1993: 207216. 
［5］SRIKANT R, AGRAWAL R. Mining sequential patterns: generalizations and performance improvements［C］// Proc of the 5th Int’1 Conf on Extending Database Technology. Berlin: SpringerVerlag, 1996: 317.
［6］PEI J, HAN J, PINTO H, et al. Mining sequential patterns efficiently by prefixprojected pattern growth［C］// The 17th Int’1 Conf on Data Engineering.Heidelberg, Germany, 2001:195201.
［7］BURDICK D, CALIMIM M, GEHRKE J. A maximal frequent itemset algorithm for transactional database［C］//Piscataway，NJ: IEEE Press, 2001: 443452.
［8］陆介平, 刘月波, 倪巍伟. 基于PrefixSpan的快速交互序列模式挖掘算法［J］. 东南大学学报：自然科学版, 2005, 35(5): 692696.
LU Jieping, LIU Yuebo, NI Weiwei. Fast interactive sequential pattern mining algorithm based on PrefixSpan［J］. Journal of Southeast University：Natural Science Edition, 2005, 35(5): 692696.
［9］ZHU Qunxiong, LIN Xiaoyong. Mining frequent patterns with incremental updating frequent pattern tree［C］//The 6th World Congress on Intelligent Control and Automation. Dalian,2006: 125128. 
［10］LENG Kaisong. Interactive constrained frequentpattern mining system［C］//Proc of the Int’1 Database Engineering and Applications Symposium (IDEAS’04). Los Alamitos, CA: IEEE Computer Society Press, 2004:4858.
Similar References:

Memo

-

Last Update: 2009-05-04

Copyright © CAAI Transactions on Intelligent Systems