Frequent closed itemset mining using prefix graphs with an efficient flow-based pruning strategy

Proceedings - IEEE International Conference on Data Mining, ICDM

Volumn , Issue , 2006, Pages 426-435

  Moonesinghe, H D K ^a   Fodeh, Samah ^a   Tan, Pang Ning ^a  

^a Michigan State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

FREQUENT CLOSED ITEMSET MINING; GRAPH BASED ALGORITHMS; LOW SUPPORT THRESHOLDS; PGMINERS; PREFIX GRAPHS; VARIABLE LENGTH BIT VECTORS;

DATA MINING; DATA STORAGE EQUIPMENT; DATABASE SYSTEMS; GRAPH THEORY; VECTORS;

ALGORITHMS;

EID: 34748914204     PISSN: 15504786     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDM.2006.74     Document Type: Conference Paper

References (12)

1. D. Burdick, M. Calimlim, and J. Gehrke. MAFIA: A Maximal Frequent Itemset Algorithm for Transactional Databases. In Proc. of ICDE, 2001.
2. G. Grahne, J. Zhu. Efficiently Using Prefix-trees in Mining Frequent Itemsets. In Proc. of FIMI'03, 2003.
3. J. Han, J. Pei, and Y. Yin. Mining Frequent Patterns without Candidate Generation. In proc. of ACM SIGMOD, 2000.
4. IBM Almaden. Synthetic Data Generation Code for Associations and Sequential Patterns. http://www.almaden.ibm.com/cs/quest/syndata.html.
5. C. Lucchese, S. Orlando, and R. Perego. Fast and Memory Efficient Mining of Frequent Closed Itemsets. TKDE, 2006.
6. H. D. K. Moonesinghe, S. Fodeh and P.-N. Tan. Frequent Closed Itemset Mining Using Prefix Graphs. Michigan State University, Technical Report, 2006.
7. N. Pasquier, Y. Bastide, R. Taouil, and L. Lakhal. Discovering frequent closed itemsets for association rules. In ICDT99, 1999.
8. J. Pei, J. Han, and R. Mao. CLOSET: An Efficient Algorithm for Mining Frequent Closed Itemsets. In Proc. of DMKD'OO, 2000.
9. N. G Singh, S. R. Singh, and A. K. Mahanta. CloseMiner: Discovering Frequent Closed Itemsets Using Frequent Closed Tidsets. In Proc. of ICDM, 2005.
10. J. Wang, J. Han, and J. Pei. CLOSET+: Searching for the Best Strategies for Mining Frequent Closed Itemsets. In Proc of ACM SIGKDD, 2003.
11. M. J. Zaki, K. Gouda. Fast vertical mining using diffsets. In Proc. of ACMSIGKDD, 2003.
12. M. J. Zaki, C. J. Hsiao. CHARM: An Efficient Algorithm for Closed Itemset Mining. In Proc of SDM'02, 2002.