Mining Method of Frequent Patterns Based on Temporal Constraints
DU Yi1,3, LU DeTang1,2, LI DaoLun1,2, WEI WuZhou1,2
1.Institute of Engineering and Science Software, University of Science and Technology of China, Hefei 230027 2.Key Laboratory of Software in Computing and Communication of Anhui Province, Hefei 230027 3.School of Computer and Information, Shanghai Second Polytechnic University, Shanghai 201209
Abstract Temporal data is a kind of useful information. Temporal attributes in data can be used to find some potential change rules of data and predict the possible tendency. An algorithm, Temporal Frequent Pattern mining algorithm (TemFP) is presented. According to the existing function of temporal query, a Double B+tree for storing time attributes of frequent patterns is described. Using a temporal frequent pattern tree including the Double B+tree, the queries of temporal rules, which defined by users, could be realized rapidly. Experimental results demonstrate that the proposed algorithm is efficient and scalable.
[1] Agrawal R, Imielinski T, Swami A. Mining Association Rules between Sets of Items in Large Databases // Proc of the ACM SIGMOD International Conference on Management of Data. Washington, USA, 1993: 207216 [2] Chen X, Petrounias I, Heathfield H. Discovering Temporal Association Rules in Temporal Databases // Proc of the International Workshop on Issues and Applications of Database Technology. Berlin, Germany, 1998: 312319 [3] Zimbrao G, de Souza J M, de Abneida V T, et al. An Algorithm to Discover CalendarBased Temporal Association Rules with Item's Lifespan Restriction // Proc of the 8th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. Alberta, Canada, 2002: 701706 [4] Ouyang Weimin, Cai Qingsheng. Discovery of Association Rules with Temporal Constraint in Databases. Journal of Software, 1999, 10(5): 527532 (in Chinese) (欧阳为民,蔡庆生.在数据库中发现具有时态约束的关联规则.软件学报, 1999, 10(5): 527532) [5] Ma Yuanyuan, Sun Zhihui, Gao Hongmei. Mining the Increment Association Rules in Temporal Database. Journal of Computer Research and Development, 2000, 12(12): 14461451 (in Chinese) (马元元,孙志挥,高红梅.时态数据库中增量关联规则的挖掘. 计算机研究与发展, 2000, 12 (12): 14461451) [6] Mao Guojun, Liu Chunnian. A Method of Data Mining Based on Temporal Constraints. Acta Electronica Sinica, 2003, 11(11): 16901694 (in Chinese) (毛国君,刘椿年.时态约束下的数据挖掘问题及算法.电子学报, 2003, 11(11): 16901694) [7] Han Jiawei, Pei Jian, Yin Yiwen. Mining Frequent Patterns without Candidate Generation // Proc of the ACM SIGMOD International Conference on Management of Data. Dallas, USA, 2000: 112 [8] Song Yuqing, Zhu Yuquan, Sun Zhihui, et al. An Algorithm and Its Updating Algorithm Based on Frequent Pattern Tree for Mining Constrained Maximum Frequent Itemsets. Journal of Computer Research and Development, 2005, 17(5): 777783 (in Chinese) (宋余庆,朱玉全,孙志挥,等.一种基于频繁模式树的约束最大频繁项目集挖掘及其更新算法.计算机研究与发展, 2005, 17(5): 777783) [9] Zhang Jin, Ma Haibing,Hu Yunfa. A SelfAdaptive Algorithm Based on FPTree for Frequent Pattern Mining. Pattern Recognition and Artificial Intelligence, 2005, 18(6): 763768 (in Chinese) (张 锦,马海兵,胡运发.一种基于FPTree的频繁模式挖掘自适应算法. 模式识别与人工智能, 2005, 18(6): 763768) [10] Goethals B. Memory Issues in Frequent Itemset Mining // Proc of the ACM Symposium on Applied Computing. Nicosia, Cyprus, 2004: 1417 [11] Ghoting A, Buehrer G, Parthasarathy S, et al. CacheConscious Frequent Pattern Mining on a Modern Processor // Proc of the 31st International Conference on Very Large Date Bases. Trondheim, Norway, 2005: 577588 [12] Yan Weimin, Wu Weimin. Data Structures. Beijing, China: Tsinghua University Press, 1993 (in Chinese) (严蔚敏,吴伟民.数据结构.北京:清华大学出版社, 1993) [13] Agrawal R, Srikant R. Fast Algorithms for Mining Association Rules // Proc of the 20th International Conference on Very Large Data Bases. Santiago, Chile, 1994: 487499
2007, Vol. 20 
