Open Access Open Access  Restricted Access Subscription or Fee Access

To Identify Dynamic Behaviour of Frequent Patterns by Exploiting Timestamps

K. Veningston, Deepa Kanmani, Sreeja.S. Pillai

Abstract


Mining frequent item-sets or patterns from an online transactional database is one of the fundamental and essential operations in many data mining applications. Apriori and FP-growth are some of the examples for the existing frequent pattern mining algorithms. Only the frequent items sets and their counts are found out by these algorithms. They do not consider anything about the time stamps associated with the transaction. Each transaction database usually consists of time stamp of each transaction. This time stamp is a sequence of characters denoting the date and time at which a certain event occurred. This paper extends the existing frequent pattern mining algorithms to take into account time stamp of each transaction. And also discovers a new type of patterns whose frequency dramatically changes over time which is defined as transitional patterns. The frequency of the transitional patterns may increase or decrease at some time points in a transaction database. These patterns capture the dynamic behavior of frequent patterns in a transaction database. This paper also studies a new concept called significant milestones, which are time points at which the frequency of the pattern changes most significantly. This paper objective is to find out such transitional patterns and their significant milestones that considering the timestamp of each transaction, a modified transitional pattern mining algorithm is presented.

Keywords


Frequent Patterns, Data Mining, Transitional Patterns, Transaction Database

Full Text:

PDF

References


P.-N. Tan and V.Kumar, “Mining Indirect Associations in Web Data,” Proc. Revised Papers from the Third Int’l Workshop Mining Web Log Data Across All Customers Touch Points (WEBKDD ’01), pp. 145-166, 2002.

J. Pei, J. Han, B. Mortazavi- Asl, J-Y. Wang, H. Pinto, Q.-M. Chen, U. Dayal, and M.C. Hsu, “Mining Sequential Patterns by Pattern Growth: The Prefixspan Approach,” IEEE Trans. Knowledge and Data Eng.,vol.16, no.11, pp.1424-1440, Nov. 2004.

J.-W. Han, J.Pei, Y.-W. Yin, and R.-Y. Mao, “Mining Frequent Patterns without Candidate Generation: A Frequent-Pattern Tree Approach,” Data Mining and Knowledge Discovery, vol. 8, no.1, pp.53-87, 2004.

R. Agrawal and R. Srikant, (1995)“Mining Sequential Patterns,” Proc.11th Int’l Conf. Data Eng., pp. 3-14.

D. Kifer, S. Ben-David, and J. Gehrke, “Detecting Change in Data Streams,” Proc. 30th Int’l Conf. Very Large Data Bases (VLDB ’04), pp. 180-191, 2004.

G.Grahne, J.Zhu, (2003) “Efficiently using prefix-trees in mining frequent itemsets”, Proceeding of the ICDM’03 Int’l workshop on frequent itemset mining implementations (FIMI’03), pp 123–132.

J.Pei, J.Han, R.Mao, (2000) “CLOSET: An efficient algorithm for mining frequent closed itemsets”, Proceeding of the 2000 ACM-SIGMOD Int’l workshop on data mining and knowledge discovery (DMKD’00), pp 11–20.

N. Pasquier, Y. Bastide, R. Taouil, and L. Lakhal, (1999) “Discovering Frequent Closed Itemsets for Association Rules”, Proc. Seventh Int’l Conf. Database Theory (ICDT ’99), pp. 398-416.

Q. Wan and A.-J. An, “Transitional Patterns and Their Significant Milestones,” Proc. Seventh IEEE In’l Conf. Data Mining, 2007.

Q. Wan and A.-J. An, “Discovering Transitional Patterns and Their Significant Milestones in Transaction Databases,” IEEE Transactions on Knowledge and Data Engineering, vol. 21, no. 12, December 2009.

B. Kiran Kumar and A. Bhaskar [2009], ETP-Mine: An Efficient Method for Mining Transitional Patterns.

J.Wang , J.Han, J.Pei. (2003) “CLOSET+: Searching for the best strategies for mining frequent closed itemsets”, Proceeding of the 2003 ACM SIGKDD Int’l Conf. on Knowledge Discovery and Data mining (KDD’03), pp 236–245.

M.J.Zaki, C.J.Hsiao, (2002) “CHARM: An efficient algorithm for closed itemset mining”, Proceeding of the 2002 SIAM Int’l Conf. on data mining (SDM’02), pp 457–473


Refbacks

  • There are currently no refbacks.


Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.