On the size and recovery of submatrices of ones in a random binary matrix

Journal of Machine Learning Research

Volumn 9, Issue , 2008, Pages 2431-2453

  Sun, Xing ^a   Nobel, Andrew B ^b  

^a MERCK RESEARCH LABORATORIES   (United States)

^b UNIVERSITY OF NORTH CAROLINA   (United States)

Author keywords

Biclique; Bipartite graph; Frequent itemset mining; Statistical significance; Submatrix of 1s

Indexed keywords

ACOUSTIC NOISE; ASPECT RATIO; DATA MINING; DECISION SUPPORT SYSTEMS; GRAPH THEORY; INFORMATION MANAGEMENT; MINING; OSMIUM; STATISTICAL METHODS;

BICLIQUE; BIPARTITE GRAPH; FREQUENT ITEMSET MINING; STATISTICAL SIGNIFICANCE; SUBMATRIX OF 1S;

RANDOM PROCESSES;

EID: 57249084588     PISSN: 15324435     EISSN: 15337928     Source Type: Journal    
DOI: None     Document Type: Article

References (30)

1. R. Agrawal, T. Imielinski, and A. Swami. Mining association rules between sets of items in large databases. In Proceedings of the ACM SIGMOD International Conference on Management of data, pages 207-216, 1993.
2. R. Agrawal, H. Mannila, R. Srikant, H. Toivonen, and A. Verkamo. Fast discovery of association rules. In U. M. Fayyad et. al, editors, Advances in Knowledge Discovery and Data Mining, AAAI Press, Chapter 12, 307-328, 1996.
3. R. Agrawal, J. Gehrke, D. Gunopulos, and P. Raghavan. Automatic subspace clustering of high dimensional data for data mining applications. In Proceedings of the ACM SIGMOD international conference on Management of data, pages 94-105, 1998.
4. N. Alon and J. Spencer. The Probabilistic Method. John Wiley. New York, 1991.
5. B. Bollobás and P. Erdos. Cliques in random graphs. In Mathematical Proceedings of the Cambridge Philosophy Society, 80:419-427, 1976.
6. B. Bollobás. Random Graphs. 2nd ed., Cambridge University Press, 2001.
7. Y. Cheng and G. M. Church. Biclustering of expression data. In Proceedings of the 8th International Conference on Intelligent Systems for Molecular Biology, pages 93-103, 2000.
8. M. Dawande, P. Keskinocak, J. Swaminathan, and S. Tayur. On bipartite and multipartite clique problems. Journal of Algorithms, 41:388-403, 2001.
9. L. Devroye, L. Gyorfi, and G, Lugosi. A Probabilistic Theory of Pattern Recognition. Springer, New York, 1996.
10. M. R. Garey and D. S. Johnson. Computers and Intractability, A Guide to the Theory of NP-completeness. Freeman, San Francisco, 1979.
11. B. Goethals. Survey on Frequent Pattern Mining, www.adrem.ua.ac.be/ ~goethals/software/survey.pdf.2003.
12. J. Han, J. Pei and Y. Yin. Mining frequent patterns without candidate generation. In Proceedings of ACM SIGMOD International Conference on Management of Data, pages 1-12, 2000.
13. D. J. Hand, H. Mannila and P. Smyth. Principles of Data Mining. MIT Press, 2001.
14. D. S. Hochbaum. Approximating clique and biclique problems. Journal of Algorithms, 29(1):174-200, 1998.
15. M. Koyutürk, W. Szpankowski and A. Grama. Biclustering gene-feature matrices for statistically significant dense patterns. In Proceedings of the 8th Annual International Conference on Research in Computational Molecular Biology, pages 480-484, 2004.
16. J. Liu, S. Paulsen, W. Wang, A. B. Nobel, and J. Prins. Mining approximate frequent itemsets from noisy data. In Proceedings of the IEEE International Conference on Data Mining, pages 721-724, 2005.
17. 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. In Proceedings of the SIAM International Conference on Data Mining, pages 405-416, 2006.
18. S. Madeira and A. Oliveira. Biclustering algorithms for biological data analysis: A survey. IEEE Transactions on Computational Biology and Bioinformatics, 1(1):24-45, 2004.
19. D. Matula. The largest clique size in a random graph. CS 7608, Technical Report, Southern Methodist University, 1976.
20. N. Mishra, D. Ron, and R. Swaminathan. A new conceptual clustering framework. Machine Learning. 56(1-3):115-151, 2004.
21. G. Park and W. Szpankowski. Analysis of biclusters with applications to gene expression data. In Proceedings of Conference on Analysis of Algorithms, CS 7608, pages 267-274, 2005.
22. R. Peeters. The maximum edge biclique problem is NP-complete. Discrete Applied Mathematics, 131(3):651-654, 2003.
23. J. Pei, A. K. Tung, and J. Han. Fault-tolerant frequent pattern mining: Problems and challenges. In Proceedings of the ACM SIGMOD International Workshop on Research Issues on Data Mining and Knowledge Disco, 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. J. D. Reuning-Scherer. Mixture Models for Block Clustering. Ph.D. Thesis, Yale university, 1997.
26. J. K. Seppänen, and H. Mannila. Dense itemsets. In Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pages 683-688, 2004.
27. X. Sun. Significance and Recovery of Block Structures in Binary and Real-valued Matrices with Noise. Ph.D. Thesis, UNC Chapel Hill, 2007.
28. A. Tanay, R. Sharan, and R. Shamir. Discovering statistically significant biclusters in gene expression data. Bioinformatics, 18:136-144, 2002
29. A. Tanay, R. Sharan and R. Shamir. Biclustering algorithms: A survey. Handbook of Computational Molecular Biology, Chapman & Hall/CRC, Computer and Information Science Series, 2005.
30. C. Yang, U. Fayyad, and P. S. Bradley. Efficient discovery of error-tolerant frequent itemsets in high dimensions. In Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pages 194-203, 2001.