A continuous characterization of the maximum-edge biclique problem

Journal of Global Optimization

Volumn 58, Issue 3, 2014, Pages 439-464

  Gillis, Nicolas ^a   Glineur, François ^a  

^a UNIVERSITÉ CATHOLIQUE DE LOUVAIN   (Belgium)

Author keywords

Algorithmic complexity; Biclique finding algorithm; Maximum edge biclique problem; Nonnegative rank one approximation

Indexed keywords

COMPUTATIONAL COMPLEXITY; DATA MINING; GRAPH THEORY;

ALGORITHMIC COMPLEXITY; COMBINATORIAL OPTIMIZATION PROBLEMS; CONTINUOUS OPTIMIZATION PROBLEMS; FINDING ALGORITHM; MAXIMUM-EDGE BICLIQUE PROBLEMS; NON NEGATIVES; NON-NEGATIVITY CONSTRAINTS; WEB COMMUNITY DISCOVERIES;

ITERATIVE METHODS;

EID: 84899423830     PISSN: 09255001     EISSN: 15732916     Source Type: Journal    
DOI: 10.1007/s10898-013-0053-2     Document Type: Article

References (18)

1. Alexe, G., Alexe, S., Crama, Y., Foldes, S., Hammer, P., Simeone, B.: Consensus algorithms for the generation of all maximal bicliques. Discret. Appl. Math. 145(1), 11-21 (2004)
2. Bomze, I.: Evolution towards the maximum clique. J. Glob. Opt. 10, 143-164 (1997)
3. Ding, C., Li, T., Jordan, M.: Nonnegative matrix factorization for combinatorial optimization: spectral clustering, graph matching, and clique finding. In: IEEE International Conference on Data Mining, pp. 183-192 (2008)
4. Ding, C., Zhang, Y., Li, T., Holbrook, S.: Biclustering protein complex interactions with a biclique finding algorithm. In: IEEE International Conference on Data Mining, pp. 178-187 (2006)
5. Dolan, E., Moré, J.: Benchmarking optimization software with performance profiles. Math. Prog. Ser. A 91, 201-213 (2002)
6. Gibbons, L., Hearn, D., Pardalos, P., Ramana, M.: Continuous characterizations of the maximum clique problem. Math. Oper. Res. 22(3), 754-768 (1997)
7. Gillis, N.: Nonnegative Matrix Factorization: Complexity, Algorithms and Applications. Ph. D. Thesis, Université catholique de Louvain (2011)
8. Gillis, N., Glineur, F.: Nonnegative Factorization and The Maximum Edge Biclique Problem (2008). CORE Discuss. pap. 2008/64
9. Golub, G., Van Loan, C.: Matrix Computation, 3rd edn. The Johns Hopkins University Press, Baltimore (1996)
10. Grippo, L., Sciandrone, M.: On the convergence of the block nonlinear Gauss-Seidel method under convex constraints. Oper. Res. Lett. 26, 127-136 (2000)
11. Gurobi Optimization, I.: Gurobi Optimizer Reference Manual (2012). http://www.gurobi.com
12. Lehmann, S., Schwartz, M., Hansen, L.: Biclique communities. Phys. Rev. E 78(1), 016108 (2008)
13. Liu, G., Sim, K., Li, J.: Efficient Mining of Large Maximal Bicliques, Lect. Notes in Comput. Sci. pp. 437-448. Springer, Berlin (2006)
14. Motzkin, T., Strauss, E.: Maxima for graphs and a new proof of a theorem of Turan. Can. J. Math. 17, 533-540 (1965)
15. Peeters, R.: The maximum edge biclique problem is NP-complete. Discret. Appl. Math. 131(3), 651-654 (2003)
16. Prelic, A., Bleuler, S., Zimmermann, P., Wille, A., Buhlmann, P., Gruissemb, W., Hennig, L., Thiele, L., Zitzler, E.: A systematic comparison and evaluation of biclustering methods for gene expression data. Bioinformatics 22(9), 1122-1129 (2008)
17. Stewart, G., Sun, J. G.: Matrix Perturbation Theory. Academic Press, San Diego (1990)
18. Zhong, S., Ghosh, J.: Generative model-based document clustering: a comparative study. Knowl. Inf. Syst. 8(3), 374-384 (2005)