Max-FTP: Mining maximal fault-tolerant frequent patterns from databases

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

Volumn 4587 LNCS, Issue , 2007, Pages 235-246

  Bashir, Shariq ^a   Baig, A Rauf ^a  

^a NATIONAL UNIVERSITY OF COMPUTER AND EMERGING SCIENCES   (Pakistan)

Author keywords

Association rules; Bit vector representation; Fault tolerant frequent patterns mining; Maximal frequent patterns mining

Indexed keywords

ALGORITHMS; ASSOCIATION RULES; DATABASE SYSTEMS; FAULT TOLERANCE;

BIT-VECTOR REPRESENTATION; FAULT TOLERANT FREQUENT PATTERNS MINING; MAXIMAL FREQUENT PATTERNS MINING;

DATA MINING;

EID: 38349063037     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-73390-4_26     Document Type: Conference Paper

References (7)

1. Agrawal, R., Srikant, R.: Fast Algorithms for Mining Association Rules. In: Proc. Int'l Conf. Very Large Data Bases, pp. 487-499 (September 1994)
2. Burdick, D., Calimlim, M., Gehrke, J.: Mafia: A maximal frequent itemset algorithm for transactional databases. In: Proc. of ICDE Conf, pp. 443-452 (2001)
3. Bayardo, R.J.: Efficiently mining long patterns from databases. SIGMOD, 85-93 (1998)
4. Koh, J.L., Yo, P.: An Efficient Approach for Mining Fault-Tolerant Frequent Patterns based on Bit Vector Representations. In: Zhou, L.-z., Ooi, B.-C., Meng, X. (eds.) DASFAA 2005. LNCS, vol. 3453, pp. 17-20. Springer, Heidelberg (2005)
5. Gouda, K., Zaki, M.J.: Efficiently mining maximal frequent itemsets. In: ICDM, pp. 163-170 (2001)
6. Pei, J., Tung, A.K.H., Han, J.: Fault-Tolerant Frequent Pattern Mining: Problems and Challenges. In: The proceedings of ACM-SIGMOD Int. Workshop on Research Issues on Data Mining and Knowledge Discovery (DMKD'01) (2001)
7. Rymon, R.: Search through Systematic Set Enumeration. In: Proc. Of Third Int'l Conf. On Principles of Knowledge Representation and Reasoning, pp. 539-550 (1992)