Discovering Transitional Patterns and Their Significant Milestones in Transaction Databases

作者: Qian Wan , Aijun An

DOI: 10.1109/TKDE.2009.59

关键词:

摘要: A transaction database usually consists of a set time-stamped transactions. Mining frequent patterns in databases has been studied extensively data mining research. However, most the existing pattern algorithms (such as Apriori and FP-growth) do not consider time stamps associated with In this paper, we extend framework to take into account stamp each discover whose frequency dramatically changes over time. We define new type patterns, called transitional capture dynamic behavior database. Transitional include both positive negative patterns. Their frequencies increase/decrease at some points introduce concept significant milestones for pattern, which are significantly. Moreover, develop an algorithm mine from along their milestones. Our experimental studies on real-world illustrate that is highly promising practical useful approach discovering novel interesting knowledge large databases.

参考文章(43)
J. Pei, Jiawei Han, Runying Mao, CLOSET : An Efficient Algorithm for Mining Frequent Closed Itemsets international conference on management of data. pp. 21- 30 ,(2000)
Ramakrishnan Srikant, Rakesh Agrawal, Fast algorithms for mining association rules very large data bases. pp. 580- 592 ,(1998)
Pang-Ning Tan, Vipin Kumar, Jaideep Srivastava1, Indirect Association: Mining Higher Order Dependencies in Data european conference on principles of data mining and knowledge discovery. pp. 632- 637 ,(2000) , 10.1007/3-540-45372-5_77
Mohammed Javeed Zaki, Ching-Jiu Hsiao, CHARM : An Efficient Algorithm for Closed Itemset Mining siam international conference on data mining. pp. 457- 473 ,(2002)
Jinyan Li, Kotagiri Ramamohanarao, Guozhu Dong, Emerging Patterns and Classification Lecture Notes in Computer Science. pp. 15- 32 ,(2000) , 10.1007/3-540-44464-5_3
Pang-Ning Tan, Vipin Kumar, Mining Indirect Associations in Web Data Lecture Notes in Computer Science. pp. 145- 166 ,(2001) , 10.1007/3-540-45640-6_7
James Bailey, Thomas Manoukian, Kotagiri Ramamohanarao, Fast Algorithms for Mining Emerging Patterns european conference on principles of data mining and knowledge discovery. pp. 39- 50 ,(2002) , 10.1007/3-540-45681-3_4
Nicolas Pasquier, Yves Bastide, Rafik Taouil, Lotfi Lakhal, Discovering Frequent Closed Itemsets for Association Rules international conference on database theory. ,vol. 1540, pp. 398- 416 ,(1999) , 10.1007/3-540-49257-7_25
Ramakrishnan Srikant, Rakesh Agrawal, Mining sequential patterns: Generalizations and performance improvements Advances in Database Technology — EDBT '96. pp. 1- 17 ,(1996) , 10.1007/BFB0014140