{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T06:50:26Z","timestamp":1759042226885,"version":"3.41.0"},"reference-count":41,"publisher":"Association for Computing Machinery (ACM)","issue":"6","license":[{"start":{"date-parts":[[2022,7,30]],"date-time":"2022-07-30T00:00:00Z","timestamp":1659139200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"LDRD program of Los Alamos National Laboratory","award":["20190020DR"],"award-info":[{"award-number":["20190020DR"]}]},{"name":"Center for Nonlinear Studies"},{"name":"Triad National Security, LLC"},{"name":"National Nuclear Security Administration of U.S. Department of Energy","award":["89233218CNA000001"],"award-info":[{"award-number":["89233218CNA000001"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Knowl. Discov. Data"],"published-print":{"date-parts":[[2022,12,31]]},"abstract":"<jats:p>\n            The application of binary matrices are numerous. Representing a matrix as a mixture of a small collection of latent vectors via low-rank decomposition is often seen as an advantageous method to interpret and analyze data. In this work, we examine the factorizations of binary matrices using standard arithmetic (real and nonnegative) and logical operations (Boolean and \u2124\n            <jats:sub>2<\/jats:sub>\n            ). We examine the relationships between the different ranks, and discuss when factorization is unique. In particular, we characterize when a Boolean factorization\n            <jats:italic>X = W \u2227 H<\/jats:italic>\n            has a unique\n            <jats:italic>W<\/jats:italic>\n            , a unique\n            <jats:italic>H<\/jats:italic>\n            (for a fixed\n            <jats:italic>W<\/jats:italic>\n            ), and when both\n            <jats:italic>W<\/jats:italic>\n            and\n            <jats:italic>H<\/jats:italic>\n            are unique, given a rank constraint. We introduce a method for robust Boolean model selection, called BMF\n            <jats:italic>k<\/jats:italic>\n            , and show on numerical examples that BMF\n            <jats:italic>k<\/jats:italic>\n            not only accurately determines the correct number of Boolean latent features but reconstruct the pre-determined factors accurately.\n          <\/jats:p>","DOI":"10.1145\/3522594","type":"journal-article","created":{"date-parts":[[2022,3,15]],"date-time":"2022-03-15T21:30:32Z","timestamp":1647379832000},"page":"1-24","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["Factorization of Binary Matrices: Rank Relations, Uniqueness and Model Selection of Boolean Decomposition"],"prefix":"10.1145","volume":"16","author":[{"given":"Derek","family":"Desantis","sequence":"first","affiliation":[{"name":"Theoretical Division - Center for Nonlinear Studies, Los Alamos National Laboratory, Los Alamos"}]},{"given":"Erik","family":"Skau","sequence":"additional","affiliation":[{"name":"CCS Division, Los Alamos National Laboratory, Los Alamos"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9806-3274","authenticated-orcid":false,"given":"Duc P.","family":"Truong","sequence":"additional","affiliation":[{"name":"CCS Division, Los Alamos National Laboratory, Los Alamos"}]},{"given":"Boian","family":"Alexandrov","sequence":"additional","affiliation":[{"name":"Theoretical Division, Los Alamos National Laboratory, Los Alamos"}]}],"member":"320","published-online":{"date-parts":[[2022,7,30]]},"reference":[{"doi-asserted-by":"publisher","key":"e_1_3_3_2_2","DOI":"10.1109\/TAC.1974.1100705"},{"doi-asserted-by":"publisher","key":"e_1_3_3_3_2","DOI":"10.1038\/nature12477"},{"doi-asserted-by":"publisher","key":"e_1_3_3_4_2","DOI":"10.1137\/17M1112303"},{"doi-asserted-by":"publisher","key":"e_1_3_3_5_2","DOI":"10.1016\/j.laa.2011.12.013"},{"key":"e_1_3_3_6_2","first-page":"382","article-title":"Bayesian pca","author":"Bishop Christopher M.","year":"1999","unstructured":"Christopher M. Bishop. 1999. Bayesian pca. Advances in Neural Information Processing Systems 11 (1999), 382\u2013388.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_3_7_2","volume-title":"Invertibly Positive Linear Operators on Spaces of Continuous Functions","author":"Brown Thomas Andrew","year":"1968","unstructured":"Thomas Andrew Brown, Mario Leon Juncosa, and V. L. Klee. 1968. Invertibly Positive Linear Operators on Spaces of Continuous Functions. Technical Report. RAND CORP SANTA MONICA CALIF."},{"doi-asserted-by":"publisher","key":"e_1_3_3_8_2","DOI":"10.1073\/pnas.0308531101"},{"doi-asserted-by":"publisher","key":"e_1_3_3_9_2","DOI":"10.1002\/9780470747278"},{"doi-asserted-by":"publisher","key":"e_1_3_3_10_2","DOI":"10.1016\/0024-3795(93)90224-C"},{"key":"e_1_3_3_11_2","first-page":"73","article-title":"Biclique covers and partitions of bipartite graphs and digraphs and related matrix ranks of  \\( \\lbrace \\) 0, 1 \\( \\rbrace \\) -matrices","author":"Doherty Faun C. C.","year":"1999","unstructured":"Faun C. C. Doherty, J. Richard Lundgren, and Daluss J. Siewert. 1999. Biclique covers and partitions of bipartite graphs and digraphs and related matrix ranks of \\( \\lbrace \\) 0, 1 \\( \\rbrace \\) -matrices. Congressus Numerantium (1999), 73\u201396.","journal-title":"Congressus Numerantium"},{"key":"e_1_3_3_12_2","first-page":"1913","volume-title":"Proceedings of the 2009 17th European Signal Processing Conference","author":"F\u00e9votte C\u00e9dric","year":"2009","unstructured":"C\u00e9dric F\u00e9votte and A. Taylan Cemgil. 2009. Nonnegative matrix factorizations as probabilistic inference in composite models. In Proceedings of the 2009 17th European Signal Processing Conference. IEEE, 1913\u20131917."},{"key":"e_1_3_3_13_2","volume-title":"Th\u00e9orie Des Syst\u00e8mes Lin\u00e9aires Dans Les Dio\u00efdes","author":"Gaubert St\u00e9phane","year":"1992","unstructured":"St\u00e9phane Gaubert. 1992. Th\u00e9orie Des Syst\u00e8mes Lin\u00e9aires Dans Les Dio\u00efdes. Ph.D. Dissertation. Paris, ENMP."},{"doi-asserted-by":"publisher","key":"e_1_3_3_14_2","DOI":"10.1007\/978-3-540-30214-8_22"},{"doi-asserted-by":"publisher","key":"e_1_3_3_15_2","DOI":"10.5555\/2503308.2503349"},{"doi-asserted-by":"publisher","key":"e_1_3_3_16_2","DOI":"10.5555\/1386688"},{"doi-asserted-by":"publisher","key":"e_1_3_3_17_2","DOI":"10.1016\/j.sigpro.2011.10.003"},{"doi-asserted-by":"publisher","key":"e_1_3_3_18_2","DOI":"10.1137\/1034115"},{"key":"e_1_3_3_19_2","article-title":"Algebra. 3rd","author":"Lang Serge","year":"1993","unstructured":"Serge Lang. 1993. Algebra. 3rd. Edition Addison\u2013Wesley (1993).","journal-title":"Edition Addison\u2013Wesley"},{"doi-asserted-by":"publisher","key":"e_1_3_3_20_2","DOI":"10.1155\/2008\/764206"},{"doi-asserted-by":"publisher","key":"e_1_3_3_21_2","DOI":"10.21236\/AD0724782"},{"doi-asserted-by":"publisher","key":"e_1_3_3_22_2","DOI":"10.1038\/44565"},{"doi-asserted-by":"publisher","key":"e_1_3_3_23_2","DOI":"10.1145\/1081870.1081894"},{"key":"e_1_3_3_24_2","volume-title":"Proceedings of the Technical Report in Preparation","author":"MacKay David J. C.","year":"1994","unstructured":"David J. C. MacKay and Radford M. Neal. 1994. Automatic relevance determination for neural networks. In Proceedings of the Technical Report in Preparation. Cambridge University."},{"doi-asserted-by":"publisher","key":"e_1_3_3_25_2","DOI":"10.1007\/s11634-019-00383-6"},{"key":"e_1_3_3_26_2","article-title":"Recent developments in boolean matrix factorization","author":"Miettinen Pauli","year":"2020","unstructured":"Pauli Miettinen and Stefan Neumann. 2020. Recent developments in boolean matrix factorization. arXiv:2012.03127. Retrieved from https:\/\/arxiv.org\/abs\/2012.03127.","journal-title":"arXiv:2012.03127"},{"doi-asserted-by":"publisher","key":"e_1_3_3_27_2","DOI":"10.1145\/2601437"},{"doi-asserted-by":"publisher","key":"e_1_3_3_28_2","DOI":"10.1016\/j.sigpro.2020.107809"},{"key":"e_1_3_3_29_2","first-page":"1923","volume-title":"Proceedings of the 2009 17th European Signal Processing Conference","author":"M\u00f8rup Morten","year":"2009","unstructured":"Morten M\u00f8rup and Lars Kai Hansen. 2009. Tuning pruning in sparse non-negative matrix factorization. In Proceedings of the 2009 17th European Signal Processing Conference. IEEE, 1923\u20131927."},{"issue":"2","key":"e_1_3_3_30_2","first-page":"025012","article-title":"A neural network for determination of latent dimensionality in non-negative matrix factorization","volume":"2","author":"Nebgen Benjamin T.","year":"2021","unstructured":"Benjamin T. Nebgen, Raviteja Vangara, Miguel A. Hombrados-Herrera, Svetlana Kuksova, and Boian S. Alexandrov. 2021. A neural network for determination of latent dimensionality in non-negative matrix factorization. Machine Learning: Science and Technology 2, 2 (2021), 025012.","journal-title":"Machine Learning: Science and Technology"},{"doi-asserted-by":"publisher","key":"e_1_3_3_31_2","DOI":"10.1016\/1385-7258(77)90055-5"},{"doi-asserted-by":"publisher","key":"e_1_3_3_32_2","DOI":"10.1016\/0021-8693(84)90070-X"},{"doi-asserted-by":"publisher","key":"e_1_3_3_33_2","DOI":"10.1016\/0005-1098(78)90005-5"},{"key":"e_1_3_3_34_2","volume-title":"Advanced Linear Algebra","author":"Roman Steven","year":"2005","unstructured":"Steven Roman, S. Axler, and F. W. Gehring. 2005. Advanced Linear Algebra. Springer."},{"key":"e_1_3_3_35_2","first-page":"461","article-title":"Estimating the dimension of a model","author":"Schwarz Gideon","year":"1978","unstructured":"Gideon Schwarz. 1978. Estimating the dimension of a model. The Annals of Statistics (1978), 461\u2013464.","journal-title":"The Annals of Statistics"},{"doi-asserted-by":"publisher","key":"e_1_3_3_36_2","DOI":"10.1137\/1035134"},{"doi-asserted-by":"publisher","key":"e_1_3_3_37_2","DOI":"10.1016\/0024-3795(81)90101-4"},{"doi-asserted-by":"publisher","key":"e_1_3_3_38_2","DOI":"10.1016\/j.knosys.2021.107184"},{"doi-asserted-by":"publisher","key":"e_1_3_3_39_2","DOI":"10.1109\/ACCESS.2021.3107189"},{"doi-asserted-by":"publisher","key":"e_1_3_3_40_2","DOI":"10.1109\/ACCESS.2021.3106879"},{"doi-asserted-by":"publisher","key":"e_1_3_3_41_2","DOI":"10.1109\/TIT.2011.2145090"},{"doi-asserted-by":"publisher","key":"e_1_3_3_42_2","DOI":"10.1109\/ICDM.2007.99"}],"container-title":["ACM Transactions on Knowledge Discovery from Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3522594","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3522594","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T18:09:33Z","timestamp":1750183773000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3522594"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,30]]},"references-count":41,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2022,12,31]]}},"alternative-id":["10.1145\/3522594"],"URL":"https:\/\/doi.org\/10.1145\/3522594","relation":{},"ISSN":["1556-4681","1556-472X"],"issn-type":[{"type":"print","value":"1556-4681"},{"type":"electronic","value":"1556-472X"}],"subject":[],"published":{"date-parts":[[2022,7,30]]},"assertion":[{"value":"2021-10-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2022-02-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2022-07-30","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}