Performance analysis of frequent itemset mining using hybrid database representation approach

10th IEEE International Multitopic Conference 2006, INMIC

Volumn , Issue , 2006, Pages 237-243

  Bashir, Shariq ^a   Baig, A Rauf ^a  

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

Author keywords

Association rules mining; Data mining; Frequent itemset mining; Maximal frequent itemset mining

Indexed keywords

ADMINISTRATIVE DATA PROCESSING; BENCHMARKING; BOOLEAN FUNCTIONS; COMBINES; DATABASE SYSTEMS; DECISION SUPPORT SYSTEMS; INFORMATION MANAGEMENT; KNOWLEDGE MANAGEMENT; MINING; SEARCH ENGINES;

(E ,3E) PROCESS; BENCHMARK DATASETS; DATA SETS; DATA-SETS; FREQUENCY COUNTING; FREQUENT ITEMSET MINING; HYBRID APPROACHES; HYBRID STRATEGIES; INTERNATIONAL (CO); ITEM SET MINING; ITEM SETS; ITEMSETS; MAXIMAL FREQUENT ITEMSETS; PERFORMANCE ANALYSES; REAL-WORLD APPLICATIONS; TRANSACTIONAL DATABASES;

ALGORITHMS;

EID: 46449133650     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INMIC.2006.358170     Document Type: Conference Paper

References (14)

1. R. Agrawal, T. Imielinski, and A. Swami, "Mining Association Rules between Sets of Items in Large Databases," Proc. ACMSIGMOD Int'l Conf. Management of Data, pp. 207-216, May 1993.
2. R. Agrawal and R. Srikant, "Fast Algorithms for Mining Association Rules," Proc. Int'l Conf. Very Large Data Bases, pp. 487-499, Sept. 1994.
3. th IEEE-INMIC conference, Karachi, Pakistan, 2005.
4. D. Burdick, M. Calimlim, and J. Gehrke, "Mafia: A maximal frequent itemset algorithm for transactional databases", In Proc. of ICDE Conf, pp. 443-452, 2001.
5. Proc. IEEE ICDM Workshop Frequent Itemset Mining Implementations, B. Goethals and M.J. Zaki, eds., CEUR Workshop Proc., vol. 80, Nov. 2003, http://CEUR-WS.org/Vol-90.
6. K. Gouda and M. J. Zaki, "Efficiently mining maximal frequent itemsets", In ICDM, pp. 163-170, 2001.
7. G. Grahne and J. Zhu, "Efficiently Using Prefix-trees in Mining Frequent Itemsets", In Proc. of the IEEE ICDM Workshop on Frequent Itemset Mining Implementations, 2003.
8. J. Han, J. Pei, and Y. Yin, "Mining frequent patterns without candidate generation", In SIGMOD, pages 1-12, 2000.
9. J. Liu, Y. Pan, K. Wang, and J. Han. "Mining frequent item sets by opportunistic projection", In Proc. of KDD Conf., 2002.
10. G. Liu, H. Lu, Y. Xu, and J. X. Yu, "Ascending frequency ordered prefix-tree: Efficient mining of frequent patterns", In DASFAA, 2003.
11. J. Pei, J. Han, H. Lu, S. Nishio, S. Tang and D. Yang, "H-Mine: Hyper-structure mining of frequent patterns in large databases", In Proc. of ICDM Conf., pp. 441.448, 2001.
12. A. Pietracaprina and D. Zandolin, "Mining Frequent Itemsets Using Patricia Tries," Proc. IEEE ICDM Workshop Frequent Itemset Mining Implementations, CEUR Workshop Proc., vol. 80, Nov. 2003.
13. st Int'l Workshop on Open Source Data Mining (in conjunction with SIGKLDD2005), 2005.
14. M. J. Zaki and C. Hsiao, "Charm: An efficient algorithm for closed association rule mining", In Technical Report 99-10, Computer Science, Rensselaer Polytechnic Institute, 1999.