{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T22:22:35Z","timestamp":1773872555520,"version":"3.50.1"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031434112","type":"print"},{"value":"9783031434129","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-43412-9_44","type":"book-chapter","created":{"date-parts":[[2023,9,16]],"date-time":"2023-09-16T20:28:38Z","timestamp":1694896118000},"page":"743-758","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Visualizing Overlapping Biclusterings and\u00a0Boolean Matrix Factorizations"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4090-7283","authenticated-orcid":false,"given":"Thibault","family":"Marette","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2271-316X","authenticated-orcid":false,"given":"Pauli","family":"Miettinen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3981-1500","authenticated-orcid":false,"given":"Stefan","family":"Neumann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,9,17]]},"reference":[{"key":"44_CR1","unstructured":"Alistarh, D., Iglesias, J., Vojnovic, M.: Streaming min-max hypergraph partitioning. In: NeurIPS, pp. 1900\u20131908 (2015)"},{"key":"44_CR2","doi-asserted-by":"crossref","unstructured":"Behrisch, M., Bach, B., Henry Riche, N., Schreck, T., Fekete, J.D.: Matrix reordering methods for table and network visualization. Comput. Graph. Forum. 35, 693\u2013716 (2016)","DOI":"10.1111\/cgf.12935"},{"key":"44_CR3","unstructured":"Brewer, C.A., Harrower, M., Sheesley, B., Woodruff, A., Heyman, D.: ColorBrewer 2.0: color advice for cartography. The Pennsylvania State University (2009). http:\/\/colorbrewer2.org\/. Accessed 6 Feb 2010"},{"issue":"6","key":"44_CR4","doi-asserted-by":"publisher","first-page":"1120","DOI":"10.1109\/TKDE.2011.37","volume":"24","author":"A Colantonio","year":"2011","unstructured":"Colantonio, A., Di Pietro, R., Ocello, A., Verde, N.V.: Visual role mining: a picture is worth a thousand roles. IEEE Trans. Knowl. Data Eng. 24(6), 1120\u20131133 (2011)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"44_CR5","doi-asserted-by":"crossref","unstructured":"Dhillon, I.S.: Co-clustering documents and words using bipartite spectral graph partitioning. Data Min. Knowl. Discov., 269\u2013274 (2001)","DOI":"10.1145\/502512.502550"},{"issue":"1\u20133","key":"44_CR6","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1080\/09296179708590082","volume":"4","author":"S Embleton","year":"1997","unstructured":"Embleton, S., Wheeler, E.S.: Finnish dialect atlas for quantitative studies. J. Quant. Linguist. 4(1\u20133), 99\u2013102 (1997)","journal-title":"J. Quant. Linguist."},{"issue":"3","key":"44_CR7","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1076\/jqul.7.3.227.4109","volume":"7","author":"SM Embleton","year":"2000","unstructured":"Embleton, S.M., Wheeler, E.S.: Computerized dialect atlas of Finnish: dealing with ambiguity. J. Quant. Linguist. 7(3), 227\u2013231 (2000)","journal-title":"J. Quant. Linguist."},{"key":"44_CR8","unstructured":"Fortelius, M.: New and old worlds database of fossil mammals (NOW) (2003). www.helsinki.fi\/science\/now\/"},{"issue":"1","key":"44_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/1748-7188-1-15","volume":"1","author":"GA Grothaus","year":"2006","unstructured":"Grothaus, G.A., Mufti, A., Murali, T.: Automatic layout and visualization of biclusters. Algorithms Mol. Biol. 1(1), 1\u201311 (2006)","journal-title":"Algorithms Mol. Biol."},{"issue":"337","key":"44_CR10","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."},{"issue":"4","key":"44_CR11","doi-asserted-by":"publisher","first-page":"1090","DOI":"10.1007\/s10618-017-0508-z","volume":"31","author":"S Hess","year":"2017","unstructured":"Hess, S., Morik, K., Piatkowski, N.: The PRIMPING routine - tiling through proximal alternating linearized minimization. Data Min. Knowl. Discov. 31(4), 1090\u20131131 (2017)","journal-title":"Data Min. Knowl. Discov."},{"key":"44_CR12","doi-asserted-by":"crossref","unstructured":"Hess, S., Pio, G., Hochstenbach, M., Ceci, M.: BROCCOLI: overlapping and outlier-robust biclustering through proximal stochastic gradient descent. Data Min. Knowl. Discov., 1\u201335 (2021)","DOI":"10.1007\/s10618-021-00787-z"},{"key":"44_CR13","doi-asserted-by":"crossref","unstructured":"Jin, R., Xiang, Y., Fuhry, D., Dragan, F.F.: Overlapping matrix pattern visualization: a hypergraph approach. In: IEEE International Conference on Data Mining, pp. 313\u2013322 (2008)","DOI":"10.1109\/ICDM.2008.102"},{"key":"44_CR14","doi-asserted-by":"crossref","unstructured":"Lucchese, C., Orlando, S., Perego, R.: Mining top-k patterns from binary datasets in presence of noise. In: SIAM International Conference on Data Mining, pp. 165\u2013176 (2010)","DOI":"10.1137\/1.9781611972801.15"},{"issue":"1","key":"44_CR15","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1109\/TCBB.2004.2","volume":"1","author":"S Madeira","year":"2004","unstructured":"Madeira, S., Oliveira, A.: Biclustering algorithms for biological data analysis: a survey. IEEE\/ACM Trans. Comput. Biol. Bioinform. 1(1), 24\u201345 (2004)","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinform."},{"issue":"10","key":"44_CR16","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."},{"key":"44_CR17","doi-asserted-by":"crossref","unstructured":"Miettinen, P., Neumann, S.: Recent developments in Boolean matrix factorization. In: International Joint Conference on Artificial Intelligence (2020)","DOI":"10.24963\/ijcai.2020\/685"},{"key":"44_CR18","unstructured":"Misue, K.: Drawing bipartite graphs as anchored maps. In: IEEE Pacific Visualisation, CRPIT, vol. 60, pp. 169\u2013177 (2006)"},{"key":"44_CR19","doi-asserted-by":"crossref","unstructured":"Molloy, I., Li, N., Li, T., Mao, Z., Wang, Q., Lobo, J.: Evaluating role mining algorithms. In: Proceedings ACM Symposium Access Control Models and Technologies, pp. 95\u2013104 (2009)","DOI":"10.1145\/1542207.1542224"},{"key":"44_CR20","unstructured":"Neumann, S.: Bipartite stochastic block models with tiny clusters. In: Neural Information Processing Systems, pp. 3871\u20133881 (2018)"},{"key":"44_CR21","first-page":"2825","volume":"12","author":"F Pedregosa","year":"2011","unstructured":"Pedregosa, F., et al.: Scikit-learn: machine learning in Python. J. Mach. Learn. Res. 12, 2825\u20132830 (2011)","journal-title":"J. Mach. Learn. Res."},{"key":"44_CR22","unstructured":"Perron, L., Furnon, V.: Or-tools. https:\/\/developers.google.com\/optimization\/"},{"issue":"3","key":"44_CR23","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1111\/cgf.13441","volume":"37","author":"N Pezzotti","year":"2018","unstructured":"Pezzotti, N., Fekete, J., H\u00f6llt, T., Lelieveldt, B.P.F., Eisemann, E., Vilanova, A.: Multiscale visualization and exploration of large bipartite graphs. Comput. Graph. Forum 37(3), 549\u2013560 (2018)","journal-title":"Comput. Graph. Forum"},{"key":"44_CR24","unstructured":"Rennie, J.: 20 newsgroups. http:\/\/qwone.com\/~jason\/20Newsgroups\/"},{"key":"44_CR25","doi-asserted-by":"crossref","unstructured":"Sakai, R., Winand, R., Verbeiren, T., Vande Moere, A., Aerts, J.: Dendsort: modular leaf ordering methods for dendrogram representations in R. F1000Research 3, 177 (2014)","DOI":"10.12688\/f1000research.4784.1"},{"issue":"10","key":"44_CR26","doi-asserted-by":"publisher","first-page":"2983","DOI":"10.1109\/TVCG.2018.2861397","volume":"25","author":"M Sun","year":"2019","unstructured":"Sun, M., Zhao, J., Wu, H., Luther, K., North, C., Ramakrishnan, N.: The effect of edge bundling and seriation on sensemaking of biclusters in bipartite graphs. IEEE Trans. Vis. Comput. Graph. 25(10), 2983\u20132998 (2019)","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"key":"44_CR27","doi-asserted-by":"crossref","unstructured":"Tatti, N., Miettinen, P.: Boolean matrix factorization meets consecutive ones property. In: SIAM International Conference on Data Mining, pp. 729\u2013737 (2019)","DOI":"10.1137\/1.9781611975673.82"},{"key":"44_CR28","doi-asserted-by":"crossref","unstructured":"Vehlow, C., Beck, F., Weiskopf, D.: Visualizing group structures in graphs: a survey. Comput. Graph Forum 36 (2017)","DOI":"10.1111\/cgf.12872"},{"key":"44_CR29","doi-asserted-by":"crossref","unstructured":"Xu, P., Cao, N., Qu, H., Stasko, J.: Interactive visual co-cluster analysis of bipartite graphs. IEEE Pac. Vis., 32\u201339 (2016)","DOI":"10.1109\/PACIFICVIS.2016.7465248"},{"key":"44_CR30","doi-asserted-by":"crossref","unstructured":"Zha, H., He, X., Ding, C.H.Q., Gu, M., Simon, H.D.: Bipartite graph partitioning and data clustering. In: ACM International Conference on Information and Knowledge Management, pp. 25\u201332 (2001)","DOI":"10.1145\/502585.502591"}],"container-title":["Lecture Notes in Computer Science","Machine Learning and Knowledge Discovery in Databases: Research Track"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-43412-9_44","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,16]],"date-time":"2023-09-16T20:35:52Z","timestamp":1694896552000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-43412-9_44"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031434112","9783031434129"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-43412-9_44","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"17 September 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"Boolean matrix factorization and similar pattern mining techniques can be used to identify tightly-knit communities (biclusters) from bipartite networks, which can help authorities to identify terrorist networks or dissidents from inter-communication networks. They can also be used to identify people\u2019s political opinions (e.g., by studying their social network behavior). The visualization methods discussed in this paper cannot be used for these actions directly, as they require the underlying mining algorithm, but they do facilitate the use of the mining algorithms in benign as well as nefarious purposes. We do consider that the overall positive effects of these methods greatly outweigh the problems caused by the as-such unavoidable negative use cases.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical Statement"}},{"value":"ECML PKDD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Joint European Conference on Machine Learning and Knowledge Discovery in Databases","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Turin","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 September 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 September 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ecml2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/2023.ecmlpkdd.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"CMT","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"829","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":"196","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":"24% - 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.63","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.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":"Applied Data Science Track: 239 submissions, 58 accepted papers; Demo Track: 31 submissions, 16 accepted papers.","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)"}}]}}