{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T19:59:03Z","timestamp":1743019143965,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031678677"},{"type":"electronic","value":"9783031678684"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-67868-4_9","type":"book-chapter","created":{"date-parts":[[2024,8,1]],"date-time":"2024-08-01T21:03:07Z","timestamp":1722546187000},"page":"123-131","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["What Can FCA-Based Boolean Matrix Factorization Do for\u00a0Object-Attribute Biclustering?"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7770-2033","authenticated-orcid":false,"given":"Martin","family":"Trnecka","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5442-0444","authenticated-orcid":false,"given":"Roman","family":"Vyjidacek","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,8,1]]},"reference":[{"issue":"1","key":"9_CR1","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.: Discovery of optimal factors in binary data via a novel method of matrix decomposition. J. Comput. System Sci. 76(1), 3\u201320 (2010). https:\/\/doi.org\/10.1016\/j.jcss.2009.05.002","journal-title":"J. Comput. System Sci."},{"key":"9_CR2","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.: Formal Concept Analysis: Mathematical Foundations. Springer, Berlin (1999). https:\/\/doi.org\/10.1007\/978-3-642-59830-2"},{"key":"9_CR3","doi-asserted-by":"publisher","unstructured":"Ignatov, D., Kuznetsov, S., Poelmans, J.: Concept-based biclustering for internet advertisement. In: Proceedings of the 12th IEEE International Conference on Data Mining Workshops (ICDMW 2012), pp. 123\u2013130. IEEE (2012). https:\/\/doi.org\/10.1109\/ICDMW.2012.100","DOI":"10.1109\/ICDMW.2012.100"},{"key":"9_CR4","doi-asserted-by":"publisher","unstructured":"Ignatov, D.I., et al.: Object-attribute biclustering for elimination of missing genotypes in ischemic stroke genome-wide data. bioRxiv (2020). https:\/\/doi.org\/10.1101\/2020.10.22.349910","DOI":"10.1101\/2020.10.22.349910"},{"key":"9_CR5","doi-asserted-by":"publisher","unstructured":"Trnecka, M., Vyjidacek, R.: Revisiting the GreCon algorithm for Boolean matrix factorization. Knowl.-Based Syst. 249, 108895 (2022). https:\/\/doi.org\/10.1016\/j.knosys.2022.108895","DOI":"10.1016\/j.knosys.2022.108895"},{"issue":"8","key":"9_CR6","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.: From-below approximations in Boolean matrix factorization: geometry and new algorithm. J. Comput. Syst. Sci. 81(8), 1678\u20131697 (2015). https:\/\/doi.org\/10.1016\/j.jcss.2015.06.002","journal-title":"J. Comput. Syst. Sci."},{"key":"9_CR7","doi-asserted-by":"publisher","unstructured":"Belohlavek, R., Trnecka, M.: Handling noise in Boolean matrix factorization. Int. J. Approx. Reason. 96, 78\u201394 (2018). https:\/\/doi.org\/10.1016\/j.ijar.2018.03.006","DOI":"10.1016\/j.ijar.2018.03.006"},{"key":"9_CR8","unstructured":"Kelly, M., Longjohn, R., Nottingham, K.: The UCI Machine Learning Repository. https:\/\/archive.ics.uci.edu"},{"key":"9_CR9","doi-asserted-by":"publisher","unstructured":"Ene, A., et al.: 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), pp. 1\u201310 (2008). https:\/\/doi.org\/10.1145\/1377836.1377838","DOI":"10.1145\/1377836.1377838"},{"issue":"55","key":"9_CR10","doi-asserted-by":"publisher","first-page":"7324","DOI":"10.1038\/sj.onc.1209717","volume":"25","author":"S Myllykangas","year":"2006","unstructured":"Myllykangas, S., et al.: DNA copy number amplification profiling of human neoplasms. Oncogene 25(55), 7324\u20137332 (2006)","journal-title":"Oncogene"},{"issue":"12","key":"9_CR11","doi-asserted-by":"publisher","first-page":"2900","DOI":"10.1109\/TKDE.2013.2297915","volume":"26","author":"C Lucchese","year":"2014","unstructured":"Lucchese, C., Orlando, S., Perego, R.: A unifying framework for mining approximate top-k binary patterns. IEEE Trans. Knowl. Data Eng. 26(12), 2900\u20132913 (2014). https:\/\/doi.org\/10.1109\/TKDE.2013.2297915","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"9_CR12","doi-asserted-by":"publisher","unstructured":"Belohlavek, R., Trnecka, M.: A new algorithm for boolean matrix factorization which admits overcovering. discrete appl. Math. 249, 36\u201352 (2018). https:\/\/doi.org\/10.1016\/j.dam.2017.12.044","DOI":"10.1016\/j.dam.2017.12.044"},{"issue":"337","key":"9_CR13","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1080\/01621459.1972.10481214","volume":"67","author":"JA Hartigan","year":"1972","unstructured":"Hartigan, J.A.: Direct clustering of a data matrix. J. Am. Stat. Assoc. 67(337), 123\u2013129 (1972)","journal-title":"J. Am. Stat. Assoc."},{"key":"9_CR14","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-0457-9","volume-title":"Mathematical Classification and Clustering","author":"B Mirkin","year":"1996","unstructured":"Mirkin, B.: Mathematical Classification and Clustering. Kluwer, Dordrecht (1996)"},{"key":"9_CR15","doi-asserted-by":"publisher","unstructured":"Houari, A., Ben Yahia, S.: A Top-K formal concepts-based algorithm for mining positive and negative correlation biclusters of DNA microarray data. Int. J. Mach. Learn. Cybern. 15, 941\u2013962 (2024). https:\/\/doi.org\/10.1007\/s13042-023-01949-9","DOI":"10.1007\/s13042-023-01949-9"}],"container-title":["Lecture Notes in Computer Science","Conceptual Knowledge Structures"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-67868-4_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,11]],"date-time":"2024-08-11T23:03:32Z","timestamp":1723417412000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-67868-4_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031678677","9783031678684"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-67868-4_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"1 August 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CONCEPTS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Joint Conference on Conceptual Knowledge Structures","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"C\u00e1diz","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 September 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 September 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iccs-conceptstruct2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/concepts2024.uca.es","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}