AC-close: Efficiently mining approximate closed itemsets by core pattern recovery

Proceedings - IEEE International Conference on Data Mining, ICDM

Volumn , Issue , 2006, Pages 839-844

  Cheng, Hong ^a   Yu, Philip S ^b   Han, Jiawei ^a  

^a UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

^b IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

PATTERN MINING; PATTERN RECOVERY; PRUNING STRATEGIES; RANDOM NOISE;

APPROXIMATION THEORY; DATA REDUCTION; DATA STRUCTURES; PATTERN MATCHING;

DATA MINING;

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

References (12)

1. R. Agrawal and R. Srikant. Fast algorithms for mining association rules. In Proc. VLDB'94, pages 487-499.
2. R. J. Bayardo. Efficiently mining long patterns from databases. In Proc. SIGMOD'98, pages 85-93.
3. J. Boulicaut, A. Bykowski, and C. Rigotti. Approximation of frequency queries by means of free-sets. In Proc. PKDD'00, pages 75-85.
4. J. Han, J. Pei, and Y. Yin. Mining frequent patterns without candidate generation. In Proc. SIGMOD'OO, pages 1-12.
5. J. Liu, S. Paulsen, X. Sun, W. Wang, A. Nobel, and J. Prins. Mining approximate frequent itemsets in the presence of noise: Algorithm and analysis. In Proc. SDM'06, pages 405-416.
6. H. Mannila and H. Toivonen. Multiple uses of frequent sets and condensed representations. In Proc. KDD '96, pages 189-194.
7. J. Pei, G. Dong, W. Zou, and J. Han. Mining condensed frequent pattern bases. Knowledge and Information Systems, 6(5):570-594, 2004.
8. J. Pei, J. Han, and R. Mao. CLOSET: An efficient algorithm for mining frequent closed itemsets. In Proc. DMKD'00, pages 21-30.
9. J. Seppänen and H. Mannila. Dense itemsets. In Proc. KDD'04, pages 683-688.
10. M. Steinbach, P. Tan, and V. Kumar. Support envelopes: A technique for exploring the structure of association patterns. In Proc. KDD'04, pages 296-305.
11. C. Yang, U. Fayyad, and P. S. Bradley. Efficient discovery of error-tolerant frequent itemsets in high dimensions. In Proc. KDD'01, pages 194-203.
12. M. J. Zaki. Scalable algorithms for association mining. IEEE Trans. Knowledge and Data Engineering, 12(2):372-390, 2000.