{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:19:49Z","timestamp":1742912389923,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030742508"},{"type":"electronic","value":"9783030742515"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"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":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-74251-5_29","type":"book-chapter","created":{"date-parts":[[2021,4,12]],"date-time":"2021-04-12T15:20:40Z","timestamp":1618240840000},"page":"365-375","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Reducing Negative Impact of Noise in\u00a0Boolean Matrix Factorization with Association Rules"],"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":[[2021,4,13]]},"reference":[{"key":"29_CR1","unstructured":"UCI Machine Learning Repository (2020). http:\/\/archive.ics.uci.edu\/ml"},{"key":"29_CR2","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Imielinski, T., Swami, A.N.: Mining association rules between sets of items in large databases. In: Buneman, P., Jajodia, S. (eds.) Proceedings of ACM SIGMOD. ACM Press (1993)","DOI":"10.1145\/170035.170072"},{"key":"29_CR3","doi-asserted-by":"publisher","first-page":"633","DOI":"10.1016\/j.ins.2014.10.011","volume":"295","author":"S Andrews","year":"2015","unstructured":"Andrews, S.: A \u2018best-of-breed\u2019 approach for designing a fast algorithm for computing fixpoints of Galois connections. Inf. Sci. 295, 633\u2013649 (2015)","journal-title":"Inf. Sci."},{"issue":"8","key":"29_CR4","doi-asserted-by":"publisher","first-page":"1678","DOI":"10.1016\/j.jcss.2015.06.002","volume":"81","author":"R Belohl\u00e1vek","year":"2015","unstructured":"Belohl\u00e1vek, 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."},{"key":"29_CR5","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1016\/j.ijar.2018.03.006","volume":"96","author":"R Belohl\u00e1vek","year":"2018","unstructured":"Belohl\u00e1vek, R., Trnecka, M.: Handling noise in Boolean matrix factorization. Int. J. Approx. Reason. 96, 78\u201394 (2018)","journal-title":"Int. J. Approx. Reason."},{"issue":"1","key":"29_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":"29_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.: Formal Concept Analysis - Mathematical Foundations. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/978-3-642-59830-2"},{"key":"29_CR8","doi-asserted-by":"crossref","unstructured":"Gupta, R., Fang, G., Field, B., Steinbach, M.S., Kumar, V.: Quantitative evaluation of approximate frequent pattern mining algorithms. In: Li, Y., Liu, B., Sarawagi, S. (eds.) Proceedings of ACM SIGKDD (2008)","DOI":"10.1145\/1401890.1401930"},{"issue":"12","key":"29_CR9","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":"29_CR10","doi-asserted-by":"crossref","unstructured":"Makhalova, T., Trnecka, M.: From-below Boolean matrix factorization algorithm based on mdl. Adv. Data Anal. Classif. 1\u201320 (2020)","DOI":"10.1007\/s11634-019-00383-6"},{"issue":"10","key":"29_CR11","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.: The discrete basis problem. IEEE Trans. Knowl. Data Eng. 20(10), 1348\u20131362 (2008)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"55","key":"29_CR12","doi-asserted-by":"publisher","first-page":"7324","DOI":"10.1038\/sj.onc.1209717","volume":"25","author":"S Myllykangas","year":"2006","unstructured":"Myllykangas, S., Himberg, J., B\u00f6hling, T., Nagy, B., Hollm\u00e9n, J., Knuutila, S.: DNA copy number amplification profiling of human neoplasms. Oncogene 25(55), 7324\u20137332 (2006)","journal-title":"Oncogene"},{"issue":"1","key":"29_CR13","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."},{"key":"29_CR14","series-title":"Studies in Computational Intelligence","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-11737-4","volume-title":"Observational Calculi and Association Rules","author":"J Rauch","year":"2013","unstructured":"Rauch, J.: Observational Calculi and Association Rules. Studies in Computational Intelligence, vol. 469. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-11737-4"},{"key":"29_CR15","unstructured":"Trnecka, M., Vyjidacek, R.: Revisiting the Grecon algorithm for Boolean matrix factorization. In: Valverde-Albacete, F.J., Trnecka, M. (eds.) Proceedings of the Fifthteenth International Conference on Concept Lattices and Their Applications, Tallinn, Estonia, June 29-July 1, 2020. CEUR Workshop Proceedings, vol. 2668, pp. 59\u201370. CEUR-WS.org (2020). http:\/\/ceur-ws.org\/Vol-2668\/paper4.pdf"},{"issue":"2","key":"29_CR16","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, F.F.: Summarizing transactional databases with overlapped hyperrectangles. Data Min. Knowl. Discov. 23(2), 215\u2013251 (2011)","journal-title":"Data Min. Knowl. Discov."},{"issue":"3","key":"29_CR17","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1023\/B:DAMI.0000040429.96086.c7","volume":"9","author":"MJ Zaki","year":"2004","unstructured":"Zaki, M.J.: Mining non-redundant association rules. Data Min. Knowl. Discov. 9(3), 223\u2013248 (2004)","journal-title":"Data Min. Knowl. Discov."}],"container-title":["Lecture Notes in Computer Science","Advances in Intelligent Data Analysis XIX"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-74251-5_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,25]],"date-time":"2021-04-25T00:36:09Z","timestamp":1619310969000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-74251-5_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030742508","9783030742515"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-74251-5_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"13 April 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IDA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Intelligent Data Analysis","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Porto","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Portugal","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 April 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 April 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ida2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ida2021.org\/","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":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"113","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":"35","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":"31% - 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":"3","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":"4","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The conference was held online due to the COVID-19 pandemic","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)"}}]}}