Fetching the paper…
Reading the bibliography…
The goal of Boolean Matrix Factorization (BMF) is to approximate a given binary matrix as the product of two low-rank binary factor matrices, where the product of the factor matrices is computed under the Boolean algebra.
Noisy and incomplete boolean matrix factorization via expectation maximization
Liang, L. and Lu, S. (2019) · 1905
Earlier work this paper cites.
Streaming PTAS for binary ℓ 0 \ell_{0} –low rank approximation
Bhattacharya, A., Goyal, D., Jaiswal, R., and Kumar, A. (2019) · 1909
Earlier work this paper cites.
Improved clustering algorithms for the bipartite stochastic block model
Ndaoud, M., Sigalla, S., and Tsybakov, A. B. (2019) · 1911
Earlier work this paper cites.
Contentment in graph theory: Covering graphs with cliques
Orlin, J. (1977) · 1977
Earlier work this paper cites.
Modeling by shortest data description
Rissanen, J. (1978) · 1978
Earlier work this paper cites.
Boolean matrix theory and applications
Kim, K. H. (1982) · 1982
Earlier work this paper cites.
A survey of clique and biclique coverings and factorizations of (0,1)-matrices
Monson, S. D., Pullman, N. J., and Rees, R. (1995) · 1995
Earlier work this paper cites.
Formal Concept Analysis: Mathematical Foundations
Ganter, B. and Wille, R. (1999) · 1999
Earlier work this paper cites.
Co-clustering documents and words using bipartite spectral graph partitioning
Dhillon, I. S. (2001) · 2001
Earlier work this paper cites.
Bipartite graph partitioning and data clustering
Zha, H., He, X., Ding, C. H. Q., Gu, M., and Simon, H. D. (2001) · 2001
Earlier work this paper cites.
Tiling databases
Geerts, F., Goethals, B., and Mielikäinen, T. (2004) · 2004
Earlier work this paper cites.
The discrete basis problem
Miettinen, P., Mielikäinen, T., Gionis, A., Das, G., and Mannila, H. (2006) · 2006
Earlier work this paper cites.
The role mining problem: Finding a minimal descriptive set of roles
Vaidya, J., Atluri, V., and Guo, Q. (2007) · 2007
Earlier work this paper cites.
Fast exact and heuristic methods for role minimization problems
Ene, A., Horne, W., Milosavljevic, N., Rao, P., Schreiber, R., and Tarjan, R. E. (2008) · 2008
Earlier work this paper cites.
Data reduction and exact algorithms for clique cover
Gramm, J., Guo, J., Hüffner, F., and Niedermeier, R. (2008) · 2008
Earlier work this paper cites.
The discrete basis problem
Miettinen, P., Mielikäinen, T., Gionis, A., Das, G., and Mannila, H. (2008) · 2008
Earlier work this paper cites.
Matrix Decomposition Methods for Data Mining: Computational Complexity and Algorithms
Miettinen, P. (2009) · 2009
Earlier work this paper cites.
Discovery of optimal factors in binary data via a novel method of matrix decomposition
Bělohlávek, R. and Vychodil, V. (2010) · 2010
Earlier work this paper cites.
Boolean tensor factorizations
Miettinen, P. (2011) · 2011
Cited alongside, same era.
On finding joint subspace Boolean matrix factorizations
Miettinen, P. (2012) · 2012
Cited alongside, same era.
Multi-label classification using Boolean matrix decomposition
Wicker, J., Pfahringer, B., and Kramer, S. (2012) · 2012
Cited alongside, same era.
Walk’n’Merge: A scalable algorithm for Boolean tensor factorization
Erdős, D. and Miettinen, P. (2013) · 2013
Cited alongside, same era.
A unifying framework for mining approximate top- k k binary patterns
Lucchese, C., Orlando, S., and Perego, R. (2013) · 2013
Cited alongside, same era.
On the complexity and approximation of binary evidence in lifted inference
van den Broeck, G. and Darwiche, A. (2013) · 2013
Cited alongside, same era.
A new algorithm for Boolean matrix factorization which admits overcovering
Bělohlávek, R. and Trnecka, M. (2018) · 2018
Later among the works it cites.
Identifying dynamics of brain function via Boolean matrix factorization
Haddad, A., Shamsi, F., Zhu, L., and Najafizadeh, L. (2018) · 2018
Later among the works it cites.
BLASYS: approximate logic synthesis using Boolean matrix factorization
Hashemi, S., Tann, H., and Reda, S. (2018) · 2018
Later among the works it cites.
The trustworthy pal: Controlling the false discovery rate in Boolean matrix factorization
Hess, S., Piatkowski, N., and Morik, K. (2018) · 2018
Later among the works it cites.
Summarizing network processes with network-constrained Boolean matrix factorization
Kocayusufoglu, F., Hoang, M. X., and Singh, A. K. (2018) · 2018
Later among the works it cites.
Bipartite stochastic block models with tiny clusters
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
1-bit matrix completion
Davenport, M. A., Plan, Y., van den Berg, E., and Wootters, M. (2014) · 2014
Cited alongside, same era.
Two expectation-maximization algorithms for Boolean factor analysis
Frolov, A. A., Húsek, D., and Polyakov, P. Y. (2014) · 2014
Cited alongside, same era.
MDL4BMF: Minimum description length for Boolean matrix factorization
Miettinen, P. and Vreeken, J. (2014) · 2014
Cited alongside, same era.
BMaD – A Boolean matrix decomposition framework
Tyukin, A., Kramer, S., and Wicker, J. (2014) · 2014
Cited alongside, same era.
Jointly clustering rows and columns of binary matrices: Agorithms and trade-offs
Xu, J., Wu, R., Zhu, K., Hajek, B. E., Srikant, R., and Ying, L. (2014) · 2014
Cited alongside, same era.
From-below approximations in Boolean matrix factorization: Geometry and new algorithm
Bělohlávek, R. and Trnecka, M. (2015) · 2015
Cited alongside, same era.
Neumann, S. (2018) · 2018
Later among the works it cites.
Probabilistic Boolean tensor decomposition
Rukat, T., Holmes, C. C., and Yau, C. (2018) · 2018
Later among the works it cites.
Optimal bipartite network clustering
Zhou, Z. and Amini, A. A. (2018) · 2018
Later among the works it cites.
A PTAS for ℓ p \ell_{p} -low rank approximation
Ban, F., Bhattiprolu, V., Bringmann, K., Kolev, P., Lee, E., and Woodruff, D. P. (2019) · 2019
Later among the works it cites.
Approximation schemes for low-rank binary matrix approximation problems
Fomin, F. V., Golovach, P. A., Lokshtanov, D., Panolan, F., and Saurabh, S. (2019) · 2019
Later among the works it cites.
Faster algorithms for binary matrix factorization
Kumar, R., Panigrahy, R., Rahimi, A., and Woodruff, D. P. (2019) · 2019
Later among the works it cites.
A review on dimensionality reduction for multi-label classification
Siblini, W., Kuntz, P., and Meyer, F. (2019) · 2019
Later among the works it cites.
Boolean matrix factorization meets consecutive ones property
Tatti, N. and Miettinen, P. (2019) · 2019
Later among the works it cites.
Analysis of spectral clustering algorithms for community detection: The general bipartite setting
Zhou, Z. and Amini, A. A. (2019) · 2019
Later among the works it cites.
Parameterized low-rank binary matrix approximation
Fomin, F. V., Golovach, P. A., and Panolan, F. (2020) · 2020
Closest in time.
BEM: Mining coregulation patterns in transcriptomics via Boolean matrix factorization
Liang, L., Zhu, K., and Lu, S. (2020) · 2020
Closest in time.
Recent developments in boolean matrix factorization
Miettinen, P. and Neumann, S. (2020) · 2020
Closest in time.
Biclustering and boolean matrix factorization in data streams
Neumann, S. and Miettinen, P. (2020) · 2020
Closest in time.