{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,15]],"date-time":"2026-03-15T10:50:45Z","timestamp":1773571845118,"version":"3.50.1"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T00:00:00Z","timestamp":1578441600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T00:00:00Z","timestamp":1578441600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Adv Data Anal Classif"],"published-print":{"date-parts":[[2021,3]]},"DOI":"10.1007\/s11634-019-00383-6","type":"journal-article","created":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T15:22:41Z","timestamp":1578496961000},"page":"37-56","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["From-below Boolean matrix factorization algorithm based on MDL"],"prefix":"10.1007","volume":"15","author":[{"given":"Tatiana","family":"Makhalova","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7770-2033","authenticated-orcid":false,"given":"Martin","family":"Trnecka","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,1,8]]},"reference":[{"issue":"8","key":"383_CR1","doi-asserted-by":"publisher","first-page":"1678","DOI":"10.1016\/j.jcss.2015.06.002","volume":"81","author":"R Belohlavek","year":"2015","unstructured":"Belohlavek R, Trnecka M (2015) From-below approximations in Boolean matrix factorization: geometry and new algorithm. J Comput Syst Sci 81(8):1678\u20131697","journal-title":"J Comput Syst Sci"},{"issue":"1","key":"383_CR2","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.jcss.2009.05.002","volume":"76","author":"R Belohlavek","year":"2010","unstructured":"Belohlavek R, Vychodil V (2010) Discovery of optimal factors in binary data via a novel method of matrix decomposition. J Comput Syst Sci 76(1):3\u201320","journal-title":"J Comput Syst Sci"},{"issue":"1\u20132","key":"383_CR3","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/s10472-013-9370-x","volume":"70","author":"R Belohlavek","year":"2014","unstructured":"Belohlavek R, Grissa D, Guillaume S, Nguifo EM, Outrata J (2014) Boolean factors as a means of clustering of interestingness measures of association rules. Ann Math Artif Intell 70(1\u20132):151\u2013184","journal-title":"Ann Math Artif Intell"},{"key":"383_CR4","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/j.ins.2018.05.016","volume":"459","author":"R Belohlavek","year":"2018","unstructured":"Belohlavek R, Outrata J, Trnecka M (2018) Toward quality assessment of Boolean matrix factorizations. Inf Sci 459:71\u201385","journal-title":"Inf Sci"},{"issue":"3","key":"383_CR5","first-page":"120","volume":"156","author":"V Brault","year":"2015","unstructured":"Brault V, Mariadassou M (2015) Co-clustering through latent bloc model: a review. Journal de la Soci\u00e9t\u00e9 Fran\u00e7aise de Statistique 156(3):120\u2013139","journal-title":"Journal de la Soci\u00e9t\u00e9 Fran\u00e7aise de Statistique"},{"key":"383_CR6","doi-asserted-by":"crossref","unstructured":"Ene A, Horne WG, Milosavljevic N, Rao P, Schreiber R, Tarjan RE (2008) Fast exact and heuristic methods for role minimization problems. In: Ray I, Li N (eds) 13th ACM symposium on access control models and technologies, SACMAT 2008, Estes Park, CO, USA, June 11\u201313, 2008, Proceedings. ACM, pp 1\u201310","DOI":"10.1145\/1377836.1377838"},{"key":"383_CR7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-59830-2","volume-title":"Formal concept analysis mathematical foundations","author":"B Ganter","year":"1999","unstructured":"Ganter B, Wille R (1999) Formal concept analysis mathematical foundations. Springer, Berlin"},{"key":"383_CR8","doi-asserted-by":"crossref","unstructured":"Geerts F, Goethals B, Mielik\u00e4inen T (2004) Tiling databases. In: Suzuki E, Arikawa S (eds) Discovery science, 7th international conference, DS 2004, Padova, Italy, October 2\u20135, 2004, Proceedings, volume 3245 of Lecture Notes in Computer Science. Springer, pp 278\u2013289","DOI":"10.1007\/978-3-540-30214-8_22"},{"issue":"6","key":"383_CR9","doi-asserted-by":"publisher","first-page":"3233","DOI":"10.1016\/j.csda.2007.09.007","volume":"52","author":"G Govaert","year":"2008","unstructured":"Govaert G, Nadif M (2008) Block clustering with Bernoulli mixture models: comparison of different approaches. Comput Stat Data Anal 52(6):3233\u20133245","journal-title":"Comput Stat Data Anal"},{"key":"383_CR10","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/4643.001.0001","volume-title":"The minimum description length principle (adaptive computation and machine learning)","author":"PD Gr\u00fcnwald","year":"2007","unstructured":"Gr\u00fcnwald PD (2007) The minimum description length principle (adaptive computation and machine learning). The MIT Press, Cambridge"},{"key":"383_CR11","doi-asserted-by":"crossref","unstructured":"Hashemi S, Tann H, Reda S (2019) Approximate logic synthesis using Boolean matrix factorization. In: Reda S, Shafique M (eds) Approximate circuits. Springer, pp 141\u2013154","DOI":"10.1007\/978-3-319-99322-5_7"},{"key":"383_CR12","doi-asserted-by":"crossref","unstructured":"Ignatov DI, Nenova E, Konstantinova N, Konstantinov AV (2014) Boolean matrix factorisation for collaborative filtering: an FCA-based approach. In: Agre G, Hitzler P, Krisnadhi AA, Kuznetsov SO (eds) Artificial intelligence: methodology, systems, and applications\u201416th international conference, AIMSA 2014, Varna, Bulgaria, September 11\u201313, 2014. Proceedings, volume 8722 of Lecture Notes in Computer Science. Springer, pp 47\u201358","DOI":"10.1007\/978-3-319-10554-3_5"},{"key":"383_CR13","unstructured":"Iovleff S, Singh\u00a0Bhatia P, Demont J, Brault V, Kubicki V, Govaert G, Biernacki C, Celeux G (2019) Blockcluster: co-clustering package for binary, categorical, contingency and continuous data-sets. https:\/\/CRAN.R-project.org\/package=blockcluster. Accessed 26 Mar 2019"},{"key":"383_CR14","volume-title":"Boolean matrix theory and applications","author":"KH Kim","year":"1982","unstructured":"Kim KH (1982) Boolean matrix theory and applications. Dekker, New York"},{"key":"383_CR15","doi-asserted-by":"crossref","unstructured":"Kocayusufoglu F, Hoang MX, Singh AK (2018) Summarizing network processes with network-constrained Boolean matrix factorization. In: 2018 IEEE international conference on data mining (ICDM). IEEE, pp 237\u2013246","DOI":"10.1109\/ICDM.2018.00039"},{"key":"383_CR16","unstructured":"Lichman M (2013) UCI machine learning repository"},{"issue":"12","key":"383_CR17","doi-asserted-by":"publisher","first-page":"2900","DOI":"10.1109\/TKDE.2013.181","volume":"26","author":"C Lucchese","year":"2014","unstructured":"Lucchese C, Orlando S, Perego R (2014) A unifying framework for mining approximate top-k binary patterns. IEEE Trans Knowl Data Eng 26(12):2900\u20132913","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"383_CR18","doi-asserted-by":"crossref","unstructured":"Lucchese C, Orlando S, Perego R (2010) Mining top-k patterns from binary datasets in presence of noise. In: Proceedings of the SIAM international conference on data mining, SDM 2010, 29 April\u2013May 1, 2010, Columbus, Ohio, USA. SIAM, pp 165\u2013176","DOI":"10.1137\/1.9781611972801.15"},{"key":"383_CR19","unstructured":"Makhalova TP, Kuznetsov SO, Napoli A (2018) A first study on what MDL can do for FCA. In: Ignatov DI, Nourine L (eds) Proceedings of the fourteenth international conference on concept lattices and their applications, CLA 2018, Olomouc, Czech Republic, June 12-14, 2018, volume 2123 of CEUR Workshop Proceedings, pp 25\u201336. CEUR-WS.org"},{"issue":"4","key":"383_CR20","first-page":"18","volume":"8","author":"P Miettinen","year":"2014","unstructured":"Miettinen P, Vreeken J (2014) MDL4BMF: minimum description length for Boolean matrix factorization. ACM Trans Knowl Discov Data (TKDD) 8(4):18","journal-title":"ACM Trans Knowl Discov Data (TKDD)"},{"issue":"10","key":"383_CR21","doi-asserted-by":"publisher","first-page":"1348","DOI":"10.1109\/TKDE.2008.53","volume":"20","author":"P Miettinen","year":"2008","unstructured":"Miettinen P, Mielik\u00e4inen T, Gionis A, Das G, Mannila H (2008) The discrete basis problem. IEEE Trans Knowl Data Eng 20(10):1348\u20131362","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"383_CR22","doi-asserted-by":"crossref","unstructured":"Miettinen P, Vreeken J (2011) Model order selection for Boolean matrix factorization. In: Apt\u00e9 C, Ghosh J, Smyth P (eds) Proceedings of the 17th ACM SIGKDD international conference on knowledge discovery and data mining, San Diego, CA, USA, August 21\u201324, 2011. ACM, pp 51\u201359","DOI":"10.1145\/2020408.2020424"},{"key":"383_CR23","first-page":"17","volume":"14","author":"SD Monson","year":"1995","unstructured":"Monson SD, Pullman S, Rees R (1995) A survey of clique and biclique coverings and factorizations of (0,1)-matrices. Bull ICA 14:17\u201386","journal-title":"Bull ICA"},{"issue":"3\u20134","key":"383_CR24","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1016\/0025-5564(78)90088-3","volume":"40","author":"DS Nau","year":"1978","unstructured":"Nau DS, Markowsky G, Woodbury MA, Amos DB (1978) A mathematical analysis of human leukocyte antigen serology. Math Biosci 40(3\u20134):243\u2013270","journal-title":"Math Biosci"},{"key":"383_CR25","unstructured":"Stockmeyer LJ (1975) The set basis problem is NP-complete. Research reports. IBM Thomas J, Watson Research Division"},{"key":"383_CR26","unstructured":"Tatti N, Mielik\u00e4inen T, Gionis A, Mannila H (2006) What is the dimension of your binary data? In: Proceedings of the 6th IEEE international conference on data mining (ICDM 2006), 18\u201322 December 2006, Hong Kong, China. IEEE Computer Society, pp 603\u2013612"},{"issue":"2","key":"383_CR27","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/s10618-010-0203-9","volume":"23","author":"Y Xiang","year":"2011","unstructured":"Xiang Y, Jin R, Fuhry D, Dragan FF (2011) Summarizing transactional databases with overlapped hyperrectangles. Data Min Knowl Discov 23(2):215\u2013251","journal-title":"Data Min Knowl Discov"}],"container-title":["Advances in Data Analysis and Classification"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11634-019-00383-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11634-019-00383-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11634-019-00383-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,10]],"date-time":"2021-04-10T06:23:57Z","timestamp":1618035837000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11634-019-00383-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,1,8]]},"references-count":27,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,3]]}},"alternative-id":["383"],"URL":"https:\/\/doi.org\/10.1007\/s11634-019-00383-6","relation":{},"ISSN":["1862-5347","1862-5355"],"issn-type":[{"value":"1862-5347","type":"print"},{"value":"1862-5355","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,1,8]]},"assertion":[{"value":"17 September 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 November 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 December 2019","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 January 2020","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}