Significance and recovery of block structures in binary matrices with noise

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

Volumn 4005 LNAI, Issue , 2006, Pages 109-122

  Sun, Xing ^a   Nobel, Andrew ^a,b  

^a UNIVERSITY OF NORTH CAROLINA   (United States)

^b Brooks Computer Science Building   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DATA MINING; MATHEMATICAL MODELS; PROBLEM SOLVING; STATISTICAL MECHANICS; THEOREM PROVING;

FREQUENT ITEMSET MINING (FIM); TARGET SUBMATRIX;

DATA STRUCTURES;

EID: 33746089532     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11776420_11     Document Type: Conference Paper

References (31)

1. R. Agrawal, T. Imielinski, and A. Swami. Mining association rules between sets of items in large databases. Proceedings of ACM SIGMOD'93, 207 -216, 1993.
2. R. Agrawal, H. Mannila, R. Srikant, H. Toivonen, and A Verkamo. Fast discovery of association rules. Advances in Knowledge Discovery and Data Mining, 307-328, AAAI/MITPress, 1996.
3. R. Agrawal, J. Gehrke, D. Gunopulos and P.Raghavan. Automatic subspace clustering of high dimensional data for data mining applications. Proceedings of ACM SIGMOD'98, 94-105, 1998.
4. B. Bollobás and P. Erdös. Cliques in random graphs. Math. Proc. Cam. Phil. Soc., 80: p 419-427, 1976.
5. B. Bollobás. Random Graphs second edition. Cambridge Studies in Advanced Mathematics, 2001.
6. D. Chakrabarti, S. Papadimitriou, D. Modha and C. Faloutsos. Fully Automatic Cross-Associations. Proceedings of ACM SIGKDD'04, 79-88, 2004.
7. Y. Cheng and G.M. Church. Biclustering of expression data. Proceedings of ISMB'00, 93-103, 2000.
8. M. Dawande, P. Keskinocak, J. Swaminathan, and S. Tayur. On bipartite and multipartite clique problems. J. Algorithms 41(2): 388-403, 2001.
9. L. Devroye, L. Györfi, and G. Lugosi. A Probabilistic Theory of Pattern Recognition. Springer, New York 1996.
10. I. Dhillon, S. Mallela, and D. Modha. Information-Theoretic Co-clustering. Proceedings of ACM SIGKDD'03, 89-98, 2003
11. S.Dudoit and J. Fridlyand. Bagging to improve the accuracy of a clustering procedure. Bioinformatics, 19(9): 1090-1099, 2003.
12. G.R. Grimmett and C.J.H. McDiarmid. On colouring random graphs. Math. Proc. Cam. Phil. Soc., 77: 313-324, 1975.
13. J. Han, J. Pei, and Y. Yin. Mining Frequent Patterns without Candidate Generation. Proceedings of ACM SIGMOD'00, 1-12, 2000.
14. D. J. Hand, H. Mannila and P. Smyth. Principles of Data Mining. MIT Press 2001
15. R. Karp. Probabilistic Analysis of Algorithms. Class Notes, UC-Berkeley 1988.
16. M. Koyutürk, W. Szpankowski, and A. Grama. Biclustering Gene-Feature Matrices for Statistically Significant Dense Patterns. IEEE Computer Society Bioinformatics Conference, 480-483, Stanford, 2004.
17. T. Lange, V. Roth, M. Braun, and J. Buhmann. Stability-Based Validation of Clustering Solution. Neural Computation, 16(6): 1299-1323, 2004.
18. J. Liu, S. Paulsen, W. Wang, A. B. Nobel, and J. Prins. Mining Approximate Frequent Itemsets from Noisy Data. Proceedings of ICDM'05, 721-724, 2005.
19. J. Liu, S. Paulsen, X. Sun, W. Wang, A.B. Nobel, and J. Prins. Mining approximate frequent itemsets in the presence of noise: algorithm and analysis. To appear in Proceedings of SDM 2006.
20. D. Matula. The largest clique size in a random graph. Southern Methodist University, Tech. Report, CS 7608, 1976.
21. S. Madeira and A. Oliveira. Biclustering algorithms for biological data analysis: A survey. IEEE/ACM Transactions on Computational Biology and Bioinformatics 1(1): 24-45, 2004
22. M. Okamoto. Some inequalities relating to the partial sum of binomial probabilities. Annals of the Institute of Statistical Mathematics, 10: 29-35, 1958
23. J. Pei, A.K. Tung, and J. Han. Fault-tolerant frequent pattern mining: Problems and challenges. Proceedings of DMKD'01, 2001.
24. J. Pei, G. Dong, W. Zou, and J. Han. Mining Condensed Frequent-Pattern Bases. Knowledge and Information Systems, 6(5): 570-594, 2002.
25. G. Park and W. Szpankowshi. Analysis of biclusters with applications to gene expression data. Proceeding of AoA'05, 2005.
26. J. D. Reuning-Scherer. Mixture Models for Block Clustering. Phd Thesis, Yale university 1997.
27. J. K. Seppänen, and H. Mannila. Dense Itemsets. Proceedings of ACM SIGKDD'04, 683-688, 2004.
28. A. Tanay, R. Sharan, and R. Shamir. Discovering statistically significant biclusters in gene expression data. Bioinformatics, 18(1): 136-144, 2002.
29. A. Tanay, R. Sharan and R. Shamir. Biclustering Algorithms: A Survey. In Handbook of Computational Molecular Biology, Chapman & Hall/CRC, Computer and Information Science Series, 2005. In press.
30. R. Tibshirani, G. Walther and T. Hastie. Estimating the number of clusters in a dataset via gap statistic. Technical Report 208, Dept of Statistics, Stanford University, 2000.
31. C. Yang, U. Fayyad, and P. S. Bradley. Efficient discovery of error-tolerant frequent itemsets in high dimensions. Proceedings of ACM SIGKDD'01, 194-203, 2001.