Efficient mining regularly frequent patterns in transactional databases

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 7238 LNCS, Issue PART 1, 2012, Pages 258-271

  Rashid, Md Mamunur ^a   Karim, Md Rezaul ^a   Jeong, Byeong Soo ^a   Choi, Ho Jin ^b  

^a Kyung Hee University   (South Korea)

^b Korea Advanced Institute of Science and Technology (KAIST)   (South Korea)

Author keywords

Data mining; frequent pattern; interesting pattern; regularly frequent pattern

Indexed keywords

DATA MINING APPLICATIONS; FREQUENT PATTERN; INTERESTING PATTERN; INTERESTINGNESS; INTERVAL TIME; MARKET BASKET ANALYSIS; MEDICAL DATA ANALYSIS; MEMORY EFFICIENT; PERFORMANCE STUDY; REGULARLY FREQUENT PATTERN; TRANSACTIONAL DATABASE;

DATABASE SYSTEMS;

DATA MINING;

EID: 84860654390     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-29038-1_20     Document Type: Conference Paper

References (14)

1. Agrawal, R., Imielinski, T., Swami, A.N.: Mining Association Rules Between Sets of Items in Large Databases. In: ACM SIGMOD International Conference on Management of Data, pp. 207-216 (1993)
2. Han, J., Pei, J., Yin, Y.: Mining Frequent Patterns without Candidate Generation. In: ACM International Conference on Management of Data, pp. 1-12 (2000)
3. Tanbeer, S.K., Ahmed, C.F., Jeong, B.-S., Lee, Y.-K.: RP-Tree: A Tree Structure to Discover Regular Patterns in Transactional Database. In: Fyfe, C., Kim, D., Lee, S.-Y., Yin, H. (eds.) IDEAL 2008. LNCS, vol. 5326, pp. 193-200. Springer, Heidelberg (2008)
4. Chi, Y., Wang, H., Yu, P.S., Muntz, R.R.: Catch the Moment: Maintaining Closed Frequent Itemsets Over a Data Stream Sliding Window. Knowledge and Information System 10(3), 265-294 (2006)
5. Zaki, M.J., Hsiao, C.-J.: Efficient algorithms for mining closed itemsets and their lattice structure. IEEE Transactions on Knowledge and Data Engineering 17(4), 462-478 (2005)
6. Huang, Y., Xiong, H., Wu, W., Deng, P., Zhang, Z.: Mining maximal hyperclique pattern: A hybrid serach stategy. Information Sciences 177, 703-721 (2007)
7. Minh, Q.T., Oyanagi, S., Yamazaki, K.: Mining the K-Most Interesting Frequent Patterns Sequentially. In: Corchado, E., Yin, H., Botti, V., Fyfe, C. (eds.) IDEAL 2006. LNCS, vol. 4224, pp. 620-628. Springer, Heidelberg (2006)
8. Wang, H., Perng, C.-S., Ma, S., Yu, P.S.: Demand-driven frequent itemset mining using pattern structures. Knowledge and Information Systems 8, 82-102 (2005)
9. Tanbeer, S.K., Ahmed, C.F., Jeong, B.-S., Lee, Y.-K.: Efficient Single-Pass Frequent Pattern Mining using a prefix-tree. Information Sciences 179, 559-583 (2009)
10. Tanbeer, S.K., Ahmed, C.F., Jeong, B.-S., Lee, Y.-K.: Discovering Periodic-Frequent Patterns in Transactional Databases. In: Theeramunkong, T., Kijsirikul, B., Cercone, N., Ho, T.-B. (eds.) PAKDD 2009. LNCS (LNAI), vol. 5476, pp. 242-253. Springer, Heidelberg (2009)
11. Elfeky, M.G., Aref, W.G., Elmagarmid, A.K.: Periodicity detection in time series databases. IEEE Transactions on Knowledge and Data Engineering 17(7), 875-887 (2005)
12. Han, J., Dong, G., Yin, Y.: Efficient mining of partial periodic patterns in time series database. In: Proceedings of 15th International Conference on Data Engineering, pp. 106-115 (1999)
13. Ozden, B., Ramaswamy, S., Silberschatz, A.: Cyclic Association Rules. In: 14th International Conference on Data Engineering, pp. 412-421 (1998)
14. Toroslu, I.H., Kantarcioǧlu, M.: Mining Cyclically Repeated Patterns. In: Kambayashi, Y., Winiwarter, W., Arikawa, M. (eds.) DaWaK 2001. LNCS, vol. 2114, pp. 83-92. Springer, Heidelberg (2001)