{"id":"https://openalex.org/W3080452411","doi":"https://doi.org/10.1145/3394486.3403174","title":"Data Compression as a Comprehensive Framework for Graph Drawing and Representation Learning","display_name":"Data Compression as a Comprehensive Framework for Graph Drawing and Representation Learning","publication_year":2020,"publication_date":"2020-08-20","ids":{"openalex":"https://openalex.org/W3080452411","doi":"https://doi.org/10.1145/3394486.3403174","mag":"3080452411"},"language":"en","primary_location":{"id":"doi:10.1145/3394486.3403174","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3394486.3403174","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3394486.3403174","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery &amp; Data Mining","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3394486.3403174","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5009516958","display_name":"Claudia Plant","orcid":"https://orcid.org/0000-0001-5274-8123"},"institutions":[{"id":"https://openalex.org/I129774422","display_name":"University of Vienna","ror":"https://ror.org/03prydq77","country_code":"AT","type":"education","lineage":["https://openalex.org/I129774422"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Claudia Plant","raw_affiliation_strings":["University of Vienna, Vienna, Austria"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Vienna, Vienna, Austria","institution_ids":["https://openalex.org/I129774422"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5059058024","display_name":"Sonja Biedermann","orcid":null},"institutions":[{"id":"https://openalex.org/I129774422","display_name":"University of Vienna","ror":"https://ror.org/03prydq77","country_code":"AT","type":"education","lineage":["https://openalex.org/I129774422"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Sonja Biedermann","raw_affiliation_strings":["University of Vienna, Vienna, Austria"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Vienna, Vienna, Austria","institution_ids":["https://openalex.org/I129774422"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5062860517","display_name":"Christian B\u00f6hm","orcid":"https://orcid.org/0000-0002-2237-9969"},"institutions":[{"id":"https://openalex.org/I8204097","display_name":"Ludwig-Maximilians-Universit\u00e4t M\u00fcnchen","ror":"https://ror.org/05591te55","country_code":"DE","type":"education","lineage":["https://openalex.org/I8204097"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Christian B\u00f6hm","raw_affiliation_strings":["Ludwig-Maximilians-Universit\u00e4t M\u00fcnchen, Munich, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Ludwig-Maximilians-Universit\u00e4t M\u00fcnchen, Munich, Germany","institution_ids":["https://openalex.org/I8204097"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.3916,"has_fulltext":true,"cited_by_count":6,"citation_normalized_percentile":{"value":0.62048651,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"40","issue":null,"first_page":"1212","last_page":"1222"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10799","display_name":"Data Visualization and Analytics","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10799","display_name":"Data Visualization and Analytics","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9957000017166138,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12536","display_name":"Topological and Geometric Data Analysis","score":0.9955000281333923,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/adjacency-matrix","display_name":"Adjacency matrix","score":0.6332492828369141},{"id":"https://openalex.org/keywords/graph-embedding","display_name":"Graph embedding","score":0.5687641501426697},{"id":"https://openalex.org/keywords/embedding","display_name":"Embedding","score":0.5398899912834167},{"id":"https://openalex.org/keywords/distance-matrix","display_name":"Distance matrix","score":0.5312649607658386},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5302816033363342},{"id":"https://openalex.org/keywords/entropy","display_name":"Entropy (arrow of time)","score":0.5163101553916931},{"id":"https://openalex.org/keywords/adjacency-list","display_name":"Adjacency list","score":0.481109082698822},{"id":"https://openalex.org/keywords/euclidean-distance","display_name":"Euclidean distance","score":0.45682600140571594},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.40338945388793945},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3972141146659851},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3921279311180115},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.3817828297615051},{"id":"https://openalex.org/keywords/pattern-recognition","display_name":"Pattern recognition (psychology)","score":0.36514049768447876},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2832438349723816}],"concepts":[{"id":"https://openalex.org/C180356752","wikidata":"https://www.wikidata.org/wiki/Q727035","display_name":"Adjacency matrix","level":3,"score":0.6332492828369141},{"id":"https://openalex.org/C75564084","wikidata":"https://www.wikidata.org/wiki/Q5597085","display_name":"Graph embedding","level":3,"score":0.5687641501426697},{"id":"https://openalex.org/C41608201","wikidata":"https://www.wikidata.org/wiki/Q980509","display_name":"Embedding","level":2,"score":0.5398899912834167},{"id":"https://openalex.org/C111208986","wikidata":"https://www.wikidata.org/wiki/Q901698","display_name":"Distance matrix","level":2,"score":0.5312649607658386},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5302816033363342},{"id":"https://openalex.org/C106301342","wikidata":"https://www.wikidata.org/wiki/Q4117933","display_name":"Entropy (arrow of time)","level":2,"score":0.5163101553916931},{"id":"https://openalex.org/C110484373","wikidata":"https://www.wikidata.org/wiki/Q264398","display_name":"Adjacency list","level":2,"score":0.481109082698822},{"id":"https://openalex.org/C120174047","wikidata":"https://www.wikidata.org/wiki/Q847073","display_name":"Euclidean distance","level":2,"score":0.45682600140571594},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.40338945388793945},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3972141146659851},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3921279311180115},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3817828297615051},{"id":"https://openalex.org/C153180895","wikidata":"https://www.wikidata.org/wiki/Q7148389","display_name":"Pattern recognition (psychology)","level":2,"score":0.36514049768447876},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2832438349723816},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3394486.3403174","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3394486.3403174","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3394486.3403174","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery &amp; Data Mining","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3394486.3403174","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3394486.3403174","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3394486.3403174","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery &amp; Data Mining","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3080452411.pdf","grobid_xml":"https://content.openalex.org/works/W3080452411.grobid-xml"},"referenced_works_count":21,"referenced_works":["https://openalex.org/W1020953626","https://openalex.org/W1503013560","https://openalex.org/W1888005072","https://openalex.org/W1991415536","https://openalex.org/W2026729066","https://openalex.org/W2041783407","https://openalex.org/W2100083479","https://openalex.org/W2146723843","https://openalex.org/W2154851992","https://openalex.org/W2162833336","https://openalex.org/W2167482691","https://openalex.org/W2187089797","https://openalex.org/W2393319904","https://openalex.org/W2788614083","https://openalex.org/W2809156873","https://openalex.org/W2888221391","https://openalex.org/W2962756421","https://openalex.org/W3023222955","https://openalex.org/W3098702884","https://openalex.org/W3104097132","https://openalex.org/W3105705953"],"related_works":["https://openalex.org/W4213150077","https://openalex.org/W1605858995","https://openalex.org/W2369410163","https://openalex.org/W2059018062","https://openalex.org/W2604585036","https://openalex.org/W2078477160","https://openalex.org/W1989103179","https://openalex.org/W2908582041","https://openalex.org/W4294328694","https://openalex.org/W1991172810"],"abstract_inverted_index":{"Embedding":[0,14,171],"a":[1,7,93,109],"graph":[2,136,152],"into":[3,15],"feature":[4],"space":[5,19,26],"is":[6,43,62,117],"promising":[8],"approach":[9],"to":[10,63,87,112,129,146,190],"understand":[11],"its":[12],"structure.":[13],"2D":[16],"or":[17,154],"3D":[18],"enables":[20,29],"visualization;":[21],"representation":[22,155],"in":[23,83,165,179],"higher-dimensional":[24],"vector":[25],"(typically":[27],">100D)":[28],"the":[30,37,46,49,54,57,65,70,76,80,84,89,97,114,121,131,135,148,174,193,201],"application":[31],"of":[32,39,56,72,134,150,192],"data":[33],"mining":[34],"techniques.":[35],"For":[36],"success":[38],"knowledge":[40],"discovery":[41],"it":[42,161],"essential":[44],"that":[45,182],"distances":[47],"between":[48,79],"embedded":[50],"vertices":[51,82],"truly":[52],"reflect":[53],"structure":[55],"graph.":[58],"Our":[59],"fundamental":[60],"idea":[61],"compress":[64,130],"adjacency":[66,132],"matrix":[67,133],"by":[68,137,172],"predicting":[69],"existence":[71],"an":[73,138],"edge":[74],"from":[75],"Euclidean":[77,122],"distance":[78],"corresponding":[81],"embedding,":[85],"and":[86,197],"use":[88,125,160],"achieved":[90],"compression":[91],"as":[92,162],"quality":[94,102,191],"measure":[95,103],"for":[96],"embedding.":[98],"We":[99,124,177],"call":[100],"this":[101,126],"Predictive":[104,175],"Entropy":[105],"(PE).":[106],"PE":[107,142],"uses":[108],"sigmoid":[110,127],"function":[111,164],"define":[113],"probability":[115,128],"which":[116],"monotonically":[118],"decreasing":[119],"with":[120,188],"distance.":[123],"entropy":[139],"coding.":[140],"While":[141],"could":[143],"be":[144],"used":[145],"assess":[147],"result":[149],"any":[151],"drawing":[153],"learning":[156],"method":[157,168],"we":[158],"particularly":[159],"objective":[163],"our":[166,180],"new":[167],"GEMPE":[169,183],"(Graph":[170],"Minimizing":[173],"Entropy).":[176],"demonstrate":[178],"experiments":[181],"clearly":[184],"outperforms":[185],"comparison":[186],"methods":[187],"respect":[189],"visual":[194],"result,":[195],"clustering":[196],"node-labeling":[198],"accuracy":[199],"on":[200],"discovered":[202],"coordinates.":[203]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":2}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}
