{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,18]],"date-time":"2026-04-18T06:56:00Z","timestamp":1776495360272,"version":"3.51.2"},"reference-count":27,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100007059","name":"Palack\u00fd University Olomouc","doi-asserted-by":"publisher","award":["IGA_PrF_2025_018"],"award-info":[{"award-number":["IGA_PrF_2025_018"]}],"id":[{"id":"10.13039\/501100007059","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["International Journal of Approximate Reasoning"],"published-print":{"date-parts":[[2026,7]]},"DOI":"10.1016\/j.ijar.2026.109668","type":"journal-article","created":{"date-parts":[[2026,3,14]],"date-time":"2026-03-14T23:37:26Z","timestamp":1773531446000},"page":"109668","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Boolean matrix factorization in the framework of formal concept analysis with the help of biclustering"],"prefix":"10.1016","volume":"194","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7770-2033","authenticated-orcid":false,"given":"Martin","family":"Trnecka","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5442-0444","authenticated-orcid":false,"given":"Roman","family":"Vyjidacek","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/j.ijar.2026.109668_bib0001","series-title":"Discovery Science, 7th International Conference, DS 2004, Padova, Italy, October 2\u20135, 2004, Proceedings","first-page":"278","article-title":"Tiling databases","volume":"3245","author":"Geerts","year":"2004"},{"issue":"10","key":"10.1016\/j.ijar.2026.109668_bib0002","doi-asserted-by":"crossref","first-page":"1348","DOI":"10.1109\/TKDE.2008.53","article-title":"The discrete basis problem","volume":"20","author":"Miettinen","year":"2008","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"2","key":"10.1016\/j.ijar.2026.109668_bib0003","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1007\/s10618-010-0203-9","article-title":"Summarizing transactional databases with overlapped hyperrectangles","volume":"23","author":"Xiang","year":"2011","journal-title":"Data Min. Knowl. Discov."},{"key":"10.1016\/j.ijar.2026.109668_bib0004","series-title":"Proceedings of the 33nd International Conference on Machine Learning, ICML 2016, New York City, NY, USA, June 19\u201324, 2016","first-page":"945","article-title":"Boolean matrix factorization and noisy completion via message passing","volume":"48","author":"Ravanbakhsh","year":"2016"},{"issue":"4","key":"10.1016\/j.ijar.2026.109668_bib0005","doi-asserted-by":"crossref","first-page":"1090","DOI":"10.1007\/s10618-017-0508-z","article-title":"The PRIMPING routine \u2013 tiling through proximal alternating linearized minimization","volume":"31","author":"Hess","year":"2017","journal-title":"Data Min. Knowl. Discov."},{"issue":"12","key":"10.1016\/j.ijar.2026.109668_bib0006","doi-asserted-by":"crossref","first-page":"2900","DOI":"10.1109\/TKDE.2013.181","article-title":"A unifying framework for mining approximate top-k binary patterns","volume":"26","author":"Lucchese","year":"2014","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"10.1016\/j.ijar.2026.109668_bib0007","doi-asserted-by":"crossref","first-page":"941","DOI":"10.1007\/s13042-023-01949-9","article-title":"A top-k formal concepts-based algorithm for mining positive and negative correlation biclusters of DNA microarray data","volume":"15","author":"Houari","year":"2024","journal-title":"Int. J. Mach. Learn. Cybern."},{"key":"10.1016\/j.ijar.2026.109668_bib0008","series-title":"Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, IJCAI 2020","first-page":"4922","article-title":"Recent developments in Boolean matrix factorization","author":"Miettinen","year":"2020"},{"key":"10.1016\/j.ijar.2026.109668_bib0009","series-title":"Formal Concept Analysis: Mathematical Foundations","author":"Ganter","year":"1999"},{"issue":"1","key":"10.1016\/j.ijar.2026.109668_bib0010","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/j.jcss.2009.05.002","article-title":"Discovery of optimal factors in binary data via a novel method of matrix decomposition","volume":"76","author":"Belohlavek","year":"2010","journal-title":"J. Comput. Syst. Sci."},{"issue":"8","key":"10.1016\/j.ijar.2026.109668_bib0011","doi-asserted-by":"crossref","first-page":"1678","DOI":"10.1016\/j.jcss.2015.06.002","article-title":"From-below approximations in Boolean matrix factorization: geometry and new algorithm","volume":"81","author":"Belohlavek","year":"2015","journal-title":"J. Comput. Syst. Sci."},{"key":"10.1016\/j.ijar.2026.109668_bib0012","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/j.knosys.2018.05.035","article-title":"Data reduction for Boolean matrix factorization algorithms based on formal concept analysis","volume":"158","author":"Trnecka","year":"2018","journal-title":"Knowl. Based Syst."},{"key":"10.1016\/j.ijar.2026.109668_bib0013","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/s11634-019-00383-6","article-title":"From-below Boolean matrix factorization algorithm based on MDL","volume":"15","author":"Makhalova","year":"2021","journal-title":"Adv. Data Anal. Classif."},{"key":"10.1016\/j.ijar.2026.109668_bib0014","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1016\/j.ins.2016.03.009","article-title":"QualityCover: efficient binary relation coverage guided by induced knowledge quality","volume":"355\u2013356","author":"Mouakher","year":"2016","journal-title":"Inf. Sci."},{"key":"10.1016\/j.ijar.2026.109668_bib0015","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/j.ins.2018.05.016","article-title":"Toward quality assessment of Boolean matrix factorizations","volume":"459","author":"Belohlavek","year":"2018","journal-title":"Inf. Sci."},{"key":"10.1016\/j.ijar.2026.109668_bib0016","doi-asserted-by":"crossref","DOI":"10.1016\/j.ijar.2024.109247","article-title":"Semantic explorations in factorizing boolean data via formal concepts","volume":"173","author":"Belohlavek","year":"2024","journal-title":"Int. J. Approximate Reasoning"},{"key":"10.1016\/j.ijar.2026.109668_bib0017","series-title":"Proceedings of the 26th International Joint Conference on Artificial Intelligence (IJCAI-17)","first-page":"1433","article-title":"Handling noise in Boolean matrix factorization","author":"Belohlavek","year":"2017"},{"key":"10.1016\/j.ijar.2026.109668_bib0018","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1016\/j.dam.2017.12.044","article-title":"A new algorithm for Boolean matrix factorization which admits overcovering","volume":"249","author":"Belohlavek","year":"2018","journal-title":"Discrete Appl. Math."},{"issue":"337","key":"10.1016\/j.ijar.2026.109668_bib0019","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1080\/01621459.1972.10481214","article-title":"Direct clustering of a data matrix","volume":"67","author":"Hartigan","year":"1972","journal-title":"J. Am. Stat. Assoc."},{"key":"10.1016\/j.ijar.2026.109668_bib0020","series-title":"Mathematical Classification and Clustering","author":"Mirkin","year":"1996"},{"key":"10.1016\/j.ijar.2026.109668_bib0021","series-title":"Proceedings of the 12th IEEE International Conference on Data Mining Workshops (ICDMW 2012)","first-page":"123","article-title":"Concept-based biclustering for internet advertisement","author":"Ignatov","year":"2012"},{"key":"10.1016\/j.ijar.2026.109668_bib0022","series-title":"Recent Trends in Analysis of Images, Social Networks and Texts","first-page":"185","article-title":"Object-attribute biclustering for elimination of missing genotypes in ischemic stroke genome-wide data","author":"Ignatov","year":"2021"},{"key":"10.1016\/j.ijar.2026.109668_bib0023","series-title":"Recent Trends in Analysis of Images, Social Networks and Texts","first-page":"265","article-title":"Approximate density computation for OA-biclustering","author":"Ignatov","year":"2024"},{"key":"10.1016\/j.ijar.2026.109668_bib0024","doi-asserted-by":"crossref","DOI":"10.1016\/j.knosys.2022.108895","article-title":"Revisiting the GreCon algorithm for Boolean matrix factorization","volume":"249","author":"Trnecka","year":"2022","journal-title":"Knowl. Based Syst."},{"key":"10.1016\/j.ijar.2026.109668_bib0025","series-title":"Proceedings of the Workshop Formal Concept Analysis Meets Information Retrieval (FCAIR 2013)","first-page":"57","article-title":"An FCA-based Boolean matrix factorisation for collaborative filtering","volume":"977","author":"Nenova","year":"2013"},{"key":"10.1016\/j.ijar.2026.109668_bib0026","unstructured":"M. Kelly, R. Longjohn, K. Nottingham, The UCI machine learning repository, https:\/\/archive.ics.uci.edu."},{"key":"10.1016\/j.ijar.2026.109668_bib0027","series-title":"13th ACM Symposium on Access Control Models and Technologies (SACMAT 2008)","first-page":"1","article-title":"Fast exact and heuristic methods for role minimization problems","author":"Ene","year":"2008"}],"container-title":["International Journal of Approximate Reasoning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0888613X26000447?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0888613X26000447?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,4,18]],"date-time":"2026-04-18T06:33:54Z","timestamp":1776494034000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0888613X26000447"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7]]},"references-count":27,"alternative-id":["S0888613X26000447"],"URL":"https:\/\/doi.org\/10.1016\/j.ijar.2026.109668","relation":{},"ISSN":["0888-613X"],"issn-type":[{"value":"0888-613X","type":"print"}],"subject":[],"published":{"date-parts":[[2026,7]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Boolean matrix factorization in the framework of formal concept analysis with the help of biclustering","name":"articletitle","label":"Article Title"},{"value":"International Journal of Approximate Reasoning","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ijar.2026.109668","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier Inc. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"109668"}}