Open Access Open Access  Restricted Access Subscription or Fee Access

A Survey on Transitional Pattern Mining in Online Transactional Databases

Sreeja S. Pillai, K. Veningston, Deepa Kanmani

Abstract


The process of extracting interesting implicit knowledge from large information repositories like relational databases, data warehouse etc. and summarizing into useful information is called as Data Mining. Data Mining is also known as knowledge discovery in databases, knowledge extraction, business intelligence etc. Data mining should be applicable to any kind of data repository as well as to transient data such as data streams. A transactional database consists of a file where each record represents a transaction. Frequent patterns are patterns that occur frequently in data. There are various approaches proposed for frequent pattern mining. But this paper is discussing about transitional patterns that are patterns whose frequency dramatically changes over time and various approaches of frequent pattern mining that do not consider the time stamp of each transaction.

Keywords


Frequent Patterns, Data Mining, Transitional Patterns, Transaction Database

Full Text:

PDF

References


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.

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.

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.

Y.-J, Li, P. Ning, X. Sean Wang, and S. Jajodia, “Discovering Calendar-Based Temporal Association Rules ,” Proc. Eighth Int’l Symp. Temporal Representation and Reasoning (TIME ’01), pp. 111-118, 2001.

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

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.

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.

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.

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.

X.Huang, A. An, N.Cercone and G.Promehouse, “Discovery of Interesting Association Rules from Livelink Web Log Data ,” Proc. 2002 IEEE Int’l Conf. Data Mining (ICDM ’02), pp.763, 2003.

V.Guralink and J.Srivastava, “Event Detection from Time Series Data,” Proc. Fifth ACM SIGKDD Int’l Cof. Knowledge Discovery and Data Mining (KDD ’99), pp.33-42, 1999.


Refbacks

  • There are currently no refbacks.


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