Finding biclusters by random projections

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

Volumn 3109, Issue , 2004, Pages 102-116

  Lonardi, Stefano ^a   Szpankowski, Wojciech ^b   Yang, Qiaofeng ^a  

^a University of California Riverside   (United States)

^b Purdue University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTERS;

ASYMPTOTIC STUDY; BI CLUSTERS; EXTENSIVE SIMULATIONS; PROBABILISTIC ANALYSIS; RANDOM PROJECTIONS; RANDOMIZED ALGORITHMS; STATISTICAL SIGNIFICANCE; SYNTHETIC DATA;

PATTERN MATCHING;

EID: 34547333971     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-27801-6_8     Document Type: Article

References (28)

1. Agrawal, R., Gehrke, J., Gunopulos, D., Raghavan, P.: Automatic subspace clustering of high dimensional data for data mining applications. In: Proceedings of the ACM SIGMOD International Conference on Management of Data (SIGMOD-98). Volume 27,2 of ACM SIGMOD Record., New York, ACM Press (1998) 94-105
2. Aggarwal, C.C., Procopiuc, C., Wolf, J.L., Yu, P.S., Park, J.S.: Fast algorithms for projected clustering. In: Proceedings of the ACM SIGMOD International Conference on Management of Data (SIGMOD-99). Volume 28,2 of SIGMOD Record., New York, ACM Press (1999) 61-72
3. Cheng, Y., Church, G.M.: Biclustering of expression data. In: Proceedings of the 8th International Conference on Intelligent Systems for Molecular (ISMB-00), Menlo Park, CA, AAAI Press (2000) 93-103
4. Wang, H., Wang, W., Yang, J., Yu, P.S.: Clustering by pattern similarity in large data sets. In: Proceedings of the 2002 ACM SIGMOD international conference on Management of data (SIGMOD-02), New York, ACM Press (2002) 394-405
5. Tanay, A., Sharan, R., Shamir, R.: Discovering statistically significant biclusters in gene expression data. In: Proceedings of the 10th International Conference on Intelligent Systems for Molecular Biology (ISMB'02), in Bioinformatics. Volume 18. (2002) S136-S144
6. Ben-Dor, A., Chor, B., Karp, R., Yakhini, Z.: Discovering local structure in gene expression data: The order-preserving submatrix problem. In: Proceedings of Sixth International Conference on Computational Molecular Biology (RECOMB 2002), ACM Press (2002) 45-55
7. Zhang, L., Zhu, S.: A new clustering method for microarray data analysis. In: Proceedings of the First IEEE Computer Society Bioinformatics Conference (CSB'02), IEEE Press (2002) 268- 275
8. Sheng, Q., Moreau, Y., Moor, B.D.: Biclustering microarray data by Gibbs sampling. In: Proceedings of European Conference on Computational Biology (ECCB'03). (2003) to appear
9. Mishra, N., Ron, D., Swaminathan, R.: On finding large conjunctive clusters. In: Proc. of the ACM Conference on Computational Learning Theory (COLT'03). (2003) to appear
10. Procopiuc, M., Jones, M., Agarwal, P., Murali, T.M.: A Monte-Carlo algorithm for fast projective clustering. In: Proceedings of the 2002 International Conference on Management of Data (SIGMOD'02). (2002) 418-427
11. Hartigan, J.A.: Direct clustering of a data matrix. Journal of the American Statistical Association 67 (1972) 123-129
12. Murali, T.M., Kasif, S.: Extracting conserved gene expression motifs from gene expression data. In: Proceedings of the Pacific Symposium on Biocomputing (PSB'03). (2003) 77-88
13. Hochbaum, D.S.: Approximating clique and biclique problems. Journal of Algorithms 29 (1998) 174-200
14. Garey, M.R., Johnson, D.S.: Computers and intractability: a guide to the theory of NP-completeness. Freeman, New York, NY (1979)
15. Grigni, M., Manne, F.: On the complexity of the generalized block distribution. In: In proceedings of Irregular'96, The third international workshop on parallel algorithms for irregularly structured problems. Volume 1117., Lecture Notes in Computer Science, Springer (1996) 319-326
16. Peeters, R.: The maximum-edge biclique problem is NP-complete. Technical Report 789, Tilberg University: Faculty of Economics and Business Adminstration (2000)
17. Dawande, M., Keskinocak, P., Swaminathan, J.M., Tayur, S.: On bipartite and multipartite clique problems. Journal of Algorithms 41 (2001) 388-403
18. Pasechnik, D.V.: Bipartite sandwiches. Technical report, available at http://arXiv.org/abs/math.C0/9907109 (1999)
19. Reinert, G., Schbath, S., Waterman, M.S.: Probabilistic and statistical properties of words: An overview. J. Comput. Bio. 7 (2000) 1-46
20. Hastie, T., Tibshirani, R., Eisen, M., Alizadeh, A., Levy, R., Staudt, L., Chan, W., Botstein, D., Brown, P.: 'Gene shaving' as a method for identifying distinct sets of genes with similar expression patterns. Genome Biol. 1 (2000) 1-21
21. Lazzeroni, L., Owen, A.: Plaid models for gene expression data. Statistica Sinica 12 (2002) 61-86
22. Kluger, Y., Basri, R., Chang, J., Gerstein, M.: Spectral biclustering of microarray data: coclustering genes and conditions. Genome Res. 13 (2003) 703-16
23. Yang, J., Wang, H., Wang, W., Yu, P.S.: Enhanced biclustering on gene expression data. In: IEEE Symposium on Bioinformatics and Bioengineering (BIBE'03). (2003) to appear
24. Hanisch, D., Zien, A., Zimmer, R., Lengauer, T.: Co-clustering of biological networks and gene expression data. In: Proceedings of the 8th International Conference on Intelligent Systems for Molecular (ISMB-02), AAAI Press (2002) 145-154
25. Dhillon, I., Mallela, S., Modha, D.: Information-theoretic co-clustering. In: Proceedings of the Seventh ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD-03), ACM Press (2001) to appear
26. Gu, M., Zha, H., Ding, C., He, X., Simon, H.: Spectral relaxation models and structure analysis for k-way graph clustering and bi-clustering. Technical Report CSE-01-007, Department of Computer Science and Engineering, Pennsylvania State University (2001)
27. Dhillon, I.: Co-clustering documents and words using bipartite spectral graph partitioning. In: Proceedings of the Seventh ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD-01), New York, ACM Press (2001) 269-274
28. Szpankowski, W.: Average Case Analysis of Algorithms on Sequences. Wiley Interscience (2001)