Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2014, Article ID 934630, 13 pages
http://dx.doi.org/10.1155/2014/934630
Research Article

Partition of a Binary Matrix into ( ) Exclusive Row and Column Submatrices Is Difficult

1School of Computer Science and Technology, Shandong Institute of Business and Technology, Yantai 264005, China
2Key Laboratory of Intelligent Information Processing in Universities of Shandong (Shandong Institute of Business and Technology), Yantai 264005, China
3School of Computer Science and Technology, Shandong University, Jinan 250101, China

Received 25 March 2014; Revised 26 May 2014; Accepted 27 May 2014; Published 3 July 2014

Academic Editor: Anders Eriksson

Copyright © 2014 Peiqiang Liu et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. J. Abello, P. Pardalos, and M. Resende, Handbook of Massive Data Sets, vol. 4, Springer, Amsterdam, The Netherlands, 2002.
  2. A. K. Jain, “Data clustering: 50 years beyond K-means,” Pattern Recognition Letters, vol. 31, no. 8, pp. 651–666, 2010. View at Publisher · View at Google Scholar · View at Scopus
  3. S. Busygin, O. Prokopyev, and P. M. Pardalos, “Biclustering in data mining,” Computers & Operations Research, vol. 35, no. 9, pp. 2964–2987, 2008. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  4. J. Hartigan, “Direct clustering of a data matrix,” Journal of the American Statistical Association, pp. 123–129, 1972. View at Google Scholar
  5. B. Mirkin, Mathematical Classification and Clustering, vol. 11, Kluwer Academic Publishers, Dordrecht, The Netherlands, 1996. View at MathSciNet
  6. Y. Cheng and G. M. Church, “Biclustering of expression data,” in Proceedings of the International Conference on Intelligent Systems for Molecular Biology (ISMB '00), pp. 93–103, AAAI Press, 2000.
  7. J. Yang, W. Wang, H. Wang, and P. Yu, “δ-clusters: capturing subspace correlation in a large data set,” in Proceedings of the 18th International Conference on Data Engineering, pp. 517–528, March 2002. View at Scopus
  8. I. S. Dhillon, “Co-clustering documents and words using bipartite spectral graph partitioning,” in Proceedings of the 7th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 269–274, August 2001. View at Scopus
  9. Q. Sheng, Y. Moreau, and B. De Moor, “Biclustering microarray data by Gibbs sampling,” Bioinformatics, vol. 19, no. 2, pp. 196–205, 2003. View at Publisher · View at Google Scholar · View at Scopus
  10. A. Ben-Dor, B. Chor, R. Karp, and Z. Yakhini, “Discovering local structure in gene expression data: the order-preserving submatrix problem,” in Proceedings of the 6th Annual International Conference on Computational Biology, pp. 49–57, Washington, DC, USA, April 2002. View at Scopus
  11. S. C. Madeira and A. L. Oliveira, “Biclustering algorithms for biological data analysis: a survey,” IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol. 1, no. 1, pp. 24–45, 2004. View at Publisher · View at Google Scholar · View at Scopus
  12. A. Tanay, R. Sharan, and R. Shamir, “Biclustering algorithms: a survey,” in Handbook of Computational Molecular Biology, S. Aluru, Ed., pp. 261–274, Chapman & Hall/CRC, London, UK, 2006. View at Google Scholar
  13. R. Peeters, “The maximum edge biclique problem is NP-complete,” Discrete Applied Mathematics, vol. 131, no. 3, pp. 651–654, 2003. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  14. M. Dawande, P. Keskinocak, J. M. Swaminathan, and S. Tayur, “On bipartite and multipartite clique problems,” Journal of Algorithms. Cognition, Informatics and Logic, vol. 41, no. 2, pp. 388–403, 2001. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  15. N. Amit, The bicluster graph editing problem [M.S. thesis], Tel Aviv University, 2004.
  16. M. Dawande, P. Keskinocak, and S. Tayur, “On the biclique problem in bipartite graphs,” Gsia Working Paper, Carnegie Mellon University, 1996. View at Google Scholar
  17. M. H. Heydari, C. O. Shields Jr., L. Morales, and I. H. Sudborough, “Computing cross associations for attack graphs and other applications,” in Proceedings of the 40th Annual Hawaii International Conference on System Sciences (HICSS '08), p. 270b, IEEE Computer Society, Waikoloa, Hawaii, USA, January 2007. View at Publisher · View at Google Scholar · View at Scopus
  18. D. Bein, L. Morales, W. Bein, J. C. O. Shields, Z. Meng, and I. H. Sudborough, “Clustering and the biclique partition problem,” in Proceedings of the 41st Annual Hawaii International Conference on System Sciences (HICSS '08), p. 475, IEEE Computer Society Press, Waikoloa, Hawaii, USA, 2008.
  19. T. J. Schaefer, “The complexity of satisfiability problems,” in Proceedings of the 10th Annual ACM Symposium on Theory of Computing, pp. 216–226, ACM, San Diego, Calif, USA, 1978. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  20. M. R. Garey and D. S. Johnson, Computers and Intractability. A Guide to the Theory of NP-Completeness, W. H. Freeman, San Francisco, Calif, USA, 1979. View at MathSciNet
  21. A. Prelić, S. Bleuler, P. Zimmermann et al., “A systematic comparison and evaluation of biclustering methods for gene expression data,” Bioinformatics, vol. 22, no. 9, pp. 1122–1129, 2006. View at Publisher · View at Google Scholar · View at Scopus
  22. A. Tanay, R. Sharan, and R. Shamir, “Discovering statistically significant biclusters in gene expression data,” Bioinformatics, vol. 18, supplement 1, pp. S136–S144, 2002. View at Google Scholar · View at Scopus
  23. L. Wang, Y. Lin, and X. Liu, “Approximation algorithms for biclustering problems,” SIAM Journal on Computing, vol. 38, no. 4, pp. 1504–1518, 2008. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  24. Z. Y. Zhang, T. Li, C. Ding, X. W. Ren, and X. S. Zhang, “Binary matrix factorization for analyzing gene expression data,” Data Mining and Knowledge Discovery, vol. 20, no. 1, pp. 28–52, 2010. View at Publisher · View at Google Scholar · View at MathSciNet
  25. A. Figueroa, J. Borneman, and T. Jiang, “Clustering binary fingerprint vectors with missing values for DNA array data analysis,” Journal of Computational Biology, vol. 11, no. 5, pp. 887–901, 2004. View at Publisher · View at Google Scholar · View at Scopus
  26. R. Gelbard, O. Goldman, and I. Spiegler, “Investigating diversity of clustering methods: an empirical comparison,” Data and Knowledge Engineering, vol. 63, no. 1, pp. 155–166, 2007. View at Publisher · View at Google Scholar · View at Scopus
  27. P. Q. Liu, D. M. Zhu, Q. S. Xie, H. Fan, and S. H. Ma, “Complexity and improved heuristic algorithms for binary fingerprints clustering,” Journal of Software, vol. 19, no. 3, pp. 500–510, 2008. View at Publisher · View at Google Scholar · View at Scopus
  28. D. Chakrabarti, D. S. Modha, S. Papadimitriou, and C. Faloutsos, “Fully automatic cross-associations,” in Proceedings of the 10th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 79–88, ACM, August 2004. View at Scopus