Fully dynamic quasi-biclique edge covers via boolean matrix factorizations

Proceedings of the Workshop on Dynamic Networks Management and Mining, DyNetMM 2013

Volumn , Issue , 2013, Pages 17-24

  Miettinen, Pauli ^a  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

Biclique covers; Boolean matrix factorization; Dynamic algorithm; MDL

Indexed keywords

ALGORITHMS; GRAPH THEORY;

BICLIQUE; BIPARTITE GRAPHS; BOOLEAN MATRIX; DYNAMIC ALGORITHM; DYNAMIC SETTINGS; MDL; REAL-WORLD GRAPHS; RESEARCH INTERESTS;

FACTORIZATION;

EID: 84899691938     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2489247.2489250     Document Type: Conference Paper

References (19)

1. N. Benchettara, R. Kanawati, and C. Rouveirol. Supervised machine learning applied to link prediction in bipartite social networks. In ASONAM '10, pages 326-330. IEEE, 2010.
2. E. Bingham, A. Kabán, and M. Fortelius. The aspect Bernoulli model: multiple causes of presences and absences. Pattern Anal. Appl., 12(1):55-78, 2009.
3. S. C. Deerwester et al. Indexing by latent semantic analysis. J. Am. Soc. Inform. Sci., 41(6):391-407, 1990.
4. D. Duan, Y. Li, R. Li, and Z. Lu. Incremental K-clique clustering in dynamic social networks. Artif. Intell. Rev., May 2011.
5. D. Dunlavy, T. G. Kolda, and E. Acar. Temporal Link Prediction Using Matrix and Tensor Factorizations. ACM TKDD, 5(2), 2011.
6. F. Geerts, B. Goethals, and T. Mielikäinen. Tiling databases. In DS '04, pages 77-122, 2004.
7. P. Miettinen. On the positive-negative partial set cover problem. Information Processing Letters, 108(4):219-221, 2008.
8. P. Miettinen. Matrix Decomposition Methods for Data Mining: Computational Complexity and Algorithms. PhD thesis, Department of Computer Science, University of Helsinki, 2009.
9. P. Miettinen. Sparse Boolean Matrix Factorizations. In ICDM '10, pages 935-940, 2010.
10. P. Miettinen. Dynamic Boolean Matrix Factorizations. In ICDM '12, pages 519-528, Dec. 2012.
11. P. Miettinen, T. Mielikäinen, A. Gionis, G. Das, and H. Mannila. The Discrete Basis Problem. IEEE TKDE, 20(10):1348-1362, Oct. 2008.
12. P. Miettinen and J. Vreeken. Model Order Selection for Boolean Matrix Factorization. In KDD '11, pages 51-59, 2011.
13. P. Miettinen and J. Vreeken. MDL4BMF: Minimum Description Length for Boolean Matrix Factorization. Technical Report MPI-I-2012-5-001, Max-Planck-Institut für Informatik, June 2012.
14. S. D. Monson, N. J. Pullman, and R. Rees. A Survey of Clique and Biclique Coverings and Factorizations of (0,1)-Matrices. Bull. ICA, 14:17-86, 1995.
15. R. Pagh and F. F. Rodler. Cuckoo hashing. J. Algorithm, 51(2):122-144, 2004.
16. J. Rissanen. Modeling by shortest data description. Automatica, 14(5):465-471, Sept. 1978.
17. A. Saha and V. Sindhwani. Learning evolving and emerging topics in social media: A dynamic NMF approach with temporal regularization. In WSDM '12, pages 693-702, 2012.
18. A. Streich, M. Frank, D. Basin, and J. M. Buhmann. Multi-assignment clustering for Boolean data. In ICML '09, 2009.
19. Z.-Y. Zhang, T. Li, C. Ding, X.-W. Ren, and X.-S. Zhang. Binary matrix factorization for analyzing gene expression data. Data Min. Knowl. Discov., 20(1):28-52, 2010.