{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T20:21:17Z","timestamp":1740169277703,"version":"3.37.3"},"reference-count":44,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/100008902","name":"Los Alamos National Laboratory (LANL) by U.S. Department of Energy National Nuclear Security Administration","doi-asserted-by":"publisher","award":["DE-AC52-06NA25396"],"award-info":[{"award-number":["DE-AC52-06NA25396"]}],"id":[{"id":"10.13039\/100008902","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100008902","name":"LANL Laboratory Directed Research and Development","doi-asserted-by":"publisher","award":["20190020DR"],"award-info":[{"award-number":["20190020DR"]}],"id":[{"id":"10.13039\/100008902","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Center for Non-linear Studies"},{"DOI":"10.13039\/100008902","name":"LANL Institutional Computing Program by U.S. Department of Energy National Nuclear Security Administration","doi-asserted-by":"publisher","award":["89233218CNA000001"],"award-info":[{"award-number":["89233218CNA000001"]}],"id":[{"id":"10.13039\/100008902","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2021]]},"DOI":"10.1109\/access.2021.3107189","type":"journal-article","created":{"date-parts":[[2021,8,24]],"date-time":"2021-08-24T20:13:43Z","timestamp":1629836023000},"page":"117169-117177","source":"Crossref","is-referenced-by-count":4,"title":["Boolean Matrix Factorization via Nonnegative Auxiliary Optimization"],"prefix":"10.1109","volume":"9","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9806-3274","authenticated-orcid":false,"given":"Duc P.","family":"Truong","sequence":"first","affiliation":[{"name":"Los Alamos National Laboratory, Computer, Computational and Statistics Division, Los Alamos, NM, USA"}]},{"given":"Erik","family":"Skau","sequence":"additional","affiliation":[{"name":"Los Alamos National Laboratory, Computer, Computational and Statistics Division, Los Alamos, NM, USA"}]},{"given":"Derek","family":"Desantis","sequence":"additional","affiliation":[{"name":"Los Alamos National Laboratory, Theoretical Division, Los Alamos, NM, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8636-4603","authenticated-orcid":false,"given":"Boian","family":"Alexandrov","sequence":"additional","affiliation":[{"name":"Los Alamos National Laboratory, Theoretical Division, Los Alamos, NM, USA"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1145\/3365653"},{"key":"ref38","first-page":"747","article-title":"A ptas for lp-low rank approximation","author":"ban","year":"2019","journal-title":"Proc 13th Annu ACM-SIAM Symp Discrete Algorithms"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1007\/BF02294316"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1016\/j.sigpro.2020.107809"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2007.99"},{"key":"ref30","first-page":"1","article-title":"Optimal bipartite network clustering","volume":"21","author":"zhou","year":"2020","journal-title":"J Mach Learn Res"},{"key":"ref37","first-page":"4413","article-title":"Probabilistic Boolean tensor decomposition","author":"rukat","year":"2018","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2013.141"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/s11083-012-9254-4"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2011.28"},{"journal-title":"The Set Basis Problem is NP-Complete","year":"1975","author":"stockmeyer","key":"ref10"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-019-00669-5"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/1385-7258(77)90055-5"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2009.05.002"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2015.06.002"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2017.12.044"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972801.15"},{"key":"ref16","article-title":"Bayesian Boolean matrix factorisation","author":"rukat","year":"2017","journal-title":"arXiv 1702 06166"},{"key":"ref17","first-page":"945","article-title":"Boolean matrix factorization and noisy completion via message passing","volume":"69","author":"ravanbakhsh","year":"2016","journal-title":"Proc ICML"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2012.02.055"},{"key":"ref19","article-title":"Noisy and incomplete Boolean matrix factorizationvia expectation maximization","author":"liang","year":"2019","journal-title":"arXiv 1905 12766"},{"key":"ref28","first-page":"3867","article-title":"Bipartite stochastic block models with tiny clusters","volume":"31","author":"neumann","year":"2018","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1038\/44565"},{"key":"ref27","article-title":"Improved clustering algorithms for the bipartite stochastic block model","author":"ndaoud","year":"2019","journal-title":"arXiv 1911 07987"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1137\/1035134"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/1401890.1401969"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/2591971.2592005"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-63823-8_40"},{"key":"ref8","first-page":"17","article-title":"A survey of clique and biclique coverings and factorizations of (0, 1)-matrices","volume":"14","author":"monson","year":"1995","journal-title":"Bull Inst Combin Appl"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2008.53"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.2307\/1412107"},{"key":"ref9","article-title":"Factorizations of binary matrices—Rank relations and the uniqueness of Boolean decompositions","author":"desantis","year":"2020","journal-title":"arXiv 2012 10496"},{"journal-title":"An Introduction to Latent Variable Models","year":"2013","author":"everett","key":"ref1"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btz977"},{"key":"ref22","article-title":"Biclustering and Boolean matrix factorization in data streams","author":"neumann","year":"2020","journal-title":"arXiv 2012 03138"},{"key":"ref21","first-page":"1","article-title":"On the parameterized complexity of biclique cover and partition","author":"chandran","year":"2017","journal-title":"Proc 11th Int Symp Parameterized Exact Comput (IPEC)"},{"key":"ref42","first-page":"556","article-title":"Algorithms for non-negative matrix factorization","author":"lee","year":"2001","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref24","first-page":"1679","article-title":"A convex optimization framework for bi-clustering","author":"lim","year":"2015","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972825.82"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.2172\/816202"},{"journal-title":"UCI Machine Learning Repository","year":"2017","author":"dua","key":"ref44"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/502512.502550"},{"key":"ref43","article-title":"When does non-negative matrix factorization give a correct decomposition into parts?","volume":"16","author":"donoho","year":"2003","journal-title":"Proc Adv Neural Inf Process"},{"key":"ref25","first-page":"3551","article-title":"Faster algorithms for binary matrix factorization","author":"kumar","year":"2019","journal-title":"Proc Int Conf Mach Learn"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/6287639\/9312710\/9521203-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/9312710\/09521203.pdf?arnumber=9521203","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,8]],"date-time":"2022-09-08T20:20:28Z","timestamp":1662668428000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9521203\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"references-count":44,"URL":"https:\/\/doi.org\/10.1109\/access.2021.3107189","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2021]]}}}