{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:23:02Z","timestamp":1750220582720,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":28,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,8,20]],"date-time":"2020-08-20T00:00:00Z","timestamp":1597881600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,8,23]]},"DOI":"10.1145\/3394486.3403174","type":"proceedings-article","created":{"date-parts":[[2020,8,20]],"date-time":"2020-08-20T23:17:27Z","timestamp":1597965447000},"page":"1212-1222","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Data Compression as a Comprehensive Framework for Graph Drawing and Representation Learning"],"prefix":"10.1145","author":[{"given":"Claudia","family":"Plant","sequence":"first","affiliation":[{"name":"University of Vienna, Vienna, Austria"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sonja","family":"Biedermann","sequence":"additional","affiliation":[{"name":"University of Vienna, Vienna, Austria"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christian","family":"B\u00f6hm","sequence":"additional","affiliation":[{"name":"Ludwig-Maximilians-Universit\u00e4t M\u00fcnchen, Munich, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2020,8,20]]},"reference":[{"key":"e_1_3_2_2_1_1","volume-title":"Multi-core K-means. In SIAM Int. Conf. Data Mining. 273--281","author":"Christian B\u00f6","year":"2017","unstructured":"Christian B\u00f6 hm, Martin Perdacher , and Claudia Plant . 2017 . Multi-core K-means. In SIAM Int. Conf. Data Mining. 273--281 . Christian B\u00f6 hm, Martin Perdacher, and Claudia Plant. 2017. Multi-core K-means. In SIAM Int. Conf. Data Mining. 273--281."},{"key":"e_1_3_2_2_2_1","volume-title":"Eigensolver Methods for Progressive Multidimensional Scaling of Large Data. In Int. Symp. on Graph Drawing. 42--53","author":"Brandes Ulrik","year":"2006","unstructured":"Ulrik Brandes and Christian Pich . 2006 . Eigensolver Methods for Progressive Multidimensional Scaling of Large Data. In Int. Symp. on Graph Drawing. 42--53 . Ulrik Brandes and Christian Pich. 2006. Eigensolver Methods for Progressive Multidimensional Scaling of Large Data. In Int. Symp. on Graph Drawing. 42--53."},{"key":"e_1_3_2_2_3_1","volume-title":"An Experimental Study on Distance-Based Graph Drawing. In Int. Symp. on Graph Drawing. 218--229","author":"Brandes Ulrik","year":"2008","unstructured":"Ulrik Brandes and Christian Pich . 2008 . An Experimental Study on Distance-Based Graph Drawing. In Int. Symp. on Graph Drawing. 218--229 . Ulrik Brandes and Christian Pich. 2008. An Experimental Study on Distance-Based Graph Drawing. In Int. Symp. on Graph Drawing. 218--229."},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"crossref","unstructured":"Jing Feng Xiao He Nina Hubig Christian B\u00f6hm and Claudia Plant. 2013. Compression-Based Graph Mining Exploiting Structure Primitives. In ICDM. 181--190.  Jing Feng Xiao He Nina Hubig Christian B\u00f6hm and Claudia Plant. 2013. Compression-Based Graph Mining Exploiting Structure Primitives. In ICDM. 181--190.","DOI":"10.1109\/ICDM.2013.56"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2339530.2339725"},{"volume-title":"Graphic Techniques for Exploring Social Network Data. In in Models and Methods in Social Network Analysis","author":"Freeman Linton C.","key":"e_1_3_2_2_6_1","unstructured":"Linton C. Freeman . 2004. Graphic Techniques for Exploring Social Network Data. In in Models and Methods in Social Network Analysis . Univ Press . Linton C. Freeman. 2004. Graphic Techniques for Exploring Social Network Data. In in Models and Methods in Social Network Analysis. Univ Press."},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"crossref","unstructured":"Arne Frick Andreas Ludwig and Heiko Mehldau. 1994. A Fast Adaptive Layout Algorithm for Undirected Graphs. In DIMACS Graph Drawing Worksh. 388--403.  Arne Frick Andreas Ludwig and Heiko Mehldau. 1994. A Fast Adaptive Layout Algorithm for Undirected Graphs. In DIMACS Graph Drawing Worksh. 388--403.","DOI":"10.1007\/3-540-58950-3_393"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1002\/spe.4380211102"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.7155\/jgaa.00052"},{"volume-title":"Int. Symp. on Graph Drawing. 239--250","author":"Gansner Emden R.","key":"e_1_3_2_2_10_1","unstructured":"Emden R. Gansner , Yehuda Koren , and Stephen C. North . 2004. Graph Drawing by Stress Majorization . In Int. Symp. on Graph Drawing. 239--250 . Emden R. Gansner, Yehuda Koren, and Stephen C. North. 2004. Graph Drawing by Stress Majorization. In Int. Symp. on Graph Drawing. 239--250."},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1177\/1473871612455749"},{"key":"e_1_3_2_2_12_1","volume-title":"Christian B\u00f6 hm, and Claudia Plant","author":"Goebl Sebastian","year":"2016","unstructured":"Sebastian Goebl , Annika Tonch , Christian B\u00f6 hm, and Claudia Plant . 2016 . MeGS: Partitioning Meaningful Subgraph Structures Using Minimum Description Length. In ICDM. 889--894. Sebastian Goebl, Annika Tonch, Christian B\u00f6 hm, and Claudia Plant. 2016. MeGS: Partitioning Meaningful Subgraph Structures Using Minimum Description Length. In ICDM. 889--894."},{"key":"e_1_3_2_2_13_1","unstructured":"Martin Gronemann. 2009. Engineering the Fast-Multipole-Multilevel Method for multicore and SIMD architectures. Master's thesis. Technische Univ. Dortmund.  Martin Gronemann. 2009. Engineering the Fast-Multipole-Multilevel Method for multicore and SIMD architectures. Master's thesis. Technische Univ. Dortmund."},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"crossref","unstructured":"Aditya Grover and Jure Leskovec. 2016. node2vec: Scalable Feature Learning for Networks. In KDD. 855--864.  Aditya Grover and Jure Leskovec. 2016. node2vec: Scalable Feature Learning for Networks. In KDD. 855--864.","DOI":"10.1145\/2939672.2939754"},{"key":"e_1_3_2_2_15_1","volume-title":"Int. Symp. on Graph Drawing. 285--295","author":"Hachul Stefan","year":"2004","unstructured":"Stefan Hachul and Michael J\u00fc nger. 2004 . Drawing Large Graphs with a Potential-Field-Based Multilevel Algorithm . In Int. Symp. on Graph Drawing. 285--295 . Stefan Hachul and Michael J\u00fc nger. 2004. Drawing Large Graphs with a Potential-Field-Based Multilevel Algorithm. In Int. Symp. on Graph Drawing. 285--295."},{"key":"e_1_3_2_2_16_1","first-page":"52","article-title":"Representation Learning on Graphs","volume":"40","author":"Hamilton William L.","year":"2017","unstructured":"William L. Hamilton , Rex Ying , and Jure Leskovec . 2017 . Representation Learning on Graphs : Methods and Applications. IEEE Data Eng. Bull. , Vol. 40 , 3 (2017), 52 -- 74 . William L. Hamilton, Rex Ying, and Jure Leskovec. 2017. Representation Learning on Graphs: Methods and Applications. IEEE Data Eng. Bull., Vol. 40, 3 (2017), 52--74.","journal-title":"Methods and Applications. IEEE Data Eng. Bull."},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2017.2689016"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.7155\/jgaa.00154"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623732"},{"key":"e_1_3_2_2_20_1","volume-title":"Figueiredo","author":"Rodrigues Ribeiro Leonardo Filipe","year":"2017","unstructured":"Leonardo Filipe Rodrigues Ribeiro , Pedro H. P. Saverese , and Daniel R . Figueiredo . 2017 . struc2vec: Learning Node Representations from Structural Identity. In KDD. 385--394. Leonardo Filipe Rodrigues Ribeiro, Pedro H. P. Saverese, and Daniel R. Figueiredo. 2017. struc2vec: Learning Node Representations from Structural Identity. In KDD. 385--394."},{"key":"e_1_3_2_2_21_1","volume-title":"Structure Preserving Embedding. In ICML Conference. 937--944","author":"Shaw Blake","year":"2009","unstructured":"Blake Shaw and Tony Jebara . 2009 . Structure Preserving Embedding. In ICML Conference. 937--944 . Blake Shaw and Tony Jebara. 2009. Structure Preserving Embedding. In ICML Conference. 937--944."},{"volume-title":"Contrastive Estimation: Training Log-Linear Models on Unlabeled Data. In ACL Conf. 354--362","author":"Noah","key":"e_1_3_2_2_22_1","unstructured":"Noah A. Smith and Jason Eisner. 2005 . Contrastive Estimation: Training Log-Linear Models on Unlabeled Data. In ACL Conf. 354--362 . Noah A. Smith and Jason Eisner. 2005. Contrastive Estimation: Training Log-Linear Models on Unlabeled Data. In ACL Conf. 354--362."},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2736277.2741093"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/3178876.3186120"},{"key":"e_1_3_2_2_25_1","first-page":"2579","article-title":"Visualizing High-Dimensional Data Using t-SNE","volume":"9","author":"van der Maaten Laurens","year":"2008","unstructured":"Laurens van der Maaten and Geoffrey E. Hinton . 2008 . Visualizing High-Dimensional Data Using t-SNE . Journal of Machine Learning Research , Vol. 9 (2008), 2579 -- 2605 . Laurens van der Maaten and Geoffrey E. Hinton. 2008. Visualizing High-Dimensional Data Using t-SNE. Journal of Machine Learning Research, Vol. 9 (2008), 2579--2605.","journal-title":"Journal of Machine Learning Research"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.5555\/1756006.1953024"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"crossref","unstructured":"Daixin Wang Peng Cui and Wenwu Zhu. 2016. Structural Deep Network Embedding. In KDD. 1225--1234.  Daixin Wang Peng Cui and Wenwu Zhu. 2016. Structural Deep Network Embedding. In KDD. 1225--1234.","DOI":"10.1145\/2939672.2939753"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"crossref","unstructured":"Ziwei Zhang Peng Cui Xiao Wang Jian Pei Xuanrong Yao and Wenwu Zhu. 2018. Arbitrary-Order Proximity Preserved Network Embedding. In KDD. 2778--2786.  Ziwei Zhang Peng Cui Xiao Wang Jian Pei Xuanrong Yao and Wenwu Zhu. 2018. Arbitrary-Order Proximity Preserved Network Embedding. In KDD. 2778--2786.","DOI":"10.1145\/3219819.3219969"}],"event":{"name":"KDD '20: The 26th ACM SIGKDD Conference on Knowledge Discovery and Data Mining","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data"],"location":"Virtual Event CA USA","acronym":"KDD '20"},"container-title":["Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3394486.3403174","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3394486.3403174","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T21:31:34Z","timestamp":1750195894000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3394486.3403174"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,8,20]]},"references-count":28,"alternative-id":["10.1145\/3394486.3403174","10.1145\/3394486"],"URL":"https:\/\/doi.org\/10.1145\/3394486.3403174","relation":{},"subject":[],"published":{"date-parts":[[2020,8,20]]},"assertion":[{"value":"2020-08-20","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}