Mining approximate frequent itemsets in the presence of noise: Algorithm and analysis

Proceedings of the Sixth SIAM International Conference on Data Mining

Volumn 2006, Issue , 2006, Pages 407-418

  Liu, Jinze ^a   Paulsen, Susan ^a   Sun, Xing ^b   Wang, Wei ^a   Nobel, Andrew ^a,b   Prins, Jan ^a  

^a UNIVERSITY OF NORTH CAROLINA   (United States)

^b University of North Carolina at Chapel Hill   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER APPLICATIONS; COMPUTER SIMULATION; DATA REDUCTION; MATHEMATICAL MODELS; REAL TIME SYSTEMS; SET THEORY; SPURIOUS SIGNAL NOISE;

APPROXIMATE FREQUENT ITEMSETS (AFI); LOGARITHMIC SIZE; NOISE TOLERANT ALGORITHMS; TRANSACTION;

DATA MINING;

EID: 33745443433     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611972764.36     Document Type: Conference Paper

References (20)

1. R. Agrawal, T. Imielinski, and A. Swami. Mining association rules between sets of items in large databases In SIGMOD 1993.
2. R. Agrawal, H. Mannila, R. Srikant, H. Toivonen, and A Verkamo. Fast discovery of association rules. In U. M. Fayyad, G. Piatetsky-Shapiro, P. Smyth, and R. Uthurusamy, editors, Advances in Knowledge Discove and Data Mining, chapter 12, pages 307328. AAAI Pre 1996.
3. C. Becquet, S. Blachon, B. Jeudy, J.F. Boulicaut, O. Gandrillon. Strong-association-rule mining for large-scale gene-expression data analysis: a case study on humaMining gene expression databases for association rules. n SAGE data. Genome Biol. 2002
4. B. Bollobás. Random Graphs second edition. Cambridge Studies in Advanced Mathematics, 2001.
5. B. Bollobás, P. Erdos. Cliques in random graphs. Mathematical Proceedings of the Cambridge Philosophical Society, 80:419C427, 1976.
6. D. Chakrabarti, S. Papadimitriou, D. Modha and C. Faloutsos, Fully Automatic Cross-Assocations. KDD 2004.
7. C. Creighton, S. Hanash. Mining gene expression databases for association rules. Bioinformatics. 2003 Jan;19(1):79-86.
8. C. Gao, Anthony K. H. Tung, X. Xin, P. Feng, J. Yang. "FARMER: Finding Interesting Rule Groups in Microarray Datasets".
9. J. Liu, S. Paulsen, W.Wang, A. Nobel, J. Prins. Mining Approximate Frequent Itemset from Noisy Data. Technical Report(TR05-015) of Department of Compuater Science, UNC-Chapel Hill, 2005 Jun.
10. J. Liu, S. Paulsen, W. Wang, A. Nobel, J. Prins. "Mining Approximate Frequent Itemset from Noisy Data", In ICDM 2005.
11. J. Pei, A. K. Tung, and J. Han. Fault-tolerant frequent pattern mining: Problems and challenges. In Workshop on Research Issues in Data Mining and Knowledge Discovery, 2001.
12. J. Pei, G. Dong, W. Zou, J. Han. Mining Condensed Frequent-Pattern Bases. Knowledge and Information Systems, Volume 6, Issue 5. 2002.
13. J. K. Seppanen, H. Mannila. Dense Itemsets. In SIGKDD 2004.
14. S. Bernstein,The theory of Probabilities. Gastehizdat Publishing House. Moscow 1946
15. M. Steinbach, P. Tan, V. Kumar. Support envelopes: a technique for exploring the structure of association patterns. In SIGKDD 2004.
16. P. J. Unmack. Biogeography of Australian freshwater fishes. Journal of Biogeography. Vol. 28: pages 1053-1089. Blackwell Science Ltd. 2001.
17. X. Sun, and A.B. Nobel, Significance and recovery of block structures in binary matrices with noise. 2005 Tech. Rep. Department of Statistics and Operation Research, UNC Chapel Hill.
18. Cheng Yang, Usama Fayyad, Paul S. Bradley. Efficient discovery of error-tolerant frequent itemsets in high dimensions. In SIGKDD 2001.
19. M. C. Yang, Q. G. Ruan, J. J Yang., S. Eckenrode, S. Wu, R. A. McIndoe, and J. X. She., A statistical method for agging weak spots improves normalization and ratio estimates in microarrays, Physiol. Genomics, 7:4553, 2001.
20. UCI machine learning repository. (http://www.ics.uci.edu/mlearn/ MLSummary.html).