{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,8]],"date-time":"2026-02-08T05:01:07Z","timestamp":1770526867327,"version":"3.49.0"},"reference-count":47,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Visual. Comput. Graphics"],"published-print":{"date-parts":[[2019,1]]},"DOI":"10.1109\/tvcg.2018.2864826","type":"journal-article","created":{"date-parts":[[2018,8,20]],"date-time":"2018-08-20T22:17:45Z","timestamp":1534803465000},"page":"321-330","source":"Crossref","is-referenced-by-count":17,"title":["ViBr: Visualizing Bipartite Relations at Scale with the Minimum Description Length Principle"],"prefix":"10.1109","volume":"25","author":[{"given":"Gromit Yeuk-Yin","family":"Chan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Panpan","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zeng","family":"Dai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Liu","family":"Ren","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2015.2467813"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1145\/2556288.2557337"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2006.107"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1016\/0005-1098(78)90005-5"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2014.2346279"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2016.2534519"},{"key":"ref37","doi-asserted-by":"crossref","first-page":"4s","DOI":"10.1186\/1471-2105-15-S6-S4","article-title":"Furby: fuzzy force-directed bicluster visualization","volume":"15","author":"streit","year":"2014","journal-title":"BMC Bioinformatics"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1057\/palgrave.ivs.9500180"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1057\/palgrave.ivs.9500086"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2006.166"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2012.252"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2014.2346665"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/2339530.2339725"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/MC.2013.269"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2013.223"},{"key":"ref14","first-page":"17","article-title":"A comparison of the readability of graphs using node-link and matrix-based representations","author":"ghoniem","year":"2004","journal-title":"Information Visualization 2004 INFOVIS 2004 IEEE Symposium on"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.1999.754967"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/2827872"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1179\/000870403235002042"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2014.2322594"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511763113"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2009.111"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.3162\/036298008786403079"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/IV.2011.24"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2010.154"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/3035918.3058741"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/1376616.1376661"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/1014052.1014064"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2915245"},{"key":"ref7","article-title":"Sequence synopsis: Optimize visual summary of temporal event data","author":"chen","year":"2017","journal-title":"IEEE Transactions on Visualization and Computer Graphics"},{"key":"ref2","author":"bertin","year":"1983","journal-title":"Semiology of Graphics Diagrams Networks Maps"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/502512.502550"},{"key":"ref1","first-page":"1","article-title":"Visualizing sets and set-typed data: State-of-the-art and future challenges","author":"alsallakh","year":"2014","journal-title":"Eurographics conference on Visualization (EuroVis)-State of The Art Reports"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1145\/2702123.2702419"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/j.intcom.2007.05.004"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2005.60"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139924801"},{"key":"ref47","article-title":"Bidots: Visual exploration of weighted biclusters","author":"zhao","year":"2017","journal-title":"IEEE Transactions on Visualization and Computer Graphics"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1101\/gr.648603"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2016.2598591"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/s00371-013-0892-3"},{"key":"ref41","first-page":"16","article-title":"An efficient algorithm for enumerating closed patterns in transaction databases","author":"uno","year":"2004","journal-title":"International Conference on Discovery Science"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2016.2598831"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/PACIFICVIS.2016.7465248"},{"key":"ref26","first-page":"169","article-title":"Drawing bipartite graphs as anchored maps","author":"misue","year":"2006","journal-title":"APVis ' 06 Proceedings of the 2006 Asia-Pacific Symposium on Information Visualisation"},{"key":"ref43","author":"ware","year":"2012","journal-title":"Information Visualization Perception for Design"},{"key":"ref25","author":"ming","year":"2017","journal-title":"Understanding hidden memories of recurrent neural networks"}],"container-title":["IEEE Transactions on Visualization and Computer Graphics"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/2945\/8547224\/08440048.pdf?arnumber=8440048","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,13]],"date-time":"2022-07-13T20:48:36Z","timestamp":1657745316000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8440048\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,1]]},"references-count":47,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tvcg.2018.2864826","relation":{},"ISSN":["1077-2626","1941-0506","2160-9306"],"issn-type":[{"value":"1077-2626","type":"print"},{"value":"1941-0506","type":"electronic"},{"value":"2160-9306","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,1]]}}}