{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T20:44:27Z","timestamp":1743108267428,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030002015"},{"type":"electronic","value":"9783030002022"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-030-00202-2_14","type":"book-chapter","created":{"date-parts":[[2018,9,16]],"date-time":"2018-09-16T06:46:53Z","timestamp":1537080413000},"page":"169-181","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Basic Level Concepts as a Means to Better Interpretability of Boolean Matrix Factors and Their Application to Clustering"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4278-3130","authenticated-orcid":false,"given":"Petr","family":"Kraj\u010da","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7770-2033","authenticated-orcid":false,"given":"Martin","family":"Trnecka","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,9,16]]},"reference":[{"key":"14_CR1","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1007\/978-3-319-59271-8_4","volume-title":"Formal Concept Analysis","author":"S Andrews","year":"2017","unstructured":"Andrews, S.: Making use of empty intersections to improve the performance of CbO-type algorithms. In: Bertet, K., Borchmann, D., Cellier, P., Ferr\u00e9, S. (eds.) ICFCA 2017. LNCS (LNAI), vol. 10308, pp. 56\u201371. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-59271-8_4"},{"key":"14_CR2","doi-asserted-by":"crossref","unstructured":"Belohlavek, R., Outrata, J., Trnecka, M.: How to assess quality of BMF algorithms? In: Yager, R.R., Sgurev, V.S., Hadjiski, M., Jotsov, V.S. (eds.) Proceeding of International Conference on Intelligent Systems, IS 2016. pp. 227\u2013233 (2016)","DOI":"10.1109\/IS.2016.7737426"},{"key":"14_CR3","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1007\/978-3-642-29892-9_9","volume-title":"Formal Concept Analysis","author":"R Belohlavek","year":"2012","unstructured":"Belohlavek, R., Trnecka, M.: Basic Level of Concepts in Formal Concept Analysis. In: Domenach, F., Ignatov, D.I., Poelmans, J. (eds.) ICFCA 2012. LNCS (LNAI), vol. 7278, pp. 28\u201344. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29892-9_9"},{"key":"14_CR4","unstructured":"Belohlavek, R., Trnecka, M.: Basic level in formal concept analysis: Interesting concepts and psychological ramifications. In: Rossi, F. (ed.) Proceedings of the 23rd International Joint Conference on Artificial Intelligence, IJCAI 2013. pp. 1233\u20131239 (2013)"},{"issue":"8","key":"14_CR5","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)","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"14_CR6","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. Syst. Sci. 76(1), 3\u201320 (2010)","journal-title":"J. Comput. Syst. Sci."},{"key":"14_CR7","unstructured":"Dheeru, D., Karra Taniskidou, E.: UCI machine learning repository (2017), http:\/\/archive.ics.uci.edu\/ml"},{"key":"14_CR8","doi-asserted-by":"crossref","unstructured":"Farhadi, A., Endres, I., Hoiem, D., Forsyth, D.A.: Describing objects by their attributes. In: Proceedings of Conference on Computer Vision and Pattern Recognition (CVPR 2009). pp. 1778\u20131785 (2009)","DOI":"10.1109\/CVPR.2009.5206772"},{"key":"14_CR9","doi-asserted-by":"crossref","unstructured":"Ganter, B., Wille, R.: Formal concept analysis - mathematical foundations. Springer (1999)","DOI":"10.1007\/978-3-642-59830-2"},{"key":"14_CR10","unstructured":"Gottwald, S.: A Treatise on Many-Valued Logics, vol. 3. research studies press Baldock (2001)"},{"issue":"4","key":"14_CR11","doi-asserted-by":"crossref","first-page":"395","DOI":"10.3233\/FI-2012-661","volume":"115","author":"P Krajca","year":"2012","unstructured":"Krajca, P., Outrata, J., Vychodil, V.: Computing formal concepts by attribute sorting. Fundam. Inform. 115(4), 395\u2013417 (2012)","journal-title":"Fundam. Inform."},{"key":"14_CR12","unstructured":"Kraj\u010da, P.: Rank-aware clustering of relational data: Organizing search results. In: USB Proceedings The 13th International Conference on Modeling Decisions for Artificial Intelligence, pp. 61\u201372. (2016)"},{"key":"14_CR13","first-page":"165","volume":"2010","author":"C Lucchese","year":"2010","unstructured":"Lucchese, C., Orlando, S., Perego, R.: Mining top-$$k$$ patterns from binary datasets in presence of noise. Proceedings of the International Conference on Data Mining, SDM 2010, 165\u2013176 (2010)","journal-title":"Proceedings of the International Conference on Data Mining, SDM"},{"issue":"12","key":"14_CR14","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.: A unifying framework for mining approximate top-$$k$$ binary patterns. IEEE Trans. Knowl. Data Eng. 26(12), 2900\u20132913 (2014)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"14_CR15","unstructured":"Miettinen, P.: Matrix decomposition methods for data mining: Computational complexity and algorithms. Ph.D. thesis (2009)"},{"issue":"1","key":"14_CR16","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1016\/j.ins.2011.09.023","volume":"185","author":"J Outrata","year":"2012","unstructured":"Outrata, J., Vychodil, V.: Fast algorithm for computing fixpoints of galois connections induced by object-attribute relational data. Inf. Sci. 185(1), 114\u2013127 (2012)","journal-title":"Inf. Sci."}],"container-title":["Lecture Notes in Computer Science","Modeling Decisions for Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-00202-2_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T12:03:47Z","timestamp":1710331427000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-00202-2_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030002015","9783030002022"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-00202-2_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"16 September 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"MDAI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Modeling Decisions for Artificial Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Palma de Mallorce","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":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 October 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 October 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"mdai2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/mdai.cat\/mdai2018\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"by email","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"43","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"24","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"56% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.0","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Additional reviewers included in the preface. Average number of papers per reviewer in [2,3]","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}